My solution giving tle at test case 9, i don,t know why this happening 1423K - Lonely Numbers
plz help
# | User | Rating |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | TheScrasse | 158 |
5 | nor | 153 |
5 | maroonrk | 153 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
10 | pajenegod | 144 |
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.