My solution 8329406 to the problem 295B - Егор и граф is O(N^3), but it runs within 3 seconds? How is it possible? N is 500.
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
My solution 8329406 to the problem 295B - Егор и граф is O(N^3), but it runs within 3 seconds? How is it possible? N is 500.
Name |
---|
The code you shared took 1090 ms (i.e. almost 1 second) and got Accepted. It didn't take 3 seconds. 500^3 = 1.25*10^8.
I meant less than 3 seconds. Actually time shown is twice of actual time so it takes half a second.
How does 1.25*10^8 work in half a second?
Nothing special, Codeforces servers can do sometimes about 4 * 108 operations per second.
Hm... okay, I read somewhere it is 10^7. Thanks.