You are given a set of points with their integer coordinates. You need to determine if there are convex quarilaterals in at most O(n^2) time.
For example: 5 2 2 5 3 8 2 7 6 4 7 Has
5 2 2 7 6 7 4 9 4 10 4 Has not
Thank you for your help!
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 152 |
9 | maroonrk | 152 |
Check if there is a convex quadrilateral from a given set of points
You are given a set of points with their integer coordinates. You need to determine if there are convex quarilaterals in at most O(n^2) time.
For example: 5 2 2 5 3 8 2 7 6 4 7 Has
5 2 2 7 6 7 4 9 4 10 4 Has not
Thank you for your help!
Name |
---|