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
|
#include "../util.h"
constexpr ll INF = LL::INF;
#include <datastructures/lazyPropagation.cpp>
constexpr int N = 1000'000;
void stress_test() {
ll queries = 0;
for (int tries = 0; tries < 100; tries++) {
int n = Random::integer<int>(10, 100);
vector<ll> naive = Random::integers<ll>(n, -1000, 1000);
SegTree tree(naive);
for (int operations = 0; operations < 1000; operations++) {
{
int l = Random::integer<int>(0, n + 1);
int r = Random::integer<int>(0, n + 1);
//if (l > r) swap(l, r);
ll x = Random::integer<ll>(-1000, 1000);
tree.update(l, r, x);
for (int j = l; j < r; j++) naive[j] = x;
}
{
queries++;
int l = Random::integer<int>(0, n + 1);
int r = Random::integer<int>(0, n + 1);
//if (l > r) swap(l, r);
ll got = tree.query(l, r);
ll expected = 0;
for (int j = l; j < r; j++) expected += naive[j];
if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
}
}
}
cerr << "tested random queries: " << queries << endl;
}
void stress_test_binary_search() {
ll queries = 0;
for (int tries = 0; tries < 100; tries++) {
int n = Random::integer<int>(10, 100);
vector<ll> naive = Random::integers<ll>(n, 0, 1000);
SegTree tree(naive);
for (int operations = 0; operations < 1000; operations++) {
{
int l = Random::integer<int>(0, n + 1);
int r = Random::integer<int>(0, n + 1);
//if (l > r) swap(l, r);
ll x = Random::integer<ll>(0, 1000);
tree.update(l, r, x);
for (int j = l; j < r; j++) naive[j] = x;
}
{
queries++;
int l = Random::integer<int>(0, n + 1);
int r = Random::integer<int>(0, n + 1);
ll x = Random::integer<ll>(0, 10000);
//if (l > r) swap(l, r);
int got = tree.binary_search(l, r, [x](ll v) { return v >= x; });
ll sum;
int j;
for (j = l, sum = 0; j < r && sum < x; j++) sum += naive[j];
int expected = sum >= x ? j : -1;
if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
}
}
}
cerr << "tested random binary searches: " << queries << endl;
}
void performance_test() {
timer t;
t.start();
vector<ll> tmp(N);
SegTree tree(tmp);
t.stop();
hash_t hash = 0;
for (int operations = 0; operations < N; operations++) {
auto [l1, r1] = Random::pair<int>(0, N + 1);
auto [l2, r2] = Random::pair<int>(0, N + 1);
ll x1 = Random::integer<ll>(-1000, 1000);
t.start();
tree.update(l1, r1, x1);
hash ^= tree.query(l2, r2);
t.stop();
}
if (t.time > 2000) cerr << "too slow: " << t.time << FAIL;
cerr << "tested performance: " << t.time << "ms (hash: " << hash << ")" << endl;
}
void performance_test_binary_search() {
timer t;
t.start();
vector<ll> tmp(N);
SegTree tree(tmp);
t.stop();
hash_t hash = 0;
for (int operations = 0; operations < N; operations++) {
auto [l1, r1] = Random::pair<int>(0, N + 1);
auto [l2, r2] = Random::pair<int>(0, N + 1);
ll x1 = Random::integer<ll>(0, 1000);
ll x2 = Random::integer<ll>(0, 1000 * N);
t.start();
tree.update(l1, r1, x1);
hash ^= tree.binary_search(l2, r2, [x2](ll v) { return v >= x2; });
t.stop();
}
if (t.time > 2000) cerr << "too slow: " << t.time << FAIL;
cerr << "tested performance: " << t.time << "ms (hash: " << hash << ")" << endl;
}
int main() {
stress_test();
stress_test_binary_search();
if (!sanitize) {
performance_test();
performance_test_binary_search();
}
}
|
