1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
|
#include "../util.h"
#include <datastructures/unionFind.cpp>
struct Naive {
vector<vector<int>> adj;
vector<int> seen;
int counter;
Naive(int n) : adj(n), seen(n), counter(0) {}
template<typename F>
void dfs(int x, F&& f) {
counter++;
vector<int> todo = {x};
seen[x] = counter;
while (!todo.empty()) {
x = todo.back();
todo.pop_back();
f(x);
for (ll y : adj[x]) {
if (seen[y] != counter) {
seen[y] = counter;
todo.push_back(y);
}
}
}
}
int find(int a) {
int res = a;
dfs(a, [&](int x){res = min(res, x);});
return res;
}
bool link(int a, int b) {
bool linked = false;
dfs(a, [&](int x) { linked |= x == b; });
adj[a].push_back(b);
adj[b].push_back(a);
return !linked;
}
int size(int a) {
int res = 0;
dfs(a, [&](int /**/){res++;});
return res;
}
int add() {
int idx = ssize(adj);
adj.emplace_back();
seen.push_back(counter);
return idx;
}
};
void stress_test() {
ll queries = 0;
for (int tries = 0; tries < 200; tries++) {
int n = Random::integer<int>(1, 100);
UnionFind uf(n);
Naive naive(n);
int rounds = n;
for (int i = 0; i < rounds; i++) {
for (int j = 0; j < 10; j++) {
int a = Random::integer<int>(0, n);
int b = Random::integer<int>(0, n);
auto got = uf.link(a, b);
auto expected = naive.link(a, b);
if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
}
{
auto got = uf.add();
auto expected = naive.add();
assert(expected == n);
if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
n++;
}
UnionFind tmp = uf;
for (int j = 0; j < n; j++) {
{
auto got = tmp.size(j);
auto expected = naive.size(j);
if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
}
{
int a = Random::integer<int>(0, n);
int b = Random::integer<int>(0, n);
bool got = tmp.find(a) == tmp.find(b);
bool expected = naive.find(a) == naive.find(b);
if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
}
}
queries += n;
}
}
cerr << "tested random queries: " << queries << endl;
}
constexpr int N = 2'000'000;
void performance_test() {
timer t;
t.start();
UnionFind uf(N);
t.stop();
hash_t hash = 0;
for (int operations = 0; operations < N; operations++) {
int i = Random::integer<int>(0, N);
int j = Random::integer<int>(0, N);
int k = Random::integer<int>(0, N);
int l = Random::integer<int>(0, N);
t.start();
uf.link(i, j);
hash += uf.size(k);
hash += uf.size(l);
t.stop();
}
if (t.time > 500) cerr << "too slow: " << t.time << FAIL;
cerr << "tested performance: " << t.time << "ms (hash: " << hash << ")" << endl;
}
int main() {
stress_test();
if (!sanitize) performance_test();
}
|
