summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAnthony Wang2022-03-15 20:08:46 -0500
committerAnthony Wang2022-03-15 20:08:46 -0500
commit4e89bd61cd1626bfcb9df10f98afd9040516a1b5 (patch)
tree9d455714e1cac01c91c289433fed7bdc6aa0f54f
parent82f6033eb54ef334105be695727367f0a3750c39 (diff)
1632D
-rw-r--r--codeforces.md2
1 files changed, 2 insertions, 0 deletions
diff --git a/codeforces.md b/codeforces.md
index dff01fc..c948ae8 100644
--- a/codeforces.md
+++ b/codeforces.md
@@ -545,3 +545,5 @@
- ~~1646E: Pretty trivial but make sure you read the limits correctly~~
- ~~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