solved(python): baekjoon 17387

Author: himitery

baekjoon/python/17387/__init__.py

@@ -0,0 +1,35 @@
+import sys
+
+read = lambda: sys.stdin.readline().rstrip()
+
+
+class Problem:
+    def __init__(self):
+        self.x1, self.y1, self.x2, self.y2 = map(int, read().split())
+        self.x3, self.y3, self.x4, self.y4 = map(int, read().split())
+
+    def solve(self) -> None:
+        a, b, c, d = (self.x1, self.y1), (self.x2, self.y2), (self.x3, self.y3), (self.x4, self.y4)
+        ccw_ab, ccw_cd = self.ccw(a, b, c) * self.ccw(a, b, d), self.ccw(c, d, a) * self.ccw(c, d, b)
+
+        result = ccw_ab <= 0 and ccw_cd <= 0
+        if ccw_ab == 0 and ccw_cd == 0:
+            result = self.is_overlap(a, b, c, d)
+
+        print(int(result))
+
+    def ccw(self, point1: tuple[int, int], point2: tuple[int, int], point3: tuple[int, int]) -> int:
+        result = (point2[0] - point1[0]) * (point3[1] - point1[1]) - (point2[1] - point1[1]) * (point3[0] - point1[0])
+        return 0 if result == 0 else (result // abs(result))
+
+    def is_overlap(self, a: tuple[int, int], b: tuple[int, int], c: tuple[int, int], d: tuple[int, int]) -> bool:
+        return (
+            min(a[0], b[0]) <= max(c[0], d[0])
+            and min(c[0], d[0]) <= max(a[0], b[0])
+            and min(a[1], b[1]) <= max(c[1], d[1])
+            and min(c[1], d[1]) <= max(a[1], b[1])
+        )
+
+
+if __name__ == "__main__":
+    Problem().solve()

baekjoon/python/17387/main.py

@@ -0,0 +1,83 @@
+[
+  {
+    "input": [
+      "1 1 5 5",
+      "1 5 5 1"
+    ],
+    "expected": [
+      "1"
+    ]
+  },
+  {
+    "input": [
+      "1 1 5 5",
+      "6 10 10 6"
+    ],
+    "expected": [
+      "0"
+    ]
+  },
+  {
+    "input": [
+      "1 1 5 5",
+      "5 5 1 1"
+    ],
+    "expected": [
+      "1"
+    ]
+  },
+  {
+    "input": [
+      "1 1 5 5",
+      "3 3 5 5"
+    ],
+    "expected": [
+      "1"
+    ]
+  },
+  {
+    "input": [
+      "1 1 5 5",
+      "3 3 1 3"
+    ],
+    "expected": [
+      "1"
+    ]
+  },
+  {
+    "input": [
+      "1 1 5 5",
+      "5 5 9 9"
+    ],
+    "expected": [
+      "1"
+    ]
+  },
+  {
+    "input": [
+      "1 1 5 5",
+      "6 6 9 9"
+    ],
+    "expected": [
+      "0"
+    ]
+  },
+  {
+    "input": [
+      "1 1 5 5",
+      "5 5 1 5"
+    ],
+    "expected": [
+      "1"
+    ]
+  },
+  {
+    "input": [
+      "1 1 5 5",
+      "6 6 1 5"
+    ],
+    "expected": [
+      "0"
+    ]
+  }
+]

baekjoon/python/17387/sample.json

@@ -0,0 +1,36 @@
+import json
+import os.path
+import unittest
+from io import StringIO
+from unittest.mock import patch
+
+from parameterized import parameterized
+
+from main import Problem
+
+
+def load_sample(filename: str):
+    path = os.path.join(os.path.dirname(os.path.abspath(__file__)), filename)
+
+    with open(path, "r") as file:
+        return [(case["input"], case["expected"]) for case in json.load(file)]
+
+
+class TestCase(unittest.TestCase):
+    @parameterized.expand(load_sample("sample.json"))
+    def test_case(self, case: str, expected: list[str]):
+        # When
+        with (
+            patch("sys.stdin.readline", side_effect=case),
+            patch("sys.stdout", new_callable=StringIO) as output,
+        ):
+            Problem().solve()
+
+            result = output.getvalue().rstrip()
+
+        # Then
+        self.assertEqual("\n".join(expected), result)
+
+
+if __name__ == "__main__":
+    unittest.main()