P1991 无线通讯网(二分+并查集)

无线通讯网 - 洛谷https://www.luogu.com.cn/problem/P1991二分答案然后看连通块是否小于等于卫星电话，要是可以得话说明mid还可以再小一些，大了就要更大一些才行，然后因为精度问题循环个100遍就行

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 2000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)

int s, p;
int x[10005], y[100005];
int pre[MAXN];
void init(int n) {
	for (int i = 1; i <= n; i++) {
		pre[i] = i;
	}
}

int find(int x) {
	if (pre[x] == x) {
		return x;
	}
	return pre[x] = find(pre[x]);
}

void unite(int x, int y) {
	x = find(x);
	y = find(y);
	pre[x] = y;
}

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

bool judge(double mid) {
	init(p);
	for (int i = 1; i <= p; i++) {
		for (int j = 1; j <= p; j++) {
			if (i != j) {
				if (dis (i, j) <= mid * mid) {
					unite(i, j);
				}
			}
		}
	}
	int cnt = 0;
	for (int i = 1; i <= p; i++) {
		if (pre[i] == i) {
			cnt++;
		}
	}
	if (cnt <= s) {
		return false;
	}
	return true;
}

int main() {
	scanf("%d %d", &s, &p);
	for (int i = 1; i <= p; i++) {
		scanf("%d %d", x + i, y + i);
	}
	double l = 0, r = (double)INF;
	for (int i = 1; i <= 100; i++) {
		double mid = (l + r) / 2;
		if (judge(mid)) {
			l = mid;
		} else {
			r = mid;
		}
	}
	printf("%.2lf", r);
	return 0;
}