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!!
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 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
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.