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
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 165 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
5 | nor | 151 |
7 | atcoder_official | 147 |
8 | TheScrasse | 146 |
9 | Petr | 145 |
10 | SecondThread | 142 |
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
Name |
---|
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).