Can someone tell me why my solution got tle. As par I know deque takes O(1) for insertion and deletion from front and back.
# | User | Rating |
---|---|---|
1 | tourist | 3857 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 165 |
2 | -is-this-fft- | 161 |
3 | Qingyu | 160 |
4 | Dominater069 | 158 |
5 | atcoder_official | 157 |
6 | adamant | 155 |
7 | Um_nik | 151 |
7 | djm03178 | 151 |
9 | luogu_official | 149 |
10 | awoo | 148 |
Name |
---|
Removed cerr and got AC: https://codeforces.net/contest/1419/submission/184576812
Thanks. But why it happened? Also should I use cerr further?
Because cerr is slow, use it only when you write small amount of data.