diff --git a/posts/algorithms/competitive-programming-log.html b/posts/algorithms/competitive-programming-log.html index 319d5f7..cd37c7d 100644 --- a/posts/algorithms/competitive-programming-log.html +++ b/posts/algorithms/competitive-programming-log.html @@ -35,6 +35,47 @@

Competitive Programming Log

+

+ 1017 (div. 4)—14/4/2025 +

+
+ 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. +
+
    +
  1. + D: submitted what I knew to be incorrect. Can't account for + laziness. +
  2. +
  3. E: long long overflow. Laziness.
  4. +
  5. + F: lost focus here and did not prove the correctness. Was confused + by the grid—simply breaking down and experimenting 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. +
  6. +
  7. + 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. + Sometimes, there's nothing to learn besides improving your + discipline. +
  8. +
  9. + 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. +
  10. +

799 (div. 4)