POJ-1182

最新推荐文章于 2020-03-02 20:50:18 发布

心之痕

最新推荐文章于 2020-03-02 20:50:18 发布

阅读量399

点赞数

分类专栏：并查集 POJ 文章标签： POJ

本文链接：https://blog.csdn.net/xhldtc/article/details/38962247

版权

POJ 同时被 2 个专栏收录

17 篇文章 0 订阅

订阅专栏

并查集

1 篇文章 0 订阅

订阅专栏

一道并查集，依然是书上的思路。。有点巧妙的

#include<cstdio>
#include<cstring>

using namespace std;

namespace
{
	const int MAX_N = 3 * 50000 + 1;
	int *p = new int[MAX_N];
	int *rank = new int[MAX_N];

	int find_set(int x)
	{
		if (x != p[x])
			p[x] = find_set(p[x]);
		return p[x];
	}

	void link(int x, int y)
	{
		if (rank[x] > rank[y])
			p[y] = x;
		else
		{
			p[x] = y;
			if (rank[x] == rank[y])
				rank[y]++;
		}
	}

	void union_set(int x, int y)
	{
		link(find_set(x), find_set(y));
	}

	bool same_set(int x, int y)
	{
		if (x == y)
			return true;
		return find_set(x) == find_set(y);
	}
}

int main()
{
	int N, K;
	scanf("%d %d", &N, &K);
	int res = 0, d, x, y;
	for (int i = 1; i < MAX_N; i++)
		p[i] = i;
	memset(rank, 0, MAX_N * sizeof(int));
	while (K--)
	{
		scanf("%d %d %d", &d, &x, &y);
		if (x <= 0 || x > N || y <= 0 || y > N)
			res++;
		else if (d == 1)
		{
			if (same_set(x, y + N) || same_set(x, y + 2 * N))
				res++;
			else
			{
				union_set(x, y);
				union_set(x + N, y + N);
				union_set(x + 2 * N, y + 2 * N);
			}
		}
		else
		{
			if (x == y || same_set(x, y) || same_set(x, y + 2 * N))
				res++;
			else
			{
				union_set(x, y + N);
				union_set(x + N, y + 2 * N);
				union_set(x + 2 * N, y);
			}
		}
	}
	printf("%d\n", res);
	return 0;
}