why my this code 118446438 get Time limit exceeded and this code 118446206 get accepted in problem 1535C - Unstable String
any hint
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | cry | 155 |
4 | adamant | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
why my this code 118446438 get Time limit exceeded and this code 118446206 get accepted in problem 1535C - Unstable String
any hint
Название |
---|
for(int i=0 ; i<strlen(s) ; i++)
strlen(s)
has $$$O(n)$$$ complexity so this whole loop has $$$O(n^2)$$$ complexity.strlen() is O(n)
the way strlen works is that it will scan and count, until it finds a null character: every time you call strlen, it scans again and again from the beginning, so it's inefficient, while s.size() is constant