update

Author: lrvideckis

tests/library_checker_aizu_tests/data_structures/deque_op.test.cpp

@@ -52,7 +52,7 @@ int main() {
       assert(stl_dq.front() == dq.front());
       assert(stl_dq.back() == dq.back());
       for (int index_tests = 10; index_tests--;) {
-        int idx = rnd<int>(0, dq.siz() - 1);
+        int idx = rnd(0, dq.siz() - 1);
         assert(stl_dq[idx] == dq[idx]);
       }
     }

tests/library_checker_aizu_tests/graphs/directed_cycle.test.cpp

@@ -16,7 +16,7 @@ int main() {
     adj_edge_id[u].emplace_back(v, i);
   }
   scc_asserts(adj);
-  sccs scc(adj);
+  auto [num_sccs, scc_id] = sccs(adj);
   vector<int> color(n);
   vector<
     pair<int /*edge id*/, int /*node closer to root*/>>
@@ -35,7 +35,7 @@ int main() {
           auto [curr_edge_id, curr_node] =
             edge_stack.back();
           edge_stack.pop_back();
-          assert(scc.scc_id[curr_node] == scc.scc_id[u]);
+          assert(scc_id[curr_node] == scc_id[u]);
           res.push_back(curr_edge_id);
           if (curr_node == v) break;
         }
@@ -53,7 +53,7 @@ int main() {
       color[i] = 2;
     }
   }
-  assert(scc.num_sccs == n);
+  assert(num_sccs == n);
   cout << -1 << '\n';
   return 0;
 }

tests/library_checker_aizu_tests/handmade_tests/fib_matrix_expo.test.cpp

@@ -31,7 +31,7 @@ int main() {
   assert(fib(5)[0] == 5);
   for (int i = 0; i < 500; i++) check(i);
   for (int tests = 1000; tests--;)
-    check(rnd<int64_t>(0, LLONG_MAX));
+    check(rnd(0LL, LLONG_MAX));
   cout << "Hello World\n";
   return 0;
 }

tests/library_checker_aizu_tests/handmade_tests/mod_int.test.cpp

@@ -16,7 +16,7 @@ int main() {
   for (int i = 0; i < 1'000'000; i++) {
     int type = rnd(0, 5);
     if (type == 0) {
-      mod = mods[rnd<int>(0, sz(mods) - 1)];
+      mod = mods[rnd(0, int(sz(mods)) - 1)];
       val = rnd(-mod + 1, mod - 1);
       assert(0 <= val.x && val.x < mod);
     } else if (type == 1) {

tests/library_checker_aizu_tests/mono_st_asserts.hpp

@@ -69,9 +69,8 @@ void mono_st_asserts(const vector<int>& a) {
       assert(iterations == n);
     }
     {
-      vector old_way_ri =
-        mono_st<int>({rbegin(a), rend(a)},
-          [&](int x, int y) { return !cmp(y, x); });
+      vector old_way_ri = mono_st(vi{rbegin(a), rend(a)},
+        [&](int x, int y) { return !cmp(y, x); });
       reverse(begin(old_way_ri), end(old_way_ri));
       transform(begin(old_way_ri), end(old_way_ri),
         begin(old_way_ri),

tests/library_checker_aizu_tests/strings/lcp_query_zfunc.test.cpp

@@ -12,25 +12,25 @@ int main() {
   // test `*_cmp` functions
   {
     for (int num_tests = 50; num_tests--;) {
-      auto l = rnd<int>(0, sz(s) - 1);
-      auto r = rnd<int>(0, sz(s) - 1);
+      auto l = rnd(0, int(sz(s)) - 1);
+      auto r = rnd(0, int(sz(s)) - 1);
       int cmp_val = lq.cmp_sufs(l, r);
       if (cmp_val < 0) assert(s.substr(l) < s.substr(r));
       if (cmp_val == 0) assert(s.substr(l) == s.substr(r));
       if (cmp_val > 0) assert(s.substr(l) > s.substr(r));
     }
     for (int num_tests = 50; num_tests--;) {
-      auto l1 = rnd<int>(0, sz(s));
-      auto r1 = rnd<int>(0, sz(s));
+      auto l1 = rnd(0, int(sz(s)));
+      auto r1 = rnd(0, int(sz(s)));
       if (l1 > r1) swap(l1, r1);
       if (l1 == sz(s)) l1--;
       int l2, r2;
       if (rnd(0, 20) == 0) {
         l2 = l1;
         r2 = r1;
       } else {
-        l2 = rnd<int>(0, sz(s));
-        r2 = rnd<int>(0, sz(s));
+        l2 = rnd(0, int(sz(s)));
+        r2 = rnd(0, int(sz(s)));
         if (l2 > r2) swap(l2, r2);
         if (l2 == sz(s)) l2--;
       }

tests/library_checker_aizu_tests/strings/single_matching_bs.test.cpp

@@ -49,7 +49,7 @@ int main() {
     for (int num_tests = 10; num_tests--;) {
       vector<int> splits = {0, int(sz(t))};
       for (int num_splits = rnd(0, 4); num_splits--;)
-        splits.push_back(rnd<int>(0, sz(t) - 1));
+        splits.push_back(rnd(0, int(sz(t)) - 1));
       sort(begin(splits), end(splits));
       vector<pair<int, int>> subs;
       for (int i = 1; i < sz(splits); i++)