Is there O(n^2) solution? I use O(n^3/16)+O(n*m) with very very small constant and got accepted...561ms
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
http://codeforces.net/gym/100927 problem B
Is there O(n^2) solution? I use O(n^3/16)+O(n*m) with very very small constant and got accepted...561ms
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en1 | Los_Angelos_Laycurse | 2016-03-14 06:01:07 | 152 | Initial revision (published) |
Name |
---|