summaryrefslogtreecommitdiff
path: root/codeforces.md
diff options
context:
space:
mode:
authorAnthony Wang2022-03-16 16:10:49 -0500
committerAnthony Wang2022-03-16 16:10:49 -0500
commitd1d17bd45021b76d67f109cab54bd1382c96a2d2 (patch)
treea4a620588e0bb5e4eb8385f23377c7ab187d523c /codeforces.md
parent4e89bd61cd1626bfcb9df10f98afd9040516a1b5 (diff)
1650G
Diffstat (limited to 'codeforces.md')
-rw-r--r--codeforces.md2
1 files changed, 2 insertions, 0 deletions
diff --git a/codeforces.md b/codeforces.md
index c948ae8..c093488 100644
--- a/codeforces.md
+++ b/codeforces.md
@@ -547,3 +547,5 @@
- ~~1641C: Optimize a slow solution using a set so every person is only processed once~~
- 1632D: Wow at least I can still solve 2000 rating problems, since it's this difficulty, you can assume it has a reasonably easy and greedy solution, and then some binary search or two pointers to speed things up
+
+- 1650G: Mostly BFS but the overcounting is very tricky to avoid, but you can think about what the longer paths look like to find a way to only count them once, basically when they diverge from the short paths