diff options
| -rw-r--r-- | codeforces.md | 2 |
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 |