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 | jiangly | 4039 |
2 | tourist | 3841 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3590 |
5 | ecnerwala | 3542 |
6 | Benq | 3535 |
7 | orzdevinwang | 3526 |
8 | gamegame | 3477 |
9 | heuristica | 3357 |
10 | Radewoosh | 3355 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 165 |
3 | atcoder_official | 160 |
3 | Um_nik | 160 |
5 | djm03178 | 158 |
6 | Dominater069 | 156 |
7 | adamant | 153 |
8 | luogu_official | 152 |
9 | awoo | 151 |
10 | TheScrasse | 147 |
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