Getting TLE on test case 8 for this problem. I read the editorial which had O(n) complexity. My soln has a complexity of O(n *log n) but as n has an upper bound of 2e5 it should pass right (if it is correct)?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
time limit exceeded
Getting TLE on test case 8 for this problem. I read the editorial which had O(n) complexity. My soln has a complexity of O(n *log n) but as n has an upper bound of 2e5 it should pass right (if it is correct)?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | AbhishekAg | 2020-06-28 12:35:51 | 45 | |||
en1 | AbhishekAg | 2020-06-28 11:48:03 | 343 | Initial revision (published) |
Name |
---|