My solution giving tle at test case 9, i don,t know why this happening 1423K - Lonely Numbers
plz help
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
2 | maomao90 | 162 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | nor | 155 |
7 | adamant | 155 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
My solution giving tle at test case 9, i don,t know why this happening 1423K - Lonely Numbers
plz help
Название |
---|
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.