# | 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 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Name |
---|
query function shouldn't create new nodes. It's horrible.
You have O(N·log2(N)) space complexity with this code.
You are right !!!
fixed it and got my AC thank you so much :D
btw i have to say .. nice pic :D
You got ML, not TL. You programs eats too much memory. That's exactly because of persistent segment tree, as you save all previous steps and it needs a lot of memory.
typo ... i meant MLE
I am also facing the same issue. Can someone check my code and tell why it is giving MLE.
79459003
MrDindows, Maybe you can help here.
Use bump allocator
This was very nice question ... I did it now .. Great question
Thanks a lot bro