| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3977 |
| 2 | tourist | 3815 |
| 3 | jqdai0815 | 3682 |
| 4 | ksun48 | 3614 |
| 5 | orzdevinwang | 3526 |
| 6 | ecnerwala | 3514 |
| 7 | Benq | 3483 |
| 8 | hos.lyric | 3381 |
| 9 | gamegame | 3374 |
| 10 | heuristica | 3358 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 170 |
| 2 | -is-this-fft- | 162 |
| 3 | Um_nik | 161 |
| 4 | atcoder_official | 159 |
| 5 | djm03178 | 157 |
| 6 | Dominater069 | 156 |
| 7 | adamant | 154 |
| 8 | luogu_official | 152 |
| 8 | awoo | 152 |
| 10 | TheScrasse | 147 |
Hello,
I don't understand why my solution got a TLE for problem B. Here is the solution I came up with during the contest: 299645061. I'm quite sure the complexity is O(nlogn) but maybe I'm wrong. Here is another solution that doesn't use del: 299814673 even though if I remember correctly the complexity of del is O(1).
Does anyone have similar results?
https://codeforces.me/contest/1526/submission/276695133
It outputs YES YES NO on my computer but YES NO NO on codeforces, for the first test case.
Can somebody help me figure it out? Thanks
