feat: 平方分割ライブラリを追加した

Author: hidehic0

code/main.py

@@ -1355,6 +1355,75 @@ def mo_algorithm(
     return res
 
 
+import math
+from typing import Any, Callable, List
+
+
+class SquareDivision:
+    def __init__(self, lis: List[Any], op: Callable[[Any, Any], Any]) -> None:
+        self.n = len(lis)
+        self.op = op
+        self.block_size = math.isqrt(self.n)
+        self.blocks = []
+        self.lis = lis[:]
+
+        for i in range(0, self.n, self.block_size):
+            block_val = lis[i]
+            for k in range(i + 1, min(i + self.block_size, self.n)):
+                block_val = self.op(block_val, lis[k])
+            self.blocks.append(block_val)
+
+        self.m = len(self.blocks)
+
+    def get_block_index_left(self, i: int) -> int:
+        return i // self.block_size
+
+    def get_block_index_right(self, i: int) -> int:
+        return (i + self.block_size - 1) // self.block_size
+
+    def prod(self, l: int, r: int) -> Any:
+        """
+        rは0-indexedなのに注意してください
+        """
+        assert 0 <= l <= r < self.n
+
+        l_block_left = self.get_block_index_left(l)
+        r_block_left = self.get_block_index_left(r)
+
+        if l_block_left == r_block_left:
+            res = self.lis[l]
+            for k in range(l + 1, r + 1):
+                res = self.op(res, self.lis[k])
+            return res
+
+        res = self.lis[l]
+        for i in range(l + 1, min((l_block_left + 1) * self.block_size, self.n)):
+            res = self.op(res, self.lis[i])
+
+        for block_ind in range(l_block_left + 1, r_block_left):
+            res = self.op(res, self.blocks[block_ind])
+
+        for i in range(r_block_left * self.block_size, r + 1):
+            res = self.op(res, self.lis[i])
+
+        return res
+
+    def update(self, i: int, x: Any) -> None:
+        assert 0 <= i < self.n
+        self.lis[i] = x
+        block_ind = self.get_block_index_left(i)
+        start = block_ind * self.block_size
+        end = min(start + self.block_size, self.n)
+        if start < self.n:
+            self.blocks[block_ind] = self.lis[start]
+            for j in range(start + 1, end):
+                self.blocks[block_ind] = self.op(self.blocks[block_ind], self.lis[j])
+
+    def get(self, i: int) -> Any:
+        assert 0 <= i < self.n
+        return self.lis[i]
+
+
 from typing import List
 
 

libs/square-division.py

@@ -0,0 +1,67 @@
+import math
+from typing import Any, Callable, List
+
+
+class SquareDivision:
+    def __init__(self, lis: List[Any], op: Callable[[Any, Any], Any]) -> None:
+        self.n = len(lis)
+        self.op = op
+        self.block_size = math.isqrt(self.n)
+        self.blocks = []
+        self.lis = lis[:]
+
+        for i in range(0, self.n, self.block_size):
+            block_val = lis[i]
+            for k in range(i + 1, min(i + self.block_size, self.n)):
+                block_val = self.op(block_val, lis[k])
+            self.blocks.append(block_val)
+
+        self.m = len(self.blocks)
+
+    def get_block_index_left(self, i: int) -> int:
+        return i // self.block_size
+
+    def get_block_index_right(self, i: int) -> int:
+        return (i + self.block_size - 1) // self.block_size
+
+    def prod(self, l: int, r: int) -> Any:
+        """
+        rは0-indexedなのに注意してください
+        """
+        assert 0 <= l <= r < self.n
+
+        l_block_left = self.get_block_index_left(l)
+        r_block_left = self.get_block_index_left(r)
+
+        if l_block_left == r_block_left:
+            res = self.lis[l]
+            for k in range(l + 1, r + 1):
+                res = self.op(res, self.lis[k])
+            return res
+
+        res = self.lis[l]
+        for i in range(l + 1, min((l_block_left + 1) * self.block_size, self.n)):
+            res = self.op(res, self.lis[i])
+
+        for block_ind in range(l_block_left + 1, r_block_left):
+            res = self.op(res, self.blocks[block_ind])
+
+        for i in range(r_block_left * self.block_size, r + 1):
+            res = self.op(res, self.lis[i])
+
+        return res
+
+    def update(self, i: int, x: Any) -> None:
+        assert 0 <= i < self.n
+        self.lis[i] = x
+        block_ind = self.get_block_index_left(i)
+        start = block_ind * self.block_size
+        end = min(start + self.block_size, self.n)
+        if start < self.n:
+            self.blocks[block_ind] = self.lis[start]
+            for j in range(start + 1, end):
+                self.blocks[block_ind] = self.op(self.blocks[block_ind], self.lis[j])
+
+    def get(self, i: int) -> Any:
+        assert 0 <= i < self.n
+        return self.lis[i]

merge_file.bash

@@ -7,7 +7,7 @@ echo "新しいmain.py作成完了"
 # テンプレ
 # /bin/cat python/<filename>.py >> code/main.py
 
-for file_name in "import.py" "standard_input.py" "math_func.py" "array_create.py" "binary_search.py" "modint.py" "yn_func.py" "grid.py" "coordinates_to_id.py" "dijkstra.py" "get_path.py" "dp.py" "coordinate_compression.py" "memo.py" "lca_weight.py" "rollinghash.py" "graph.py" "unionfind.py" "potential_unionfind.py" "heap.py" "trie.py" "mo.py" "bit.py" "dis_lib.py" "alias.py" "utils.py"; do
+for file_name in "import.py" "standard_input.py" "math_func.py" "array_create.py" "binary_search.py" "modint.py" "yn_func.py" "grid.py" "coordinates_to_id.py" "dijkstra.py" "get_path.py" "dp.py" "coordinate_compression.py" "memo.py" "lca_weight.py" "rollinghash.py" "graph.py" "unionfind.py" "potential_unionfind.py" "heap.py" "trie.py" "mo.py" "square-division.py" "bit.py" "dis_lib.py" "alias.py" "utils.py"; do
 
   cat libs/${file_name} >>code/main.py
 done

pyproject.toml

@@ -4,7 +4,9 @@ version = "0.1.0"
 description = "Add your description here"
 readme = "README.md"
 requires-python = ">=3.10"
-dependencies = ["debugpy>=1.8.14"]
+dependencies = [
+    "debugpy>=1.8.14",
+]
 
 [tool.ruff]
 line-length = 88