summaryrefslogtreecommitdiff
path: root/codeforces.md
diff options
context:
space:
mode:
authorAnthony Wang2022-03-16 16:10:58 -0500
committerAnthony Wang2022-03-16 16:10:58 -0500
commit43a8e25e4e803794fbded027621210fe761314cc (patch)
tree51c39856232e035933b2442ac229e1a002da8316 /codeforces.md
parentd1d17bd45021b76d67f109cab54bd1382c96a2d2 (diff)
Implemented 1650G
Diffstat (limited to 'codeforces.md')
-rw-r--r--codeforces.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/codeforces.md b/codeforces.md
index c093488..756d117 100644
--- a/codeforces.md
+++ b/codeforces.md
@@ -548,4 +548,4 @@
- 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
+- ~~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~~