| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3880 |
| 2 | jiangly | 3669 |
| 3 | ecnerwala | 3654 |
| 4 | Benq | 3627 |
| 5 | orzdevinwang | 3612 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | jqdai0815 | 3532 |
| 9 | Radewoosh | 3522 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | adamant | 156 |
| 4 | maroonrk | 153 |
| 5 | -is-this-fft- | 148 |
| 5 | atcoder_official | 148 |
| 5 | SecondThread | 148 |
| 8 | Petr | 147 |
| 9 | nor | 144 |
| 9 | TheScrasse | 144 |
I tried to hack the solution http://codeforces.com/contest/548/submission/11295460 using the hack http://codeforces.com/contest/548/hacks/155602/test but it was unsuccesful .
I am unable to understand that despite being a O(n*m*q) solution, how the solution passed the hack but eventually got TLE on a system test?
My guess is that since your case was all zeroes, the code ran fast because of branch prediction, while the system test had random data.
TLE is a matter of number of iterations or operations involved while running the code.
So what if it's all 0 or randomly 0 and 1, the code has to complete the n*m*q (500*500*5000 = 1.25 * 10^9) operations which should give a TLE!
Correct me if I am wrong, but isn't no of operations executed in 1 second are roughly of the order of 10^7 and not 10^9 ?
You are wrong (or rather from 2003), 3-5 * 10^9 of very easy operations are possible. And branch prediction is a thing
okay. thanks for correcting me.
Also if I understand correctly on your test ouptput is 1 digit per line while the test which gives TL output is 2 digits per line
I dont think so! My hack had outputs correctly matching with the TL output .I am also printing 2 digits per line.