[auto-verifier] docs commit 535c2a6

Author: web-flow

index.md

@@ -9,6 +9,11 @@ data:
     - icon: ':heavy_check_mark:'
       path: weilycoder/data-struct/unionfind.hpp
       title: weilycoder/data-struct/unionfind.hpp
+  - name: weilycoder
+    pages:
+    - icon: ':heavy_check_mark:'
+      path: weilycoder/fast-io.hpp
+      title: weilycoder/fast-io.hpp
   - name: weilycoder/graph
     pages:
     - icon: ':heavy_check_mark:'
@@ -20,6 +25,9 @@ data:
     - icon: ':heavy_check_mark:'
       path: test/biconnected_components.test.cpp
       title: test/biconnected_components.test.cpp
+    - icon: ':heavy_check_mark:'
+      path: test/many_aplusb.test.cpp
+      title: test/many_aplusb.test.cpp
     - icon: ':heavy_check_mark:'
       path: test/static_range_sum.test.cpp
       title: test/static_range_sum.test.cpp

test/biconnected_components.test.cpp.md

@@ -28,10 +28,11 @@ data:
     \ low[u] = std::min(low[u], low[v]);\n      else if (in_stack[v])\n        low[u]\
     \ = std::min(low[u], dfn[v]);\n    }\n\n    if (dfn[u] == low[u]) {\n      sccs.emplace_back();\n\
     \      sccs.back().push_back(u);\n      in_stack[u] = false;\n      while (stk.top()\
-    \ != u)\n        sccs.back().push_back(stk.top()), in_stack[stk.top()] = false,\
-    \ stk.pop();\n      stk.pop();\n    }\n  }\n\n  void solve() {\n    for (size_t\
-    \ i = 0; i < graph.size(); ++i)\n      if (!dfn[i])\n        tarjan(i);\n    std::reverse(sccs.begin(),\
-    \ sccs.end());\n  }\n};\n\ntemplate <typename ptr_t = size_t> struct TwoEdgeConnectedComponents\
+    \ != u)\n        sccs.back().push_back(stk.top()), in_stack[stk.top()] = false,\n\
+    \                                          stk.pop();\n      stk.pop();\n    }\n\
+    \  }\n\n  void solve() {\n    for (size_t i = 0; i < graph.size(); ++i)\n    \
+    \  if (!dfn[i])\n        tarjan(i);\n    std::reverse(sccs.begin(), sccs.end());\n\
+    \  }\n};\n\ntemplate <typename ptr_t = size_t> struct TwoEdgeConnectedComponents\
     \ {\n  ptr_t dfs_time = 0, edge_time = 1;\n\n  std::vector<bool> in_stack;\n \
     \ std::stack<ptr_t> stk;\n  std::vector<ptr_t> dfn, low;\n  std::vector<std::vector<std::pair<ptr_t,\
     \ ptr_t>>> graph;\n\n  std::vector<std::vector<ptr_t>> eccs;\n\n  TwoEdgeConnectedComponents(ptr_t\
@@ -45,21 +46,22 @@ data:
     \        low[u] = std::min(low[u], dfn[v]);\n    }\n\n    if (dfn[u] == low[u])\
     \ {\n      eccs.emplace_back();\n      eccs.back().push_back(u);\n      in_stack[u]\
     \ = false;\n      while (stk.top() != u)\n        eccs.back().push_back(stk.top()),\
-    \ in_stack[stk.top()] = false, stk.pop();\n      stk.pop();\n    }\n  }\n\n  void\
-    \ solve() {\n    for (size_t i = 0; i < graph.size(); ++i)\n      if (!dfn[i])\n\
-    \        tarjan(i, 0);\n  }\n};\n\ntemplate <typename ptr_t = size_t> struct BiconnectedComponents\
-    \ {\n  ptr_t dfs_time = 0;\n\n  std::stack<ptr_t> stk;\n  std::vector<ptr_t> dfn,\
-    \ low;\n  std::vector<std::vector<ptr_t>> graph;\n\n  std::vector<bool> is_cut;\n\
-    \  std::vector<std::vector<ptr_t>> dccs;\n\n  BiconnectedComponents(ptr_t n) :\
-    \ dfn(n, 0), low(n, 0), graph(n), is_cut(n, false) {}\n\n  void add_edge(ptr_t\
-    \ u, ptr_t v) {\n    graph[u].push_back(v);\n    graph[v].push_back(u);\n  }\n\
-    \n  void tarjan(ptr_t u, bool is_root) {\n    dfn[u] = low[u] = ++dfs_time, stk.push(u);\n\
-    \n    if (is_root && graph[u].empty()) {\n      dccs.emplace_back();\n      dccs.back().push_back(u);\n\
-    \      return;\n    }\n\n    ptr_t child = 0;\n    for (const auto &v : graph[u])\
-    \ {\n      if (!dfn[v]) {\n        tarjan(v, false), low[u] = std::min(low[u],\
-    \ low[v]);\n        if (low[v] >= dfn[u]) {\n          if (++child > 1 || !is_root)\n\
-    \            is_cut[u] = true;\n          dccs.emplace_back();\n          do\n\
-    \            dccs.back().push_back(stk.top()), stk.pop();\n          while (dccs.back().back()\
+    \ in_stack[stk.top()] = false,\n                                          stk.pop();\n\
+    \      stk.pop();\n    }\n  }\n\n  void solve() {\n    for (size_t i = 0; i <\
+    \ graph.size(); ++i)\n      if (!dfn[i])\n        tarjan(i, 0);\n  }\n};\n\ntemplate\
+    \ <typename ptr_t = size_t> struct BiconnectedComponents {\n  ptr_t dfs_time =\
+    \ 0;\n\n  std::stack<ptr_t> stk;\n  std::vector<ptr_t> dfn, low;\n  std::vector<std::vector<ptr_t>>\
+    \ graph;\n\n  std::vector<bool> is_cut;\n  std::vector<std::vector<ptr_t>> dccs;\n\
+    \n  BiconnectedComponents(ptr_t n)\n      : dfn(n, 0), low(n, 0), graph(n), is_cut(n,\
+    \ false) {}\n\n  void add_edge(ptr_t u, ptr_t v) {\n    graph[u].push_back(v);\n\
+    \    graph[v].push_back(u);\n  }\n\n  void tarjan(ptr_t u, bool is_root) {\n \
+    \   dfn[u] = low[u] = ++dfs_time, stk.push(u);\n\n    if (is_root && graph[u].empty())\
+    \ {\n      dccs.emplace_back();\n      dccs.back().push_back(u);\n      return;\n\
+    \    }\n\n    ptr_t child = 0;\n    for (const auto &v : graph[u]) {\n      if\
+    \ (!dfn[v]) {\n        tarjan(v, false), low[u] = std::min(low[u], low[v]);\n\
+    \        if (low[v] >= dfn[u]) {\n          if (++child > 1 || !is_root)\n   \
+    \         is_cut[u] = true;\n          dccs.emplace_back();\n          do\n  \
+    \          dccs.back().push_back(stk.top()), stk.pop();\n          while (dccs.back().back()\
     \ != v);\n          dccs.back().push_back(u);\n        }\n      } else\n     \
     \   low[u] = std::min(low[u], dfn[v]);\n    }\n  }\n\n  void solve() {\n    for\
     \ (size_t i = 0; i < graph.size(); ++i)\n      if (!dfn[i])\n        tarjan(i,\
@@ -86,7 +88,7 @@ data:
   isVerificationFile: true
   path: test/biconnected_components.test.cpp
   requiredBy: []
-  timestamp: '2025-10-28 23:07:26+08:00'
+  timestamp: '2025-10-29 20:09:11+08:00'
   verificationStatus: TEST_ACCEPTED
   verifiedWith: []
 documentation_of: test/biconnected_components.test.cpp

test/many_aplusb.test.cpp.md

@@ -0,0 +1,72 @@
+---
+data:
+  _extendedDependsOn:
+  - icon: ':heavy_check_mark:'
+    path: weilycoder/fast-io.hpp
+    title: weilycoder/fast-io.hpp
+  _extendedRequiredBy: []
+  _extendedVerifiedWith: []
+  _isVerificationFailed: false
+  _pathExtension: cpp
+  _verificationStatusIcon: ':heavy_check_mark:'
+  attributes:
+    '*NOT_SPECIAL_COMMENTS*': ''
+    PROBLEM: https://judge.yosupo.jp/problem/many_aplusb
+    links:
+    - https://judge.yosupo.jp/problem/many_aplusb
+  bundledCode: "#line 1 \"test/many_aplusb.test.cpp\"\n#define PROBLEM \"https://judge.yosupo.jp/problem/many_aplusb\"\
+    \n\n#line 1 \"weilycoder/fast-io.hpp\"\n\n\n\n#include <cstddef>\n#include <cstdint>\n\
+    #include <cstdio>\n#include <limits>\n#include <sys/mman.h>\n#include <sys/stat.h>\n\
+    #include <unistd.h>\n\nnamespace weilycoder {\nstruct FastReadMMap {\n  size_t\
+    \ file_size;\n  char *data, *pos;\n\n  FastReadMMap(const FastReadMMap &) = delete;\n\
+    \  FastReadMMap &operator=(const FastReadMMap &) = delete;\n\n  FastReadMMap()\
+    \ {\n    struct stat st;\n\n    if (fstat(0, &st) != 0) {\n      file_size = std::numeric_limits<size_t>::max();\n\
+    \      return;\n    }\n\n    file_size = st.st_size;\n    data = reinterpret_cast<char\
+    \ *>(\n        mmap(nullptr, file_size, PROT_READ, MAP_PRIVATE, 0, 0));\n    pos\
+    \ = data;\n  }\n\n  ~FastReadMMap() {\n    if (file_size != std::numeric_limits<size_t>::max())\n\
+    \      munmap(data, file_size);\n  }\n\n  char getchar() {\n    return static_cast<size_t>(pos\
+    \ - data) < file_size ? *pos++ : EOF;\n  }\n\n  char operator()() { return getchar();\
+    \ }\n};\n\ntemplate <size_t buffer_size = 1 << 20> struct FastWriteFWrite {\n\
+    \  char buffer[buffer_size], *pos = buffer;\n\n  FastWriteFWrite() = default;\n\
+    \  ~FastWriteFWrite() { flush(); }\n\n  FastWriteFWrite(const FastWriteFWrite\
+    \ &) = delete;\n  FastWriteFWrite &operator=(const FastWriteFWrite &) = delete;\n\
+    \n  void putchar(char c) {\n    if (pos - buffer == buffer_size)\n      flush();\n\
+    \    *pos++ = c;\n  }\n\n  void flush() {\n    size_t write_size = pos - buffer;\n\
+    \    if (write_size) {\n      fwrite(buffer, 1, write_size, stdout);\n      pos\
+    \ = buffer;\n    }\n  }\n\n  void operator()(char c) { putchar(c); }\n};\n\ntemplate\
+    \ <typename Reader, typename Writer> struct FastIO {\n  Reader reader;\n  Writer\
+    \ writer;\n\n  FastIO() = default;\n\n  FastIO(const FastIO &) = delete;\n  FastIO\
+    \ &operator=(const FastIO &) = delete;\n\n  char getchar() { return reader.getchar();\
+    \ }\n  void putchar(char c) { writer.putchar(c); }\n\n  void flush() { writer.flush();\
+    \ }\n\n  uint64_t read_u64() {\n    char c;\n    do\n      c = getchar();\n  \
+    \  while (c < '0' || c > '9');\n    uint64_t x = 0;\n    do\n      x = x * 10\
+    \ + (c - '0'), c = getchar();\n    while (c >= '0' && c <= '9');\n    return x;\n\
+    \  }\n\n  void write_u64(uint64_t x) {\n    static char buf[20];\n    size_t len\
+    \ = 0;\n    do\n      buf[len++] = '0' + (x % 10), x /= 10;\n    while (x);\n\
+    \    for (size_t i = len - 1; ~i; --i)\n      putchar(buf[i]);\n  }\n\n  void\
+    \ write_u64_line(uint64_t x) { write_u64(x), putchar('\\n'); }\n};\n\nusing FastIODefault\
+    \ = FastIO<FastReadMMap, FastWriteFWrite<>>;\n} // namespace weilycoder\n\n\n\
+    #line 4 \"test/many_aplusb.test.cpp\"\nusing namespace weilycoder;\n\nstatic FastIODefault\
+    \ io;\n\nint main() {\n  size_t t = io.read_u64();\n  while (t--) {\n    uint64_t\
+    \ a = io.read_u64();\n    uint64_t b = io.read_u64();\n    uint64_t c = a + b;\n\
+    \    io.write_u64_line(c);\n  }\n  return 0;\n}\n"
+  code: "#define PROBLEM \"https://judge.yosupo.jp/problem/many_aplusb\"\n\n#include\
+    \ \"../weilycoder/fast-io.hpp\"\nusing namespace weilycoder;\n\nstatic FastIODefault\
+    \ io;\n\nint main() {\n  size_t t = io.read_u64();\n  while (t--) {\n    uint64_t\
+    \ a = io.read_u64();\n    uint64_t b = io.read_u64();\n    uint64_t c = a + b;\n\
+    \    io.write_u64_line(c);\n  }\n  return 0;\n}"
+  dependsOn:
+  - weilycoder/fast-io.hpp
+  isVerificationFile: true
+  path: test/many_aplusb.test.cpp
+  requiredBy: []
+  timestamp: '2025-10-29 20:09:11+08:00'
+  verificationStatus: TEST_ACCEPTED
+  verifiedWith: []
+documentation_of: test/many_aplusb.test.cpp
+layout: document
+redirect_from:
+- /verify/test/many_aplusb.test.cpp
+- /verify/test/many_aplusb.test.cpp.html
+title: test/many_aplusb.test.cpp
+---

test/static_range_sum.test.cpp.md

@@ -41,7 +41,7 @@ data:
   isVerificationFile: true
   path: test/static_range_sum.test.cpp
   requiredBy: []
-  timestamp: '2025-10-28 23:07:26+08:00'
+  timestamp: '2025-10-29 20:09:11+08:00'
   verificationStatus: TEST_ACCEPTED
   verifiedWith: []
 documentation_of: test/static_range_sum.test.cpp

test/strongly_connected_components.test.cpp.md

@@ -28,10 +28,11 @@ data:
     \ low[u] = std::min(low[u], low[v]);\n      else if (in_stack[v])\n        low[u]\
     \ = std::min(low[u], dfn[v]);\n    }\n\n    if (dfn[u] == low[u]) {\n      sccs.emplace_back();\n\
     \      sccs.back().push_back(u);\n      in_stack[u] = false;\n      while (stk.top()\
-    \ != u)\n        sccs.back().push_back(stk.top()), in_stack[stk.top()] = false,\
-    \ stk.pop();\n      stk.pop();\n    }\n  }\n\n  void solve() {\n    for (size_t\
-    \ i = 0; i < graph.size(); ++i)\n      if (!dfn[i])\n        tarjan(i);\n    std::reverse(sccs.begin(),\
-    \ sccs.end());\n  }\n};\n\ntemplate <typename ptr_t = size_t> struct TwoEdgeConnectedComponents\
+    \ != u)\n        sccs.back().push_back(stk.top()), in_stack[stk.top()] = false,\n\
+    \                                          stk.pop();\n      stk.pop();\n    }\n\
+    \  }\n\n  void solve() {\n    for (size_t i = 0; i < graph.size(); ++i)\n    \
+    \  if (!dfn[i])\n        tarjan(i);\n    std::reverse(sccs.begin(), sccs.end());\n\
+    \  }\n};\n\ntemplate <typename ptr_t = size_t> struct TwoEdgeConnectedComponents\
     \ {\n  ptr_t dfs_time = 0, edge_time = 1;\n\n  std::vector<bool> in_stack;\n \
     \ std::stack<ptr_t> stk;\n  std::vector<ptr_t> dfn, low;\n  std::vector<std::vector<std::pair<ptr_t,\
     \ ptr_t>>> graph;\n\n  std::vector<std::vector<ptr_t>> eccs;\n\n  TwoEdgeConnectedComponents(ptr_t\
@@ -45,21 +46,22 @@ data:
     \        low[u] = std::min(low[u], dfn[v]);\n    }\n\n    if (dfn[u] == low[u])\
     \ {\n      eccs.emplace_back();\n      eccs.back().push_back(u);\n      in_stack[u]\
     \ = false;\n      while (stk.top() != u)\n        eccs.back().push_back(stk.top()),\
-    \ in_stack[stk.top()] = false, stk.pop();\n      stk.pop();\n    }\n  }\n\n  void\
-    \ solve() {\n    for (size_t i = 0; i < graph.size(); ++i)\n      if (!dfn[i])\n\
-    \        tarjan(i, 0);\n  }\n};\n\ntemplate <typename ptr_t = size_t> struct BiconnectedComponents\
-    \ {\n  ptr_t dfs_time = 0;\n\n  std::stack<ptr_t> stk;\n  std::vector<ptr_t> dfn,\
-    \ low;\n  std::vector<std::vector<ptr_t>> graph;\n\n  std::vector<bool> is_cut;\n\
-    \  std::vector<std::vector<ptr_t>> dccs;\n\n  BiconnectedComponents(ptr_t n) :\
-    \ dfn(n, 0), low(n, 0), graph(n), is_cut(n, false) {}\n\n  void add_edge(ptr_t\
-    \ u, ptr_t v) {\n    graph[u].push_back(v);\n    graph[v].push_back(u);\n  }\n\
-    \n  void tarjan(ptr_t u, bool is_root) {\n    dfn[u] = low[u] = ++dfs_time, stk.push(u);\n\
-    \n    if (is_root && graph[u].empty()) {\n      dccs.emplace_back();\n      dccs.back().push_back(u);\n\
-    \      return;\n    }\n\n    ptr_t child = 0;\n    for (const auto &v : graph[u])\
-    \ {\n      if (!dfn[v]) {\n        tarjan(v, false), low[u] = std::min(low[u],\
-    \ low[v]);\n        if (low[v] >= dfn[u]) {\n          if (++child > 1 || !is_root)\n\
-    \            is_cut[u] = true;\n          dccs.emplace_back();\n          do\n\
-    \            dccs.back().push_back(stk.top()), stk.pop();\n          while (dccs.back().back()\
+    \ in_stack[stk.top()] = false,\n                                          stk.pop();\n\
+    \      stk.pop();\n    }\n  }\n\n  void solve() {\n    for (size_t i = 0; i <\
+    \ graph.size(); ++i)\n      if (!dfn[i])\n        tarjan(i, 0);\n  }\n};\n\ntemplate\
+    \ <typename ptr_t = size_t> struct BiconnectedComponents {\n  ptr_t dfs_time =\
+    \ 0;\n\n  std::stack<ptr_t> stk;\n  std::vector<ptr_t> dfn, low;\n  std::vector<std::vector<ptr_t>>\
+    \ graph;\n\n  std::vector<bool> is_cut;\n  std::vector<std::vector<ptr_t>> dccs;\n\
+    \n  BiconnectedComponents(ptr_t n)\n      : dfn(n, 0), low(n, 0), graph(n), is_cut(n,\
+    \ false) {}\n\n  void add_edge(ptr_t u, ptr_t v) {\n    graph[u].push_back(v);\n\
+    \    graph[v].push_back(u);\n  }\n\n  void tarjan(ptr_t u, bool is_root) {\n \
+    \   dfn[u] = low[u] = ++dfs_time, stk.push(u);\n\n    if (is_root && graph[u].empty())\
+    \ {\n      dccs.emplace_back();\n      dccs.back().push_back(u);\n      return;\n\
+    \    }\n\n    ptr_t child = 0;\n    for (const auto &v : graph[u]) {\n      if\
+    \ (!dfn[v]) {\n        tarjan(v, false), low[u] = std::min(low[u], low[v]);\n\
+    \        if (low[v] >= dfn[u]) {\n          if (++child > 1 || !is_root)\n   \
+    \         is_cut[u] = true;\n          dccs.emplace_back();\n          do\n  \
+    \          dccs.back().push_back(stk.top()), stk.pop();\n          while (dccs.back().back()\
     \ != v);\n          dccs.back().push_back(u);\n        }\n      } else\n     \
     \   low[u] = std::min(low[u], dfn[v]);\n    }\n  }\n\n  void solve() {\n    for\
     \ (size_t i = 0; i < graph.size(); ++i)\n      if (!dfn[i])\n        tarjan(i,\
@@ -86,7 +88,7 @@ data:
   isVerificationFile: true
   path: test/strongly_connected_components.test.cpp
   requiredBy: []
-  timestamp: '2025-10-28 23:07:26+08:00'
+  timestamp: '2025-10-29 20:09:11+08:00'
   verificationStatus: TEST_ACCEPTED
   verifiedWith: []
 documentation_of: test/strongly_connected_components.test.cpp