In the last div2 B problem, 283258843 isnt this submission O(nlogn) ?? If it is so then why is it getting TLEd :(. Otherwise what is the correct complexity?
Resolved
In the last div2 B problem, 283258843 isnt this submission O(nlogn) ?? If it is so then why is it getting TLEd :(. Otherwise what is the correct complexity?
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en2 |
|
blablabla1803 | 2024-09-28 12:24:18 | 15 | ||
| en1 |
|
blablabla1803 | 2024-09-28 12:10:42 | 183 | Initial revision (published) |