My submission works in O(n logn logA) = 1.2*10^8. Its time limit is 8 seconds
Submission link: https://codeforces.net/contest/1777/submission/238628649
If we iterate on smaller segment then the query will run for nlogn times and trie works in log A
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
My submission works in O(n logn logA) = 1.2*10^8. Its time limit is 8 seconds
Submission link: https://codeforces.net/contest/1777/submission/238628649
If we iterate on smaller segment then the query will run for nlogn times and trie works in log A
Название |
---|
U r lgm, you can deal with that by yourself.