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 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
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.
Название |
---|