Can we solve problem 1920C - Partitioning the Array faster in O(n*d(n)) ≈ O(n^(4/3))?
I'm getting interested in it.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
3 | maomao90 | 161 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | nor | 155 |
7 | adamant | 155 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
About problem C in latest contest
Can we solve problem 1920C - Partitioning the Array faster in O(n*d(n)) ≈ O(n^(4/3))?
I'm getting interested in it.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 | a_little_cute | 2024-01-14 07:53:04 | 4 | Tiny change: 'C] faster in O(n*d(n)' -> 'C] faster than O(n*d(n)' | ||
en2 | a_little_cute | 2024-01-14 07:52:29 | 2 | Tiny change: 'O(n*d(n)) ~ O(n^(4/3)' -> 'O(n*d(n)) ≈ O(n^(4/3)' | ||
en1 | a_little_cute | 2024-01-14 07:52:11 | 136 | Initial revision (published) |
Name |
---|