It is an interesting thing that the brute force passed the problem D https://mirror.codeforces.com/contest/1808/submission/199698146
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | atcoder_official | 156 |
4 | cry | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
8 | adamant | 153 |
9 | Um_nik | 152 |
10 | djm03178 | 146 |
It is an interesting thing that the brute force passed the problem D https://mirror.codeforces.com/contest/1808/submission/199698146
Название |
---|
How to hack it?
Because of the first two lines
I belief that the code will reach to time limit at least in the case N=2*10^5, k=10^5. It seems like the test didn't strong enough :D
Actually, I see the code was hacked.