My solution 8329406 to the problem 295B - Greg and Graph is O(N^3), but it runs within 3 seconds? How is it possible? N is 500.
My solution 8329406 to the problem 295B - Greg and Graph is O(N^3), but it runs within 3 seconds? How is it possible? N is 500.
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
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.