blob: 4e558dc52cd54a7a7c2dbe76238e829129e341e1 (
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
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
|
#include "../util.h"
constexpr ll EPS = 0;
#define double ll
#define polar polar<ll>
#include <geometry/formulas.cpp>
#undef polar
#undef double
constexpr ll INF = LL::INF;
ll sq(ll x) {return x*x;}
ll isqrt(ll x) {return (ll)sqrtl(x);}
#include <geometry/closestPair.cpp>
//strict convex hull
ll naive(const vector<pt>& ps) {
ll opt = LL::INF;
for (ll i = 0; i < ssize(ps); i++) {
for (ll j = 0; j < i; j++) {
opt = min(opt, norm(ps[i] - ps[j]));
}
}
return opt;
}
void stress_test(ll range) {
ll queries = 0;
for (int tries = 0; tries < 100'000; tries++) {
int n = Random::integer<int>(2, 100);
auto ps = Random::points<ll>(n, -range, range);
auto got = shortestDist(ps);
auto expected = naive(ps);
if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
queries += n;
}
cerr << "tested random queries: " << queries << endl;
}
constexpr int N = 1'000'000;
void performance_test() {
timer t;
hash_t hash = 0;
double maxTime = 0;
vector<pt> ps;
for (int i = 0; i*i <= N; i++) {
for (int j = 0; j*j <= N; j++) {
ps.emplace_back(i, j);
}
}
t.start();
hash = shortestDist(ps);
t.stop();
maxTime = max(maxTime, t.time);
ps = Random::points<ll>(N, -1'000'000'000, 1'000'000'000);
t.reset();
t.start();
hash += shortestDist(ps);
t.stop();
maxTime = max(maxTime, t.time);
if (maxTime > 500) cerr << "too slow: " << maxTime << FAIL;
cerr << "tested performance: " << maxTime << "ms (hash: " << hash << ")" << endl;
}
int main() {
stress_test(100);
stress_test(1'000'000'000);
performance_test();
}
|
