Remove dsu rollback (#187)

* remove dsu restorable - kactls is just better

* [auto-verifier] verify commit 5245312

* update tests

* [auto-verifier] verify commit 90480fa

* remove

---------

Co-authored-by: GitHub <noreply@github.com>

Author: lrvideckis

.verify-helper/timestamps.remote.json

@@ -20,8 +20,6 @@
 "tests/library_checker_aizu_tests/data_structures/distinct_query.test.cpp": "2026-01-18 11:15:41 +0000",
 "tests/library_checker_aizu_tests/data_structures/dsu.test.cpp": "2026-01-22 10:08:22 -0700",
 "tests/library_checker_aizu_tests/data_structures/dsu_bipartite.test.cpp": "2026-01-18 02:20:40 +0000",
-"tests/library_checker_aizu_tests/data_structures/dsu_restorable.test.cpp": "2026-01-18 02:20:40 +0000",
-"tests/library_checker_aizu_tests/data_structures/dsu_segtree_undo_trick.test.cpp": "2026-01-23 04:31:29 +0000",
 "tests/library_checker_aizu_tests/data_structures/implicit_seg_tree.test.cpp": "2026-01-18 11:15:41 +0000",
 "tests/library_checker_aizu_tests/data_structures/kd_bit_1d.test.cpp": "2026-02-19 18:06:52 -0700",
 "tests/library_checker_aizu_tests/data_structures/kruskal_tree_aizu.test.cpp": "2026-01-18 02:20:40 +0000",
@@ -39,7 +37,6 @@
 "tests/library_checker_aizu_tests/data_structures/persistent_queue_tree.test.cpp": "2026-01-18 11:15:41 +0000",
 "tests/library_checker_aizu_tests/data_structures/persistent_seg_tree.test.cpp": "2026-01-18 11:15:41 +0000",
 "tests/library_checker_aizu_tests/data_structures/pq_ds_undo_sliding_window.test.cpp": "2026-01-18 02:20:40 +0000",
-"tests/library_checker_aizu_tests/data_structures/pq_ds_undo_with_dsu.test.cpp": "2026-01-18 02:20:40 +0000",
 "tests/library_checker_aizu_tests/data_structures/range_parallel_dsu.test.cpp": "2026-01-22 10:08:22 -0700",
 "tests/library_checker_aizu_tests/data_structures/rmq_linear.test.cpp": "2026-01-18 11:15:41 +0000",
 "tests/library_checker_aizu_tests/data_structures/rmq_sparse_table.test.cpp": "2026-01-18 11:15:41 +0000",
@@ -71,10 +68,9 @@
 "tests/library_checker_aizu_tests/graphs/offline_incremental_scc.test.cpp": "2026-01-22 10:08:22 -0700",
 "tests/library_checker_aizu_tests/graphs/strongly_connected_components_aizu.test.cpp": "2026-01-17 13:05:42 -0700",
 "tests/library_checker_aizu_tests/graphs/strongly_connected_components_lib_checker.test.cpp": "2026-01-17 13:05:42 -0700",
-"tests/library_checker_aizu_tests/graphs/two_edge_components.test.cpp": "2026-01-18 02:20:40 +0000",
+"tests/library_checker_aizu_tests/graphs/two_edge_components.test.cpp": "2026-02-27 11:11:58 -0700",
 "tests/library_checker_aizu_tests/handmade_tests/count_paths.test.cpp": "2026-01-18 11:15:41 +0000",
 "tests/library_checker_aizu_tests/handmade_tests/dsu.test.cpp": "2026-01-22 10:08:22 -0700",
-"tests/library_checker_aizu_tests/handmade_tests/dsu_size.test.cpp": "2026-01-18 02:20:40 +0000",
 "tests/library_checker_aizu_tests/handmade_tests/edge_cd_small_trees.test.cpp": "2025-09-07 15:50:55 -0600",
 "tests/library_checker_aizu_tests/handmade_tests/fib_matrix_expo.test.cpp": "2026-01-28 21:48:16 -0700",
 "tests/library_checker_aizu_tests/handmade_tests/functional_graph.test.cpp": "2025-08-06 16:18:37 -0600",
@@ -90,6 +86,7 @@
 "tests/library_checker_aizu_tests/handmade_tests/sa_find_subarray.test.cpp": "2026-01-27 18:11:48 +0000",
 "tests/library_checker_aizu_tests/handmade_tests/seg_tree_find.test.cpp": "2026-01-23 04:31:29 +0000",
 "tests/library_checker_aizu_tests/handmade_tests/seg_tree_find_small.test.cpp": "2026-01-23 04:31:29 +0000",
+"tests/library_checker_aizu_tests/handmade_tests/seg_tree_midpoint.test.cpp": "2026-02-27 11:11:58 -0700",
 "tests/library_checker_aizu_tests/loops/chooses.test.cpp": "2025-02-10 14:50:36 -0700",
 "tests/library_checker_aizu_tests/loops/quotients.test.cpp": "2024-11-17 14:04:03 -0600",
 "tests/library_checker_aizu_tests/loops/submasks.test.cpp": "2025-02-10 14:50:36 -0700",

library/dsu/dsu_restorable.hpp

@@ -2,7 +2,7 @@
   "https://judge.yosupo.jp/problem/two_edge_connected_components"
 #include "../template.hpp"
 #include "../../../library/graphs/uncommon/bridge_tree.hpp"
-#include "../../../library/dsu/dsu_restorable.hpp"
+#include "../../../library/dsu/dsu.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;
@@ -33,7 +33,7 @@ int main() {
       accumulate(begin(is_br), end(is_br), 0);
     assert(sum_deg % 2 == 0 && sum_deg / 2 == cnt_bridges);
   }
-  dsu_restorable dsu(n);
+  DSU dsu(n);
   int num_sets_dsu = n;
   for (int i = 0; i < m; i++) {
     if (!is_br[i]) {
@@ -45,12 +45,11 @@ int main() {
   for (int i = 0; i < m; i++) {
     if (is_br[i]) {
       auto [u, v] = edges[i];
-      bool same_set = dsu.same_set(u, v);
-      assert(!same_set);
+      assert(dsu.f(u) != dsu.f(v));
     }
   }
   for (int i = 0; i < n; i++) {
-    int par_of_cc = dsu.find(i);
+    int par_of_cc = dsu.f(i);
     assert(br_id[i] == br_id[par_of_cc]);
   }
   for (int i = 0; i < m; i++) {