Hi!
For this problem, the time complexity of my implementation is around O(q * k * log(n)), but it got TLE. So I wonder what would be the intended time complexity for this problem?
Thanks!
# | 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- | 161 |
3 | maomao90 | 160 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
Hi!
For this problem, the time complexity of my implementation is around O(q * k * log(n)), but it got TLE. So I wonder what would be the intended time complexity for this problem?
Thanks!
Name |
---|
.
I think it will be the $$$O(Q\cdot\sqrt{N}+\sum{K})$$$, so it musb be needed $$$O(1)$$$ update each point update and $$$O(\sqrt{N})$$$ in every tree path (IN MY OPINIOON)