In GCJ problems this year, the time limits are stated 20 seconds per test set. I don't know how many calculations could GCJ do in 1 second?
In GCJ problems this year, the time limits are stated 20 seconds per test set. I don't know how many calculations could GCJ do in 1 second?
# | 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 | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
I think, you can expect ~$$$10^8-10^9$$$ operations per second, depending of operations type.
I think it should be ~10^8 for each test case, otherwise I could do something like 20*10^8 -> 20*10^9 = 2*10^9 -> 2*10^10 per test case, which is a little bit too much.
It depends what language you are using. Assuming you use fastIO, the max bigO runtime per testcase you can have per language is approximately:
C++: 3*10^8, Java: 10^8, Python: 152
And idea about What will be the estimated operations if we're using costly operations like
/
and%
?I have no idea for the
/
, but it should be equal to+
,-
,*
.For the
%
, for example,a % b
, I think it is implemented likea - (a / b * b)
(assume that a and b are integer), so it might be 3 times slower, but I'm not sure about this neither.Is that a typo for Python? It doesn't seem right that it should be 5-6 orders of magnitude slower than Java.
Yeah, I thought Python was even slower than that
Should be closer to 15.2
I'm using C++ for all submissions with normal
cin
andcout
, so it should be a little bit less I think (maybe around 10^8/test case, I usually assume this number of operations)For a second I thought that we were making fun of the slow servers this year. (Looking at you, shameful KS round 1A)