I did this question by Segment tree but my solution is throwing TLE. I I think the TC is O(n logn) for larger cases. So I think it should work this way but it is failing. Is it not possible to further optimize it doing this way ?
# | User | Rating |
---|---|---|
1 | jiangly | 3977 |
2 | tourist | 3815 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3614 |
5 | orzdevinwang | 3526 |
6 | ecnerwala | 3514 |
7 | Benq | 3483 |
8 | hos.lyric | 3381 |
9 | gamegame | 3374 |
10 | heuristica | 3358 |
# | User | Contrib. |
---|---|---|
1 | cry | 170 |
2 | -is-this-fft- | 162 |
3 | Um_nik | 161 |
4 | atcoder_official | 159 |
5 | djm03178 | 157 |
6 | Dominater069 | 156 |
7 | adamant | 154 |
8 | luogu_official | 152 |
8 | awoo | 152 |
10 | TheScrasse | 147 |
Help in a question
I did this question by Segment tree but my solution is throwing TLE. I I think the TC is O(n logn) for larger cases. So I think it should work this way but it is failing. Is it not possible to further optimize it doing this way ?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | shivanshsingh9670 | 2023-03-13 11:18:54 | 3 | Tiny change: '380/C)\n\n![ Submission ](https://' -> '380/C)\n\n[Submission](https://' | ||
en1 | shivanshsingh9670 | 2023-03-13 11:17:06 | 388 | Initial revision (published) |
Name |
---|