solved(python): baekjoon 14428

Author: himitery

baekjoon/python/14428/__init__.py

@@ -0,0 +1,74 @@
+import math
+import sys
+
+read = lambda: sys.stdin.readline().rstrip()
+
+
+class Problem:
+    def __init__(self):
+        self.n = int(read())
+        self.nums = list(map(int, read().split()))
+
+        self.m = int(read())
+        self.queries = [map(int, read().split()) for _ in range(self.m)]
+
+    def solve(self) -> None:
+        tree = self.make_tree()
+
+        for command, x, y in self.queries:
+            if command == 1:
+                tree = self.update_tree(tree, x - 1, y)
+
+            if command == 2:
+                print(self.query(tree, x - 1, y))
+
+    def make_tree(self) -> list[tuple[int, int]]:
+        tree = [(0, 0)] * self.n * 2
+
+        for idx in range(self.n):
+            tree[self.n + idx] = (idx + 1, self.nums[idx])
+
+        for idx in range(self.n - 1, 0, -1):
+            tree[idx] = self.select(tree[idx << 1], tree[(idx << 1) | 1])
+
+        return tree
+
+    def update_tree(self, tree: list[tuple[int, int]], idx: int, value: int) -> list[tuple[int, int]]:
+        node = self.n + idx
+        tree[node] = (tree[node][0], value)
+
+        while node:
+            node >>= 1
+            tree[node] = self.select(tree[node << 1], tree[(node << 1) | 1])
+
+        return tree
+
+    def query(self, tree: list[tuple[int, int]], start: int, end: int) -> int:
+        left, right, value = self.n + start, self.n + end, (math.inf, math.inf)
+
+        while left < right:
+            if left & 1:
+                value = self.select(value, tree[left])
+                left += 1
+
+            if right & 1:
+                right -= 1
+                value = self.select(value, tree[right])
+
+            left >>= 1
+            right >>= 1
+
+        return value[0]
+
+    def select(self, x: tuple[int, int], y: tuple[int, int]) -> tuple[int, int]:
+        x_idx, x_value = x
+        y_idx, y_value = y
+
+        if x_value != y_value:
+            return x if x_value < y_value else y
+
+        return x if x_idx < y_idx else y
+
+
+if __name__ == "__main__":
+    Problem().solve()

baekjoon/python/14428/main.py

@@ -0,0 +1,21 @@
+[
+  {
+    "input": [
+      "5",
+      "5 4 3 2 1",
+      "6",
+      "2 1 3",
+      "2 1 4",
+      "1 5 3",
+      "2 3 5",
+      "1 4 3",
+      "2 3 5"
+    ],
+    "expected": [
+      "3",
+      "4",
+      "4",
+      "3"
+    ]
+  }
+]

baekjoon/python/14428/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()