hdu3047 Zjnu Stadium 并查集

最新推荐文章于 2021-11-06 23:15:34 发布

原创最新推荐文章于 2021-11-06 23:15:34 发布 · 190 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

并查集及其权值专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一种使用并查集解决大型表演中观众座位安排冲突的算法。在浙江师范大学新建的体育场内，Busoninya计划举办一场大规模的戏剧表演，需要确保N个人的座位安排符合特定的距离要求，避免座位冲突。通过实现路径压缩优化的并查集，可以有效地判断每个座位请求是否正确，并计算出不正确的请求数量。

Zjnu Stadium

In 12th Zhejiang College Students Games 2007, there was a new stadium built in Zhejiang Normal University. It was a modern stadium which could hold thousands of people. The audience Seats made a circle. The total number of columns were 300 numbered 1--300, counted clockwise, we assume the number of rows were infinite.
These days, Busoniya want to hold a large-scale theatrical performance in this stadium. There will be N people go there numbered 1--N. Busoniya has Reserved several seats. To make it funny, he makes M requests for these seats: A B X, which means people numbered B must seat clockwise X distance from people numbered A. For example: A is in column 4th and X is 2, then B must in column 6th (6=4+2).
Now your task is to judge weather the request is correct or not. The rule of your judgement is easy: when a new request has conflicts against the foregoing ones then we define it as incorrect, otherwise it is correct. Please find out all the incorrect requests and count them as R.

Input

There are many test cases:
For every case:
The first line has two integer N(1<=N<=50,000), M(0<=M<=100,000),separated by a space.
Then M lines follow, each line has 3 integer A(1<=A<=N), B(1<=B<=N), X(0<=X<300) (A!=B), separated by a space.

Output

For every case:
Output R, represents the number of incorrect request.

Sample Input

Sample Output

Hint

Hint:
（PS： the 5th and 10th requests are incorrect）

思路：

并查集，重点是要把一些多的东西带进去，还是需要好好理解路径压缩啊

代码：

#include<cstdio>
using namespace std;
const int maxn = (int)5e4 + 10;
int f[maxn],dis[maxn + 350];
int find(int x)
{
	if (x != f[x])
	{
		int t = f[x];
		f[x] = find(f[x]);
		dis[x] += dis[t];
	}
	return f[x];
}
bool join(int x,int y,int z)
{
	int fx = find(x),fy = find(y);
	if (fx == fy)
	{
		if (dis[y] == dis[x] + z)
			return 1;
		return 0;
	}
	f[fy] = fx;
	dis[fy] = z + dis[x] - dis[y];
	return 1;
}
int main()
{
	int n,m,x,y,z;
	while (~scanf("%d %d",&n,&m))
	{
		for (int i = 1;i <= n;i ++)
			f[i] = i,dis[i] = 0;
		int cnt = 0;
		while (m --)
		{
			scanf("%d %d %d",&x,&y,&z);
			if (!join(x,y,z))
				cnt ++;
		}
		printf("%d\n",cnt);	
	}	
	return  0;
}