barrett/barrettruth.com
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

feat(codeforces): 1017

Browse source
This commit is contained in:
Barrett Ruth 2025-04-14 15:06:28 -04:00
parent 766346bc1d
commit c64366d926
1 changed files with 41 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

41
posts/algorithms/competitive-programming-log.html
View file

@ -35,6 +35,47 @@
<h1 class="post-title">Competitive Programming Log</h1>
</header>
<article class="post-article">
<h2>
<a href="https://codeforces.com/contest/2094" target="_blank"
>1017 (div. 4)</a
>&mdash;14/4/2025
</h2>
<div>
Decent contest. Lost focus near the end and was not paying attention
at the start (I was working on my makefile). This is a telltale sign
that Div. 4 is a bit too easy. F & G should've been lightwork.
</div>
<ol>
<li>
D: submitted what I knew to be incorrect. Can't account for
laziness.
</li>
<li>E: long long overflow. Laziness.</li>
<li>
F: lost focus here and did not prove the correctness. Was confused
by the grid&mdash;simply breaking down and <i>experimenting</i> in
terms of simple patterns would help isolate that a mutation after
\(m%K==0\) is key. Then, a subsequent rigorous proof of the modulo
shift would help.
</li>
<li>
G: gave up after a few insights and did not persevere to find the
simple mathematical equation for updating the score on reversal
although I got the deque intution.
<b
>Sometimes, there's nothing to learn besides improving your
discipline.</b
>
</li>
<li>
My math intuition needs to improve. I see something hard (i.e.
dividing out a number repeatedly) then think "this is impossible"
rather than "this seems hard, but is it feasible? Is it
computationally practical?" In this case, I know the solution
rests on the fact of only a logarithmic (?) amount of numbers can
end up dividing \(a[i]\). Time to upsolve later.
</li>
</ol>
<h2>
<a href="https://codeforces.com/contest/1692" target="_blank"
>799 (div. 4)</a