HDUOJ-3047 Zjinu Stadium

Zjnu Stadium

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3242    Accepted Submission(s): 1250

Problem Description

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

  
  

   
   10 10
1 2 150
3 4 200
1 5 270
2 6 200
6 5 80
4 7 150
8 9 100
4 8 50
1 7 100
9 2 100
  
  

 

Sample Output

  
  

   
   2

   
   

    
    

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

   
   
   
    
  
  

 

Source

2009 Multi-University Training Contest 14 - Host by ZJNU

 

 题意  有n个人在一个圆形的体育场排位，A,B两人之间距离为X,顺时针方向。。。。；

 思路：带权并查集的题，主要就是求节点到根节点的距离以及当分属于不同的两棵树上的节点合并时求出节点到新的根节点的距离，而判断正确的条件就是两个点在同一行（同在一棵树上）到根节点的距离的差值是否等于两个点的差值；

PS：注意方向。。。；

下面附上代码：

#include<cstdio>
#include<cstring>
#define max 210000
int pre[max],dis[max];
void AA(int n)
{
	int i;
	for(int i=1;i<=n;i++) pre[i]=i;
}
int find(int x)
{
	if(pre[x]==x) return x;
	int tem=pre[x];
	pre[x]=find(pre[x]);
	dis[x]+=dis[tem];
	return pre[x];
} 
int main()
{
	int n,m,a,b,x;
	while(scanf("%d %d",&n,&m)!=EOF)
	{
		int sum=0;
		AA(n);
		memset(dis,0,sizeof(dis));
		for(int i=1;i<=m;i++)
		{
			scanf("%d %d %d",&a,&b,&x);
			int fx=find(a),fy=find(b);
			if(fx!=fy)
			{
				pre[fy]=fx;
				dis[fy]=dis[a]+x-dis[b];
			} 
			else 
			{
				if(dis[b]-dis[a]!=x) sum++;
			}
		}
		printf("%d\n",sum);
	}
	return 0;
}