给个KDTree版本的
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <bitset>
#include <assert.h>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef set<int>::iterator ssii;
#define Cmp(a, b) memcmp(a, b, sizeof(b))
#define Cpy(a, b) memcpy(a, b, sizeof(b))
#define Set(a, v) memset(a, v, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define _forS(i, l, r) for(set<int>::iterator i = (l); i != (r); i++)
#define _rep(i, l, r) for(int i = (l); i <= (r); i++)
#define _for(i, l, r) for(int i = (l); i < (r); i++)
#define _forDown(i, l, r) for(int i = (l); i >= r; i--)
#define debug_(ch, i) printf(#ch"[%d]: %d\n", i, ch[i])
#define debug_m(mp, p) printf(#mp"[%d]: %d\n", p->first, p->second)
#define debugS(str) cout << "dbg: " << str << endl;
#define debugArr(arr, x, y) _for(i, 0, x) { _for(j, 0, y) printf("%c", arr[i][j]); printf("\n"); }
#define _forPlus(i, l, d, r) for(int i = (l); i + d < (r); i++)
#define lowbit(i) (i & (-i))
#define MPR(a, b) make_pair(a, b)
pair<int, int> crack(int n) {
int st = sqrt(n);
int fac = n / st;
while (n % st) {
st += 1;
fac = n / st;
}
return make_pair(st, fac);
}
inline ll qpow(ll a, int n) {
ll ans = 1;
for(; n; n >>= 1) {
if(n & 1) ans *= 1ll * a;
a *= a;
}
return ans;
}
template <class T>
inline bool chmax(T& a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b) {
return b == 0 ? a : gcd(b, a % b);
}
ll ksc(ll a, ll b, ll mod) {
ll ans = 0;
for(; b; b >>= 1) {
if (b & 1) ans = (ans + a) % mod;
a = (a * 2) % mod;
}
return ans;
}
ll ksm(ll a, ll b, ll mod) {
ll ans = 1 % mod;
a %= mod;
for(; b; b >>= 1) {
if (b & 1) ans = ksc(ans, a, mod);
a = ksc(a, a, mod);
}
return ans;
}
template <class T>
inline bool chmin(T& a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
bool _check(int x) {
//
return true;
}
int bsearch1(int l, int r) {
while (l < r) {
int mid = (l + r) >> 1;
if(_check(mid)) r = mid;
else l = mid + 1;
}
return l;
}
int bsearch2(int l, int r) {
while (l < r) {
int mid = (l + r + 1) >> 1;
if(_check(mid)) l = mid;
else r = mid - 1;
}
return l;
}
template<class T>
bool lexSmaller(vector<T> a, vector<T> b) {
int n = a.size(), m = b.size();
int i;
for(i = 0; i < n && i < m; i++) {
if (a[i] < b[i]) return true;
else if (b[i] < a[i]) return false;
}
return (i == n && i < m);
}
// ============================================================== //
const int maxn = (100000 + 5) << 1;
const ll inf = INT64_MAX;
const int K = 2;
int CD = 0, n;
class Node {
public:
ll x[2];
int cld[2];
bool operator< (const Node &rhs) const {
return x[CD] < rhs.x[CD];
}
} t[maxn];
int root = 0;
int build(int l, int r, int dep) {
if (l > r) return 0;
int mid = (l + r) >> 1;
CD = dep % K;
nth_element(t+l, t+mid, t+r+1);
t[mid].cld[0] = t[mid].cld[1] = 0;
if (l < mid) t[mid].cld[0] = build(l, mid-1, dep+1);
if (r > mid) t[mid].cld[1] = build(mid+1, r, dep+1);
return mid;
}
inline ll euclid(const Node &u, const Node &g) {
ll ans = 0;
_for(i, 0, K) ans += (u.x[i]-g.x[i]) * (u.x[i]-g.x[i]);
return ans;
}
ll res = inf;
void query(int u, const Node &g, int dep) {
if (!u) return;
ll dist = euclid(t[u], g);
//debug(dist);
chmin(res, dist);
int cd = dep % K;
ll delta = t[u].x[cd] - g.x[cd];
if (delta > 0) {
query(t[u].cld[0], g, dep+1);
if (delta * delta < res) query(t[u].cld[1], g, dep+1);
}
else {
query(t[u].cld[1], g, dep+1);
if (delta * delta < res) query(t[u].cld[0], g, dep+1);
}
}
void solve() {
res = inf;
_rep(i, 1, n) {
Node g;
scanf("%lld%lld", &g.x[0], &g.x[1]);
query(root, g, 0);
}
printf("%.3lf\n", sqrt(res));
}
void init() {
CD = 0;
}
int main() {
freopen("input.txt", "r", stdin);
int kase;
cin >> kase;
while (kase--) {
init();
// get data
scanf("%d", &n);
_rep(i, 1, n) {
scanf("%lld%lld", &t[i].x[0], &t[i].x[1]);
}
// build kd tree
root = build(1, n, 0);
// solve
solve();
}
}
现在WA了,大佬
感谢分享
大佬厉害