→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 154 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 146 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 133 |
| 10 | cry | 130 |
→ Find user
→ Recent actions
Comments
|
0
Same problem :( I won't use unordered containers in C++ anymore! |
|
+1
Absolutely agree :) So why not to disable C++ compiler optimizations on Codeforces? Because now hacking such cases is just like trying your luck :( |
|
+10
Could someone explain me how this solution (http://codeforces.me/contest/596/submission/14278463) passed all tests?! P.S.: during the contest I tried to hack it several times using tests like  but without any success :( |
|
+14
But in C++ O(n3) solution is even faster than supposed
P.S.: Really nice contest! Thanks to the author! |
solution :)|
-7
Vypiem_za_Lubov |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/10/2026 12:11:24 (g2).
Desktop version, switch to mobile version.
Supported by
