My solution giving tle at test case 9, i don,t know why this happening 1423K - Lonely Numbers
plz help
# | 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 |
My solution giving tle at test case 9, i don,t know why this happening 1423K - Lonely Numbers
plz help
Name |
---|
This happened to me in the contest: my accepted solution and my multiple rejected solutions differed only in the fact that I used a Fast IO configuration in the accepted solution. I suspect this is your problem. The input size (10^6) makes this a danger.
It was hugely frustrating for me at the time, especially as it was during the contest, but I suppose understanding the need with Fast IO is part of competitive programming.