Rajan_sust's blog

By Rajan_sust, history, 7 years ago, In English

Is 10^9 computation is possible before 2.00 seconds? If not possible,how my solution works of following problem? Problem link: http://codeforces.net/problemset/problem/851/C Submission: http://codeforces.net/contest/851/submission/30089349

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

It depends on what you mean by "computation". I assume here you mean that your solution is O(n3) and n ≤ 103 hence the number 109,  but for each triplet of points you process here, you are making many more auxiliary "computations", each of which take different amounts of time. If I understand you correctly, generally brute forcing 109 cases will not pass in 2 seconds, but I think your continue; and return; statements in your function pruned the search considerably (it can be shown that, by at latest the 12th iteration, there will be an acute angle).