blob: bd362eba63ea600ec0cb2f27e12da36335b4473c (
plain)
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
|
#include "../util.h"
#include <math/inversions.cpp>
ll naive(const vector<ll>& v) {
ll res = 0;
for (ll i = 0; i < sz(v); i++) {
for (ll j = 0; j < i; j++) {
if (v[j] > v[i]) res++;
}
}
return res;
}
void stress_test() {
ll queries = 0;
for (ll i = 0; i < 100'000; i++) {
int n = Random::integer<int>(1, 100);
auto v = Random::integers<ll>(n, -50, 50);
ll got = inversions(v);
ll expected = naive(v);
if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
queries += n;
}
cerr << "tested queries: " << queries << endl;
}
constexpr int N = 200'000;
void performance_test() {
timer t;
auto v = Random::integers<ll>(N, -10'000, 10'000);
t.start();
hash_t hash = inversions(v);
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();
performance_test();
}
|