通过分治的剪枝,O(n2)的算法运行时间竟然接近O(n*lgn)???
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int
using namespace std;
struct Node {
double x, y;
int b;
}a[200010];
bool cmpx(const Node&a, const Node&b) {
return a.x < b.x;
}
bool cmpy(int i, int j) {
return a[i].y < a[j].y;
}
double dis(int i, int j) {
return sqrt((a[i].x - a[j].x)*(a[i].x - a[j].x) + (a[i].y - a[j].y)*(a[i].y - a[j].y));
}
int ls[200010];
double solve(int l, int r) {
if (l >= r)return (double)1e20;
if (l + 1 == r)
if (a[l].b != a[r].b)return dis(l, r);
else return (double)1e20;
int mid = (l + r) / 2, cnt = 0;
double ans = min(solve(l, mid), solve(mid + 1, r));
for (int i = l; i <= r; i++)
if (abs(a[i].x - a[mid].x) <= ans)ls[++cnt] = i;
sort(ls+1, ls + cnt+1, cmpy);
for (int i = 1; i <= cnt; i++) {
for (int j = i + 1; j <= cnt; j++) {
if (1.0*a[ls[j]].y - a[ls[i]].y > ans)break;
if (a[ls[i]].b != a[ls[j]].b&&dis(ls[i], ls[j])<ans)
ans = dis(ls[i], ls[j]);
}
}
return ans;
}
int t, n;
int main() {
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%lf%lf", &a[i].x, &a[i].y), a[i].b = 0;
for (int i = n+1; i <= n * 2; i++)
scanf("%lf%lf", &a[i].x, &a[i].y), a[i].b = 1;
n *= 2;
sort(a+1, a + n+1, cmpx);
printf("%.3lf\n", solve(1, n));
}
}