Is 10^9 computation is possible before 2.00 seconds? If not possible,how my solution works of following problem? Problem link: http://codeforces.com/problemset/problem/851/C Submission: http://codeforces.com/contest/851/submission/30089349
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
Is 10^9 computation is possible before 2.00 seconds? If not possible,how my solution works of following problem? Problem link: http://codeforces.com/problemset/problem/851/C Submission: http://codeforces.com/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).