【数据结构 并查集】luogu_2449 矩形

题意

给出几块，如果两个块有部分重合就把它们看成同一个块，求一共有多少个块。

思路

并查集判断矩形所属的块，$O(N^2)$并块，最后扫一下还剩多少块。

代码

#include<cstdio>

int n, ans;
int x_1[7001], x_2[7001], y_1[7001], y_2[7001], fa[7001];

int find(int x) {
	return fa[x] = fa[x] != x ? find(fa[x]) : x;
}

int check(int a, int b) {
	return (!(x_1[b] > x_2[a] || x_2[b] < x_1[a] || y_2[b] < y_1[a] || y_1[b] > y_2[a] || (x_1[b] == x_2[a] && y_1[b] == y_2[a]) || (x_1[b] == x_2[a] && y_2[b] == y_1[a]) || (x_2[b] == x_1[a] && y_2[b] == y_1[a]) || (x_2[b] == x_1[a] && y_1[b] == y_2[a])));
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%d %d %d %d", &x_1[i], &y_1[i], &x_2[i], &y_2[i]);
		fa[i] = i;
	}
	for (int i = 1; i < n; i++)
		for (int j = i + 1; j <= n; j++) {
			int f1 = find(i), f2 = find(j);
			if (f1 == f2 || (!check(i, j) && !check(j, i))) continue;
			fa[f1] = f2;
		}
	for (int i = 1; i <= n; i++)
		ans += fa[i] == i;
	printf("%d", ans);
}