xcx0902's blog

About CF Judgers
By xcx0902, history, 2 years ago, In English

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$$$?

  • Vote: I like it
  • -12
  • Vote: I do not like it

»
2 years ago, # |
  Vote: I like it +1 Vote: I do not like it

Auto comment: topic has been updated by xcx0902 (previous revision, new revision, compare).

→ Reply
»
2 years ago, # |
  Vote: I like it +18 Vote: I do not like it

It depends on a lot of factors, but, as a rule of thumb, 10 ^ 8 operations are done in 1 second.

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You are wrong. Now that number is 10^9, or at least 4 * 10^8

    → Reply
»
2 years ago, # |
  Vote: I like it -8 Vote: I do not like it

You can easy check it by yourself. For example in such way: https://codeforces.net/contest/1702/submission/165129718

→ Reply
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

It isn't actually important what is the time complexity, but how many operations you perform.

→ Reply
»
2 years ago, # |
  Vote: I like it -10 Vote: I do not like it

Before you ask about judger performance, learn some faster algorithms.

→ Reply
»
2 years ago, # |
  Vote: I like it +20 Vote: I do not like it

https://codeforces.net/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?"

→ Reply