How fast is CF Judgers?
How long will it run a program (in C++) that its time complexity is $$$O(N)$$$ and $$$N = 10^8$$$? What about $$$N = 10^9$$$?
# | 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 | 163 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
Auto comment: topic has been updated by xcx0902 (previous revision, new revision, compare).
It depends on a lot of factors, but, as a rule of thumb, 10 ^ 8 operations are done in 1 second.
You are wrong. Now that number is 10^9, or at least 4 * 10^8
It isn't actually important what is the time complexity, but how many operations you perform.
Before you ask about judger performance, learn some faster algorithms.
https://codeforces.com/blog/entry/21344
Might help if you want to know "How to determine the (expected) complexity of expected solution of a problem by looking at its constraints?"