My solution giving tle at test case 9, i don,t know why this happening 1423K - Lonely Numbers
plz help
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 155 |
7 | djm03178 | 152 |
7 | adamant | 152 |
9 | luogu_official | 150 |
10 | awoo | 147 |
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.