revert formatting of some files

lrvideckis · lrvideckis · commit f725f1f5e60e · 2025-01-24T11:38:16.000-07:00
diff --git a/library/contest/dynamic_bitset.hpp b/library/contest/dynamic_bitset.hpp
@@ -18,7 +18,7 @@ void f() {
   bs.push_back(0);
   cerr << bs << endl;
   for (int i = bs.find_first(); i != ssize(bs);
-    i = bs.find_next(i))
+       i = bs.find_next(i))
     cerr << i << endl;
   bs -= bs; // bs &= ~bs;
 }
diff --git a/library/data_structures/uncommon/priority_queue_of_updates.hpp b/library/data_structures/uncommon/priority_queue_of_updates.hpp
@@ -34,7 +34,7 @@ template<class DS, class... ARGS> struct pq_updates {
     vector<upd> extra;
     int idx = sz(upd_st) - 1, lowest_pri = INT_MAX;
     for (auto it = rbegin(mp);
-      2 * sz(extra) < sz(upd_st) - idx; it++) {
+         2 * sz(extra) < sz(upd_st) - idx; it++) {
       auto [pri, idx_sk] = *it;
       extra.push_back(upd_st[idx_sk]);
       idx = min(idx, idx_sk), lowest_pri = pri;
diff --git a/library/loops/chooses.hpp b/library/loops/chooses.hpp
@@ -5,4 +5,4 @@
 //! @time O(n choose k)
 //! @space O(1)
 for (int mask = (1 << k) - 1; mask < (1 << n);
-  mask = next_subset(mask))
+     mask = next_subset(mask))
diff --git a/library/loops/submasks.hpp b/library/loops/submasks.hpp
@@ -5,4 +5,4 @@
 //!   of every mask of size n
 //! @space O(1)
 for (int submask = mask; submask;
-  submask = (submask - 1) & mask)
+     submask = (submask - 1) & mask)
diff --git a/library/loops/supermasks.hpp b/library/loops/supermasks.hpp
@@ -6,4 +6,4 @@
 //!   of every mask of size n
 //! @space O(1)
 for (int supermask = mask; supermask < (1 << n);
-  supermask = (supermask + 1) | mask)
+     supermask = (supermask + 1) | mask)
diff --git a/library/math/partitions.hpp b/library/math/partitions.hpp
@@ -12,7 +12,7 @@ vector<ll> partitions(int n) {
   rep(i, 1, n) {
     ll sum = 0;
     for (int j = 1, pent = 1, sign = 1; pent <= i;
-      j++, pent += 3 * j - 2, sign = -sign) {
+         j++, pent += 3 * j - 2, sign = -sign) {
       if (pent + j <= i)
         sum += dp[i - pent - j] * sign + mod;
       sum += dp[i - pent] * sign + mod;
diff --git a/library/math/prime_sieve/mobius.hpp b/library/math/prime_sieve/mobius.hpp
@@ -4,4 +4,4 @@
 vi mobius(100'005);
 mobius[1] = 1;
 rep(i, 1, sz(mobius)) for (int j = i + i; j < sz(mobius);
-  j += i) mobius[j] -= mobius[i];
+                           j += i) mobius[j] -= mobius[i];
diff --git a/library/monotonic_stack/cartesian_binary_tree.hpp b/library/monotonic_stack/cartesian_binary_tree.hpp
@@ -24,6 +24,7 @@
 vi cart_binary_tree(const vi& l) {
   vi p(l);
   rep(i, 0, sz(p)) for (int j = i - 1; j != l[i];
-    j = l[j]) if (l[j] == l[i]) p[j] = i;
+                        j = l[j]) if (l[j] == l[i]) p[j] =
+    i;
   return p;
 }
diff --git a/library/monotonic_stack/monotonic_stack.hpp b/library/monotonic_stack/monotonic_stack.hpp
@@ -9,7 +9,8 @@
 //! @space O(n)
 vi mono_st(const auto& a, auto cmp) {
   vi l(sz(a));
-  rep(i, 0, sz(a)) for (l[i] = i - 1;
-    l[i] >= 0 && !cmp(a[l[i]], a[i]);) l[i] = l[l[i]];
+  rep(i, 0, sz(a)) for (
+    l[i] = i - 1; l[i] >= 0 && !cmp(a[l[i]], a[i]);) l[i] =
+    l[l[i]];
   return l;
 }
diff --git a/library/strings/suffix_array/find/find_string_bs_fast.hpp b/library/strings/suffix_array/find/find_string_bs_fast.hpp
@@ -8,7 +8,7 @@ match find_str_fast(const T& t) {
   int s_l = n, s_len = 0;
   auto cmp = [&](int i, int) -> bool {
     if (int lcp_len = s_l == n ? 0 : len_lcp(s_l, i);
-      lcp_len != s_len)
+        lcp_len != s_len)
       return (lcp_len < s_len) ^ (cmp_sufs(s_l, i) < 0);
     auto [it_s, it_t] =
       mismatch(i + s_len + all(s), s_len + all(t));
diff --git a/library/strings/suffix_array/suffix_array.hpp b/library/strings/suffix_array/suffix_array.hpp
@@ -62,7 +62,7 @@ auto get_sa(const auto& s, int max_num) {
     if (sz > 0) sz--;
     if (sa_inv[i] == 0) continue;
     for (int j = sa[sa_inv[i] - 1];
-      max(i, j) + sz < n && s[i + sz] == s[j + sz];)
+         max(i, j) + sz < n && s[i + sz] == s[j + sz];)
       sz++;
     lcp[sa_inv[i] - 1] = sz;
   }
diff --git a/library/strings/suffix_array/suffix_array_short.hpp b/library/strings/suffix_array/suffix_array_short.hpp
@@ -29,7 +29,7 @@ auto sa_short(const auto& s) {
     if (sz > 0) sz--;
     if (sa_inv[i] == 0) continue;
     for (int j = sa[sa_inv[i] - 1];
-      max(i, j) + sz < n && s[i + sz] == s[j + sz];)
+         max(i, j) + sz < n && s[i + sz] == s[j + sz];)
       sz++;
     lcp[sa_inv[i] - 1] = sz;
   }
diff --git a/tests/library_checker_aizu_tests/data_structures/line_tree_aizu.test.cpp b/tests/library_checker_aizu_tests/data_structures/line_tree_aizu.test.cpp
@@ -29,8 +29,8 @@ int main() {
   vector<int> edge_weights;
   vector<int> to_time(n);
   for (int v = lt.find(0), timer = 1;
-    lt.edge[v] != pii{-1, -1};
-    v = lt.edge[v].first, timer++) {
+       lt.edge[v] != pii{-1, -1};
+       v = lt.edge[v].first, timer++) {
     edge_weights.push_back(w_eds[lt.edge[v].second][0]);
     to_time[lt.edge[v].first] = timer;
     mst_sum += w_eds[lt.edge[v].second][0];
diff --git a/tests/library_checker_aizu_tests/data_structures/line_tree_lib_checker.test.cpp b/tests/library_checker_aizu_tests/data_structures/line_tree_lib_checker.test.cpp
@@ -23,7 +23,7 @@ int main() {
   int64_t cost = 0;
   vector<int> ids;
   for (int v = lt.find(0); lt.edge[v].first != -1;
-    v = lt.edge[v].first) {
+       v = lt.edge[v].first) {
     ids.push_back(w_eds[lt.edge[v].second][0]);
     cost += weights[w_eds[lt.edge[v].second][0]];
   }
diff --git a/tests/library_checker_aizu_tests/data_structures/persistent_queue_tree.test.cpp b/tests/library_checker_aizu_tests/data_structures/persistent_queue_tree.test.cpp
@@ -11,7 +11,7 @@ int main() {
   // bounds[version] = [left index, right index) represents
   // subarray range of queue
   for (int curr_version = 1; curr_version <= q;
-    curr_version++) {
+       curr_version++) {
     int type;
     cin >> type;
     if (type == 0) {
diff --git a/tests/library_checker_aizu_tests/graphs/offline_incremental_scc.test.cpp b/tests/library_checker_aizu_tests/graphs/offline_incremental_scc.test.cpp
@@ -1,9 +1,10 @@
-#define PROBLEM \
-  "https://judge.yosupo.jp/problem/incremental_scc"
+#define PROBLEM "https://judge.yosupo.jp/problem/incremental_scc"
 #include "../template.hpp"
+
 #include "../../../library/graphs/strongly_connected_components/offline_incremental_scc.hpp"
 #include "../../../kactl/content/data-structures/UnionFind.h"
 #include "../../../library/math/mod_int.hpp"
+
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;
@@ -18,8 +19,7 @@ int main() {
     assert((eds[t][0] == eds[t][1]) == (joins[t] == -1));
   vector<int> order(m);
   iota(all(order), 0);
-  ranges::sort(all(order), {},
-    [&](int i) { return joins[i]; });
+  ranges::sort(all(order), {}, [&](int i) { return joins[i]; });
   UF uf(n);
   mint sum = 0;
   for (int t = 0, it = 0; t < m; t++) {
diff --git a/tests/library_checker_aizu_tests/graphs/strongly_connected_components_aizu.test.cpp b/tests/library_checker_aizu_tests/graphs/strongly_connected_components_aizu.test.cpp
@@ -1,8 +1,10 @@
 #define PROBLEM \
   "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_3_C"
 #include "../template.hpp"
+
 #include "../../../library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp"
 #include "../scc_asserts.hpp"
+
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;
diff --git a/tests/library_checker_aizu_tests/graphs/strongly_connected_components_lib_checker.test.cpp b/tests/library_checker_aizu_tests/graphs/strongly_connected_components_lib_checker.test.cpp
@@ -1,7 +1,9 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/scc"
 #include "../template.hpp"
+
 #include "../../../library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp"
 #include "../scc_asserts.hpp"
+
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;
@@ -16,8 +18,7 @@ int main() {
   auto [num_sccs, scc_id] = sccs(adj);
   cout << num_sccs << '\n';
   vector<vector<int>> each_scc(num_sccs);
-  for (int i = 0; i < n; i++)
-    each_scc[scc_id[i]].push_back(i);
+  for (int i = 0; i < n; i++) each_scc[scc_id[i]].push_back(i);
   for (int i = num_sccs - 1; i >= 0; i--) {
     cout << sz(each_scc[i]) << " ";
     for (auto node : each_scc[i]) cout << node << " ";
diff --git a/tests/library_checker_aizu_tests/math/xor_basis.test.cpp b/tests/library_checker_aizu_tests/math/xor_basis.test.cpp
@@ -60,7 +60,7 @@ int main() {
         }
         for (int i1 = 0; i1 < sz(unordered.b); i1++) {
           for (int i2 = i1 + 1; i2 < sz(unordered.b);
-            i2++) {
+               i2++) {
             assert(__lg(unordered.b[i1]) !=
               __lg(unordered.b[i2]));
             assert(((1LL << __lg(unordered.b[i1])) &
diff --git a/tests/library_checker_aizu_tests/strings/prefix_function.test.cpp b/tests/library_checker_aizu_tests/strings/prefix_function.test.cpp
@@ -17,8 +17,8 @@ int main() {
   for (int i = 1; i < n;) {
     int j, v;
     for (j = 1;
-      j < z[i] && (v = min(z[j], z[i] - j)) >= z[i + j];
-      j++)
+         j < z[i] && (v = min(z[j], z[i] - j)) >= z[i + j];
+         j++)
       z[i + j] = v;
     i += j;
   }

Original file line number	Diff line number	Diff line change
`@@ -18,7 +18,7 @@ void f() {`
`18`	`18`	`bs.push_back(0);`
`19`	`19`	`cerr << bs << endl;`
`20`	`20`	`for (int i = bs.find_first(); i != ssize(bs);`
`21`		`- i = bs.find_next(i))`
	`21`	`+ i = bs.find_next(i))`
`22`	`22`	`cerr << i << endl;`
`23`	`23`	`bs -= bs; // bs &= ~bs;`
`24`	`24`	`}`
Original file line number	Diff line number	Diff line change
`@@ -24,6 +24,7 @@`
`24`	`24`	`vi cart_binary_tree(const vi& l) {`
`25`	`25`	`vi p(l);`
`26`	`26`	`rep(i, 0, sz(p)) for (int j = i - 1; j != l[i];`
`27`		`- j = l[j]) if (l[j] == l[i]) p[j] = i;`
	`27`	`+ j = l[j]) if (l[j] == l[i]) p[j] =`
	`28`	`+ i;`
`28`	`29`	`return p;`
`29`	`30`	`}`