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 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | adamant | 157 |
6 | awoo | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | djm03178 | 153 |
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
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).