Hi!
For this problem, the time complexity of my implementation is around O(q * k * log(n)), but it got TLE. So I wonder what would be the intended time complexity for this problem?
Thanks!
№ | Пользователь | Рейтинг |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Hi!
For this problem, the time complexity of my implementation is around O(q * k * log(n)), but it got TLE. So I wonder what would be the intended time complexity for this problem?
Thanks!
I just looked at the scoreboard of round 720 and was surprised by how a Div2 participant (krasav4ik) was able to solve D in 13 minutes. Then I clicked on his submission for D and saw a very different style compared to his previous A, B, C submissions. Take a look at these submissions 115581818, 115571933. I don't think they were written by the same person. Is this behavior considered as cheating?
Update: oneninetyfive found this D submission is from StickBuerak. I don't know why but they keep downvoting my every comment probably in order to hide it so no one can see.
Название |
---|