My solution was $$$O(n\log^3 n)$$$ with some optimizations, I was trying to hack myself but I get a "Unexpected Verdict"(hack 678765).
Could you please have a look at this AliShahali1382?
№ | Пользователь | Рейтинг |
---|---|---|
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 | 166 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
My solution was $$$O(n\log^3 n)$$$ with some optimizations, I was trying to hack myself but I get a "Unexpected Verdict"(hack 678765).
Could you please have a look at this AliShahali1382?
Название |
---|
Well, you can refer to this
I can't hack my solution because of this, either:(
The problem was fixed, thank you.