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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
|
#include "../util.h"
#pragma GCC diagnostic ignored "-Wshadow"
#include "connectMinLCT.h"
constexpr ll INF = 0x3FFF'FFFF;
#include <graph/connect.cpp>
struct Naive {
vector<multiset<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);
}
}
}
}
bool connected(int a, int b) {
bool res = false;
dfs(a, [&](int x){res |= x == b;});
return res;
}
void addEdge(int a, int b) {
adj[a].insert(b);
adj[b].insert(a);
}
void eraseEdge(int a, int b) {
adj[a].erase(adj[a].find(b));
adj[b].erase(adj[b].find(a));
}
};
void stress_test() {
ll queries = 0;
for (int tries = 0; tries < 2'000; tries++) {
int n = Random::integer<int>(2, 30);
int m = Random::integer<int>(30, 300);
vector<int> insertOrder(m);
iota(all(insertOrder), 0);
shuffle(all(insertOrder), Random::rng);
vector<pair<int, int>> edges(m, {-1, -1});
connect con(n, m);
Naive naive(n);
int deleted = 0;
for (int i = 0; i < m; i++) {
{
int a = Random::integer<int>(0, n);
int b = a;
while (b == a) b = Random::integer<int>(0, n);
edges[insertOrder[i]] = {a, b};
con.addEdge(a, b, insertOrder[i]);
naive.addEdge(a, b);
}
while (deleted < m && edges[deleted] != pair<int, int>{-1, -1} && Random::integer<int>(2) == 0) {
auto [a, b] = edges[deleted];
con.eraseEdge(deleted);
naive.eraseEdge(a, b);
deleted++;
}
for (int j = 0; j < n; j++) {
int a = Random::integer<int>(0, n);
int b = Random::integer<int>(0, n);
auto got = con.connected(a, b);
auto expected = naive.connected(a, b);
if (got != expected) cerr << "error" << FAIL;
}
queries += n;
}
}
cerr << "tested random queries: " << queries << endl;
}
constexpr int N = 100'000;
constexpr int M = 500'000;
void performance_test() {
timer t;
t.start();
connect con(N, M);
t.stop();
vector<int> insertOrder(M);
iota(all(insertOrder), 0);
shuffle(all(insertOrder), Random::rng);
vector<bool> inserted(M);
for (int i = 0, j = 0; i < N; i++) {
int a = Random::integer<int>(0, N);
int b = a;
while (b == a) b = Random::integer<int>(0, N);
t.start();
con.addEdge(a, b, insertOrder[i]);
t.stop();
inserted[i] = true;
while (j < M && inserted[j] && Random::integer<int>(2) == 0) {
t.start();
con.eraseEdge(j);
t.stop();
}
}
hash_t hash = 0;
for (int i = 1; i < N; i++) {
t.start();
hash += con.connected(i - 1, i);
t.stop();
}
if (t.time > 1000) cerr << "too slow: " << t.time << FAIL;
cerr << "tested performance: " << t.time << "ms (hash: " << hash << ")" << endl;
}
int main() {
stress_test();
performance_test();
}
|
