Skip to content

Remove dsu rollback #187

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
lrvideckis merged 6 commits into from
Feb 27, 2026
Merged

Remove dsu rollback #187

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
5245312
remove dsu restorable - kactls is just better
lrvideckis Feb 27, 2026
b82e364
[auto-verifier] verify commit 5245312324dc1dec22406e1999066b29eb317d00
web-flow Feb 27, 2026
90480fa
update tests
lrvideckis Feb 27, 2026
b588259
[auto-verifier] verify commit 90480fad6ee0dc6d910edcd867dadc8a0f83dd75
web-flow Feb 27, 2026
56bbac0
remove
lrvideckis Feb 27, 2026
e0a0fce
Merge branch 'remove_dsu_rollback' of github.com:programming-team-cod…
lrvideckis Feb 27, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
7 changes: 2 additions & 5 deletions .verify-helper/timestamps.remote.json
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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",
Expand All @@ -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",
Expand Down Expand Up @@ -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",
Expand All @@ -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",
Expand Down
41 changes: 0 additions & 41 deletions library/dsu/dsu_restorable.hpp
View file
Open in desktop

This file was deleted.

39 changes: 0 additions & 39 deletions tests/library_checker_aizu_tests/data_structures/dsu_restorable.test.cpp
View file
Open in desktop

This file was deleted.

127 changes: 0 additions & 127 deletions tests/library_checker_aizu_tests/data_structures/dsu_segtree_undo_trick.test.cpp
View file
Open in desktop

This file was deleted.

77 changes: 0 additions & 77 deletions tests/library_checker_aizu_tests/data_structures/pq_ds_undo_with_dsu.test.cpp
View file
Open in desktop

This file was deleted.

9 changes: 4 additions & 5 deletions tests/library_checker_aizu_tests/graphs/two_edge_components.test.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;
Expand Down Expand Up @@ -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]) {
Expand All @@ -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++) {
Expand Down
Loading
Loading