hi! Recently I found during hack of 57024850,but though it's take 15 second in testcase t=1,n=1000000000,x=100000000 my hacks fails.
It doesn't take time limit in hacks?? Sorry for my poor English.
Thank You!!
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
hi! Recently I found during hack of 57024850,but though it's take 15 second in testcase t=1,n=1000000000,x=100000000 my hacks fails.
It doesn't take time limit in hacks?? Sorry for my poor English.
Thank You!!
Название |
---|
umm try checking the constraints again its x<n and ur x and n are equal, it fails coz of that probs
its n=10^9,x=10^8
my bad my bad
I think it must be optimized by c++ itself
Run the code in custom invocation to see its running time in CF environment.
Try adding -O2 to your compilation flags locally, then it should be really fast.
Looks like it is fast enough, there are at most 10^10 operations, which should run in time.
10^10 operations should almost never run in time.