I'm trying to solve this problem Link but the best approach I can come up with is (max(n,m))^3*logn . An efficient solution will be appreciated thanks.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
Help for a 1600 problem with no editorial
I'm trying to solve this problem Link but the best approach I can come up with is (max(n,m))^3*logn . An efficient solution will be appreciated thanks.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en1 | sister_of_contestfucker | 2020-02-11 04:35:12 | 241 | Initial revision (published) |
Name |
---|