why my this code 118446438 get Time limit exceeded and this code 118446206 get accepted in problem 1535C - Unstable String
any hint
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
why my this code 118446438 get Time limit exceeded and this code 118446206 get accepted in problem 1535C - Unstable String
any hint
Name |
---|
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