From 0470be6fbebdc34e68242a09f36f25126bc9b708 Mon Sep 17 00:00:00 2001 From: Barrett Ruth Date: Mon, 28 Apr 2025 11:45:31 -0400 Subject: [PATCH] feat(cp-log): usaco bronze notes --- .../competitive-programming-log.html | 62 +++++++++++++++++++ 1 file changed, 62 insertions(+) diff --git a/posts/algorithms/competitive-programming-log.html b/posts/algorithms/competitive-programming-log.html index 34e1236..03825b9 100644 --- a/posts/algorithms/competitive-programming-log.html +++ b/posts/algorithms/competitive-programming-log.html @@ -24,6 +24,68 @@

competitive programming log

+

+ usaco bronze: (basic) complete search + +

+

+ Implementation wise, two-pointers boundary conditions trip me up. + Spend more time on problems statements and go for the easiest + solution. +

+

+ cowntact tracing was the absolute + worst. I misinterpreted the problem constraints (i.e. thought hoof + shakes in last \(k\) time units, not last \(k\) shakes) then failed + to identify all parts of my code that had erroneous logic. + Then I did this 3 times over. +

+
+ Once a crux observation/error is realized, reexamine all parts of + the code/plan and see how they're impacted. +
+

+ usaco bronze: simulation + +

+

+ These problems are relatively easy but exposed my poor + implementation abilities. A lack of implementation implies a lack of + understanding. Specifically, I encountered the following problems: +

+

1020 (div. 3)