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!!
# | 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 | 156 |
7 | adamant | 151 |
7 | djm03178 | 151 |
7 | luogu_official | 151 |
10 | awoo | 146 |
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!!
Name |
---|
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.