https://codeforces.me/contest/1237/submission/62742100
Looks N^3, but seems to be N^2 after constructing many cases. Any proofs/can you hack it?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 163 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | awoo | 158 |
6 | atcoder_official | 157 |
7 | adamant | 155 |
7 | nor | 155 |
9 | maroonrk | 152 |
10 | Dominater069 | 148 |
https://codeforces.me/contest/1237/submission/62742100
Looks N^3, but seems to be N^2 after constructing many cases. Any proofs/can you hack it?
Name |
---|
You can try this input:
Something like this makes your algorithm work in $$$O(n^3)$$$ time. You need $$$O(n)$$$ points on each diagonal:
In contest I submitted the same idea but I was sorting first.
my submission
I tried (CUSTOM INVOCATION) it passed your testcase in 31ms, I also believe that it remains O(N^3). How it pass all testcases and your testcase ? mnbvmar