speed up test

Author: lrvideckis

tests/library_checker_aizu_tests/graphs/offline_incremental_scc.test.cpp

@@ -1,10 +1,10 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/incremental_scc"
+// to speed up test
+#undef _GLIBCXX_DEBUG
 #include "../template.hpp"
 #include "../../../kactl/content/data-structures/UnionFind.h"
-#include "../../../library/contest/random.hpp"
 #include "../../../library/graphs/strongly_connected_components/offline_incremental_scc.hpp"
-#include "../../../library/graphs/strongly_connected_components/scc.hpp"
 #include "../../../library/math/mod_int.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
@@ -17,11 +17,10 @@ int main() {
   auto joins = offline_incremental_scc(eds, n);
   // assert joins[i] == -1 for self-edges
   for (int t = 0; t < m; t++)
-    if (eds[t][0] == eds[t][1]) assert(joins[t] == -1);
+    assert((eds[t][0] == eds[t][1]) == (joins[t] == -1));
   vector<int> order(m);
   iota(all(order), 0);
-  sort(all(order),
-    [&](int i, int j) { return joins[i] < joins[j]; });
+  ranges::sort(all(order), {}, [&](int i) { return joins[i]; });
   UF uf(n);
   mint sum = 0;
   for (int t = 0, it = 0; t < m; t++) {