aboutsummaryrefslogtreecommitdiff
path: root/09_geometry/line_segment_intersection_2190.cpp
diff options
context:
space:
mode:
authorSebastiano Tronto <sebastiano@tronto.net>2026-07-06 19:08:08 +0200
committerSebastiano Tronto <sebastiano@tronto.net>2026-07-06 19:08:08 +0200
commit96254947699986c59f0dc63d69fd4b76bd3ed43e (patch)
tree6c4dca945d7f7427c48be234d827fe4d33be02c5 /09_geometry/line_segment_intersection_2190.cpp
downloadcses-96254947699986c59f0dc63d69fd4b76bd3ed43e.tar.gz
cses-96254947699986c59f0dc63d69fd4b76bd3ed43e.zip
Initial commit
Diffstat (limited to '09_geometry/line_segment_intersection_2190.cpp')
-rw-r--r--09_geometry/line_segment_intersection_2190.cpp41
1 files changed, 41 insertions, 0 deletions
diff --git a/09_geometry/line_segment_intersection_2190.cpp b/09_geometry/line_segment_intersection_2190.cpp
new file mode 100644
index 0000000..2f9aced
--- /dev/null
+++ b/09_geometry/line_segment_intersection_2190.cpp
@@ -0,0 +1,41 @@
1#include <algorithm>
2#include <iostream>
3
4bool inran(long long int a, long long int b, long long int m) {
5 return m >= std::min(a, b) && m <= std::max(a, b);
6}
7
8bool inseg(long long int d, long long int dt, long long int du) {
9 return dt >= 0 && dt <= d && du >= 0 && du <= d;
10}
11
12bool f(long long int x1, long long int y1, long long int x2, long long int y2,
13 long long int x3, long long int y3, long long int x4, long long int y4) {
14 long long int xt = x2-x1, yt = y2-y1;
15 long long int xu = x4-x3, yu = y4-y3;
16 long long int d = xt * (-yu) - yt * (-xu);
17 long long int dt = (x3-x1) * (-yu) - (y3-y1) * (-xu);
18 long long int du = (xt) * (y3-y1) - (yt) * (x3-x1);
19
20 if (d == 0) {
21 // Parallel on different lines
22 if (dt != 0 || du != 0) return false;
23
24 // Parallel, same line
25 return xt == 0 ?
26 inran(y1,y2,y3) || inran(y1,y2,y4) || inran(y3,y4,y1) :
27 inran(x1,x2,x3) || inran(x1,x2,x4) || inran(x3,x4,x1);
28 } else {
29 // Not parallel
30 long long int m = d > 0 ? 1 : -1;
31 return inseg(m*d, m*dt, m*du);
32 }
33}
34
35int main() {
36 long long int x1, y1, x2, y2, x3, y3, x4, y4;
37 int n;
38 std::cin >> n;
39 while (std::cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4)
40 std::cout << (f(x1,y1,x2,y2,x3,y3,x4,y4) ? "YES\n" : "NO\n");
41}

Generated with cgit - Back to sebastiano.tronto.net