I tried to solve this problem: Optimal insertion using persistent segment tree. It gives me MLE for some reasons that I don't understand. Could anyone help me. My submission: Code
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
Memory limit exceed using persistent segment tree
I tried to solve this problem: Optimal insertion using persistent segment tree. It gives me MLE for some reasons that I don't understand. Could anyone help me. My submission: Code
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en1 | DuongForeverAlone | 2023-10-16 07:37:47 | 339 | Initial revision (published) |
Name |
---|