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?
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
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 |
"Unexpected Verdict" in Codeforces Round #684 Problem C
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?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | menjihuang | 2020-11-18 10:41:59 | 2 | Tiny change: '678765).\nCould yo' -> '678765).\n\nCould yo' | ||
en1 | menjihuang | 2020-11-18 10:28:12 | 259 | Initial revision (published) |
Name |
---|