Merge branch 'master' into lint_targets

Author: not522

.github/workflows/benchmarks.yml

@@ -0,0 +1,24 @@
+name: Benchmarks
+
+on:
+  push:
+    branches: [master]
+
+jobs:
+  build:
+    runs-on: ubuntu-latest
+
+    steps:
+      - uses: actions/checkout@v2
+      - name: Set up Python 3.9
+        uses: actions/setup-python@v2
+        with:
+          python-version: 3.9
+      - name: Install dependencies
+        run: |
+          python -m pip install --upgrade pip
+          pip install .[benchmark]
+      - name: Benchmark with asv
+        run: |
+          asv machine --yes
+          asv run

.gitignore

@@ -128,3 +128,6 @@ dmypy.json
 
 # Pyre type checker
 .pyre/
+
+# asv
+.asv

asv.conf.json

@@ -0,0 +1,160 @@
+{
+    // The version of the config file format.  Do not change, unless
+    // you know what you are doing.
+    "version": 1,
+
+    // The name of the project being benchmarked
+    "project": "ac-library-python",
+
+    // The project's homepage
+    "project_url": "https://github.com/not522/ac-library-python",
+
+    // The URL or local path of the source code repository for the
+    // project being benchmarked
+    "repo": ".",
+
+    // The Python project's subdirectory in your repo.  If missing or
+    // the empty string, the project is assumed to be located at the root
+    // of the repository.
+    // "repo_subdir": "",
+
+    // Customizable commands for building, installing, and
+    // uninstalling the project. See asv.conf.json documentation.
+    //
+    // "install_command": ["in-dir={env_dir} python -mpip install {wheel_file}"],
+    // "uninstall_command": ["return-code=any python -mpip uninstall -y {project}"],
+    // "build_command": [
+    //     "python setup.py build",
+    //     "PIP_NO_BUILD_ISOLATION=false python -mpip wheel --no-deps --no-index -w {build_cache_dir} {build_dir}"
+    // ],
+
+    // List of branches to benchmark. If not provided, defaults to "master"
+    // (for git) or "default" (for mercurial).
+    // "branches": ["master"], // for git
+    // "branches": ["default"],    // for mercurial
+
+    // The DVCS being used.  If not set, it will be automatically
+    // determined from "repo" by looking at the protocol in the URL
+    // (if remote), or by looking for special directories, such as
+    // ".git" (if local).
+    // "dvcs": "git",
+
+    // The tool to use to create environments.  May be "conda",
+    // "virtualenv" or other value depending on the plugins in use.
+    // If missing or the empty string, the tool will be automatically
+    // determined by looking for tools on the PATH environment
+    // variable.
+    "environment_type": "virtualenv",
+
+    // timeout in seconds for installing any dependencies in environment
+    // defaults to 10 min
+    //"install_timeout": 600,
+
+    // the base URL to show a commit for the project.
+    "show_commit_url": "https://github.com/not522/ac-library-python/commit/",
+
+    // The Pythons you'd like to test against.  If not provided, defaults
+    // to the current version of Python used to run `asv`.
+    // "pythons": ["2.7", "3.6"],
+
+    // The list of conda channel names to be searched for benchmark
+    // dependency packages in the specified order
+    // "conda_channels": ["conda-forge", "defaults"],
+
+    // The matrix of dependencies to test.  Each key is the name of a
+    // package (in PyPI) and the values are version numbers.  An empty
+    // list or empty string indicates to just test against the default
+    // (latest) version. null indicates that the package is to not be
+    // installed. If the package to be tested is only available from
+    // PyPi, and the 'environment_type' is conda, then you can preface
+    // the package name by 'pip+', and the package will be installed via
+    // pip (with all the conda available packages installed first,
+    // followed by the pip installed packages).
+    //
+    // "matrix": {
+    //     "numpy": ["1.6", "1.7"],
+    //     "six": ["", null],        // test with and without six installed
+    //     "pip+emcee": [""],   // emcee is only available for install with pip.
+    // },
+
+    // Combinations of libraries/python versions can be excluded/included
+    // from the set to test. Each entry is a dictionary containing additional
+    // key-value pairs to include/exclude.
+    //
+    // An exclude entry excludes entries where all values match. The
+    // values are regexps that should match the whole string.
+    //
+    // An include entry adds an environment. Only the packages listed
+    // are installed. The 'python' key is required. The exclude rules
+    // do not apply to includes.
+    //
+    // In addition to package names, the following keys are available:
+    //
+    // - python
+    //     Python version, as in the *pythons* variable above.
+    // - environment_type
+    //     Environment type, as above.
+    // - sys_platform
+    //     Platform, as in sys.platform. Possible values for the common
+    //     cases: 'linux2', 'win32', 'cygwin', 'darwin'.
+    //
+    // "exclude": [
+    //     {"python": "3.2", "sys_platform": "win32"}, // skip py3.2 on windows
+    //     {"environment_type": "conda", "six": null}, // don't run without six on conda
+    // ],
+    //
+    // "include": [
+    //     // additional env for python2.7
+    //     {"python": "2.7", "numpy": "1.8"},
+    //     // additional env if run on windows+conda
+    //     {"platform": "win32", "environment_type": "conda", "python": "2.7", "libpython": ""},
+    // ],
+
+    // The directory (relative to the current directory) that benchmarks are
+    // stored in.  If not provided, defaults to "benchmarks"
+    // "benchmark_dir": "benchmarks",
+
+    // The directory (relative to the current directory) to cache the Python
+    // environments in.  If not provided, defaults to "env"
+    "env_dir": ".asv/env",
+
+    // The directory (relative to the current directory) that raw benchmark
+    // results are stored in.  If not provided, defaults to "results".
+    "results_dir": ".asv/results",
+
+    // The directory (relative to the current directory) that the html tree
+    // should be written to.  If not provided, defaults to "html".
+    "html_dir": ".asv/html",
+
+    // The number of characters to retain in the commit hashes.
+    // "hash_length": 8,
+
+    // `asv` will cache results of the recent builds in each
+    // environment, making them faster to install next time.  This is
+    // the number of builds to keep, per environment.
+    // "build_cache_size": 2,
+
+    // The commits after which the regression search in `asv publish`
+    // should start looking for regressions. Dictionary whose keys are
+    // regexps matching to benchmark names, and values corresponding to
+    // the commit (exclusive) after which to start looking for
+    // regressions.  The default is to start from the first commit
+    // with results. If the commit is `null`, regression detection is
+    // skipped for the matching benchmark.
+    //
+    // "regressions_first_commits": {
+    //    "some_benchmark": "352cdf",  // Consider regressions only after this commit
+    //    "another_benchmark": null,   // Skip regression detection altogether
+    // },
+
+    // The thresholds for relative change in results, after which `asv
+    // publish` starts reporting regressions. Dictionary of the same
+    // form as in ``regressions_first_commits``, with values
+    // indicating the thresholds.  If multiple entries match, the
+    // maximum is taken. If no entry matches, the default is 5%.
+    //
+    // "regressions_thresholds": {
+    //    "some_benchmark": 0.01,     // Threshold of 1%
+    //    "another_benchmark": 0.5,   // Threshold of 50%
+    // },
+}

atcoder/_scc.py

@@ -1,4 +1,3 @@
-import copy
 import sys
 import typing
 
@@ -15,7 +14,7 @@ def __init__(
         for i in range(1, n + 1):
             self.start[i] += self.start[i - 1]
 
-        counter = copy.deepcopy(self.start)
+        counter = self.start.copy()
         for e in edges:
             self.elist[counter[e[0]]] = e[1]
             counter[e[0]] += 1

atcoder/mincostflow.py

@@ -51,10 +51,12 @@ def get_edge(self, i: int) -> Edge:
     def edges(self) -> List[Edge]:
         return [self.get_edge(i) for i in range(len(self._edges))]
 
-    def flow(self, s: int, t: int, flow_limit: Optional[int] = None) -> Tuple[int, int]:
+    def flow(self, s: int, t: int,
+             flow_limit: Optional[int] = None) -> Tuple[int, int]:
         return self.slope(s, t, flow_limit)[-1]
 
-    def slope(self, s: int, t: int, flow_limit: Optional[int] = None) -> List[Tuple[int, int]]:
+    def slope(self, s: int, t: int,
+              flow_limit: Optional[int] = None) -> List[Tuple[int, int]]:
         assert 0 <= s < self._n
         assert 0 <= t < self._n
         assert s != t

benchmarks/__init__.py

@@ -0,0 +1,20 @@
+import random
+
+from atcoder.dsu import DSU
+
+
+class DSUSuite:
+
+    def setup(self) -> None:
+        random.seed(0)
+        self.n = 100000
+        self.pairs = []
+        for _ in range(1000000):
+            a = random.randrange(0, self.n)
+            b = random.randrange(0, self.n)
+            self.pairs.append((a, b))
+
+    def time_dsu_merge(self) -> None:
+        dsu = DSU(self.n)
+        for i, j in self.pairs:
+            dsu.merge(i, j)

benchmarks/benchmark_dsu.py

@@ -1,6 +1,7 @@
 # https://atcoder.jp/contests/practice2/tasks/practice2_k
 
 import sys
+from typing import Tuple
 
 from atcoder.lazysegtree import LazySegTree
 from atcoder.modint import ModContext, Modint
@@ -11,16 +12,18 @@ def main() -> None:
         n, q = map(int, sys.stdin.readline().split())
         a = [(Modint(ai), 1) for ai in map(int, sys.stdin.readline().split())]
 
-        def op(x: (Modint, int), y: (Modint, int)) -> (Modint, int):
+        def op(x: Tuple[Modint, int],
+               y: Tuple[Modint, int]) -> Tuple[Modint, int]:
             return x[0] + y[0], x[1] + y[1]
 
         e = Modint(0), 0
 
-        def mapping(x: (Modint, Modint), y: (Modint, int)) -> (Modint, int):
+        def mapping(x: Tuple[Modint, Modint],
+                    y: Tuple[Modint, int]) -> Tuple[Modint, int]:
             return x[0] * y[0] + x[1] * y[1], y[1]
 
-        def composition(x: (Modint, Modint),
-                        y: (Modint, Modint)) -> (Modint, Modint):
+        def composition(x: Tuple[Modint, Modint],
+                        y: Tuple[Modint, Modint]) -> Tuple[Modint, Modint]:
             return x[0] * y[0], x[0] * y[1] + x[1]
 
         id_ = Modint(1), Modint(0)

example/__init__.py

@@ -1,6 +1,7 @@
 # https://atcoder.jp/contests/practice2/tasks/practice2_k
 
 import sys
+from typing import Tuple
 
 from atcoder.lazysegtree import LazySegTree
 
@@ -11,15 +12,15 @@ def main() -> None:
     n, q = map(int, sys.stdin.readline().split())
     a = [(ai, 1) for ai in map(int, sys.stdin.readline().split())]
 
-    def op(x: (int, int), y: (int, int)) -> (int, int):
+    def op(x: Tuple[int, int], y: Tuple[int, int]) -> Tuple[int, int]:
         return (x[0] + y[0]) % mod, x[1] + y[1]
 
     e = 0, 0
 
-    def mapping(x: (int, int), y: (int, int)) -> (int, int):
+    def mapping(x: Tuple[int, int], y: Tuple[int, int]) -> Tuple[int, int]:
         return (x[0] * y[0] + x[1] * y[1]) % mod, y[1]
 
-    def composition(x: (int, int), y: (int, int)) -> (int, int):
+    def composition(x: Tuple[int, int], y: Tuple[int, int]) -> Tuple[int, int]:
         return (x[0] * y[0]) % mod, (x[0] * y[1] + x[1]) % mod
 
     id_ = 1, 0

example/lazysegtree_practice_k.py

@@ -1,6 +1,7 @@
 # https://atcoder.jp/contests/practice2/tasks/practice2_l
 
 import sys
+from typing import Tuple
 
 from atcoder.lazysegtree import LazySegTree
 
@@ -14,12 +15,13 @@ def main() -> None:
         else:
             a.append((0, 1, 0))
 
-    def op(x: (int, int, int), y: (int, int, int)) -> (int, int, int):
+    def op(x: Tuple[int, int, int],
+           y: Tuple[int, int, int]) -> Tuple[int, int, int]:
         return x[0] + y[0], x[1] + y[1], x[2] + y[2] + x[1] * y[0]
 
     e = (0, 0, 0)
 
-    def mapping(x: bool, y: (int, int, int)) -> (int, int, int):
+    def mapping(x: bool, y: Tuple[int, int, int]) -> Tuple[int, int, int]:
         if not x:
             return y
         return y[1], y[0], y[0] * y[1] - y[2]

example/lazysegtree_practice_k_wo_modint.py

@@ -1,6 +1,7 @@
 # https://atcoder.jp/contests/practice2/tasks/practice2_d
 
 import sys
+from typing import Tuple
 
 from atcoder.maxflow import MFGraph
 
@@ -15,7 +16,7 @@ def main() -> None:
     def enc(i: int, j: int) -> int:
         return i * m + j
 
-    def dec(v: int) -> (int, int):
+    def dec(v: int) -> Tuple[int, int]:
         return v // m, v % m
 
     for i in range(n):
@@ -58,8 +59,8 @@ def dec(v: int) -> (int, int):
             grid[i][j] = '>'
             grid[ii][jj] = '<'
 
-    for s in grid:
-        print("".join(s))
+    for r in grid:
+        print("".join(r))
 
 
 if __name__ == '__main__':

example/lazysegtree_practice_l.py

@@ -1,6 +1,7 @@
 # https://atcoder.jp/contests/practice2/tasks/practice2_e
 
 import sys
+from typing import List
 
 from atcoder.mincostflow import MCFGraph
 
@@ -12,7 +13,7 @@ def main() -> None:
     g = MCFGraph(t + 1)
     grid = [list(map(int, sys.stdin.readline().split())) for _ in range(n)]
     big = 10 ** 9
-    edges = list([] for _ in range(n))
+    edges: List[List[int]] = list([] for _ in range(n))
     for i in range(n):
         g.add_edge(s, i, k, 0)
         g.add_edge(i + n, t, k, 0)
@@ -29,8 +30,8 @@ def main() -> None:
             if g.get_edge(edges[i][j]).flow > 0:
                 result[i][j] = 'X'
 
-    for s in result:
-        print("".join(s))
+    for r in result:
+        print("".join(r))
 
 
 if __name__ == '__main__':

example/maxflow_practice.py

@@ -16,9 +16,9 @@ def main() -> None:
     scc = g.scc()
 
     print(len(scc))
-    for v in scc:
-        print(len(v), end='')
-        for x in v:
+    for c in scc:
+        print(len(c), end='')
+        for x in c:
             print(f' {x}', end='')
         print('')