I was wondering how many procedures does the IOI Server processes in a second, compared to Codeforces Server and is there any reference for that?
Thanks in advance
I was wondering how many procedures does the IOI Server processes in a second, compared to Codeforces Server and is there any reference for that?
Thanks in advance
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
There is nothing like "the IOI Server", testing machines are provided by each year's organiser (imagine having to ship a huge number of computers somewhere each year, replace them when they're outdated etc.), so the answer is: different number each year.
IOI tasks are set so that shouldn't matter, though.
So if I wanted to compute the complexity of my solution, How many procedures should I consider for a second?
I would say 10^8.
Let's say the same number as on CF.
I wrote a code with complexity 1e9 and it passed on codeforces (custom test) in 800-1000 ms, I guess that's a bit fast.
I guess it had a very good constant. Try 1e9 hashset insert/delete/lookup operations, each of them has complexity O(1).