This is a very simple code so I didn't expect it to take more than 1000 ms. How could I optimize it? https://codeforces.com/contest/380/submission/116189186
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | pajenegod | 145 |
9 | SecondThread | 145 |
This is a very simple code so I didn't expect it to take more than 1000 ms. How could I optimize it? https://codeforces.com/contest/380/submission/116189186
Название |
---|
Your time complexity is O(m*n). That's why TLE!!
your code can run at most n*m operations where n is the length of the string and m is the number of queries. since you loop from l to r a total of m times, this can go to at most 10^11 operations which will tle.