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)?
№ | Пользователь | Рейтинг |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | jiangly | 3578 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | tourist | 3565 |
8 | maroonrk | 3531 |
9 | Radewoosh | 3521 |
10 | Um_nik | 3482 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
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. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en2 | AbhishekAg | 2020-06-28 12:35:51 | 45 | |||
en1 | AbhishekAg | 2020-06-28 11:48:03 | 343 | Initial revision (published) |
Название |
---|