I want to find out time complexity and space complexity of this code.
https://cses.fi/paste/4c432ea7de710eac40593c/
I was trying to solve this task but I was getting TLE.
№ | Пользователь | Рейтинг |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
I want to find out time complexity and space complexity of this code.
https://cses.fi/paste/4c432ea7de710eac40593c/
I was trying to solve this task but I was getting TLE.
Название |
---|
Auto comment: topic has been updated by .dragonman164 (previous revision, new revision, compare).
Wow, you really have no clue. I guess you just think that segment tree is magic.
Time complexity is $$$O(n \log^2 n + qn \log n)$$$, space complexity is $$$O(n \log n + qn)$$$ ($$$qn$$$ part might not be true, I'm not sure how is it measured).
Lol!!! I got it. Thanks!!!!