POJ3714 Raid

#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;

const int maxn = 0x3f3f3f3f;

struct node {
	int x, y;
	bool kind;
}a[1000005];

bool cmp(node A, node B) {
	if (A.x != B.x)
		return A.x < B.x;
	return A.y < B.y;
}

double dis(int i, int j) {
	return sqrt((double)(a[i].x - a[j].x) * (double)(a[i].x - a[j].x) + (double)(a[i].y - a[j].y) * (double)(a[i].y - a[j].y));
}

double dichotomy(int l, int r) {
	if (l == r) return maxn;
	int mid = (l + r) >> 1;
	double ans = min(dichotomy(l, mid), dichotomy(mid + 1, r));
	for (int i = mid;i >= l;i--) {
		if (a[mid].x - a[i].x > ans) break;
		for (int j = mid + 1;j <= r;j++) {
			if (a[j].x - a[i].x > ans) break;
			if (a[i].kind != a[j].kind)
				ans = min(ans, dis(i, j));
		}
	}
	return ans;
}

int main() {
	int T;
	cin >> T;
	while (T--) {
		int n;
		cin >> n;
		memset(a, 0, sizeof(a));
		for (int i = 1;i <= n;i++) {
			cin >> a[i].x >> a[i].y;
			a[i].kind = 0;
		}
		for (int i = n + 1;i <= 2 * n;i++) {
			cin >> a[i].x >> a[i].y;
			a[i].kind = 1;
		}
		sort(a + 1, a + 2 * n + 1, cmp);
		printf("%.3lf\n", dichotomy(1, 2 * n));
	}
	return 0;
}