首页 > 代码库 > hdu 3047 Zjnu Stadium【带权并查集】

hdu 3047 Zjnu Stadium【带权并查集】

2024-11-27 10:20:02   203人阅读

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
分析：题意是按题目所诉A B X 就是把B放在A的位置编号+X处的位置，关键的一点就是明白如果find（A）！=find（B）
     则B的祖宗（find（B））的位置应为dis【A】+x-dis【B】，出现冲突的情况是当find（A）==find（B）时
     dis【B】！=dis【A】+x，这样就清楚了。
  1. #include<stdio.h>
  2. #include<string.h>
  3. #include<algorithm>
  4. #include<iostream>
  5. #define maxh 50000+10
  6. using namespace std;
  7. int set[maxh],dis[maxh];
  8. void init(int n)
  9. {
  10.     for(int i=0;i<=n;i++)
  11.     {
  12.         set[i]=i;
  13.         dis[i]=0;
  14.     }
  15. }
  16. int findx(int x)
  17. {
  18.     if(x==set[x])
  19.     return set[x];
  20.     int p=set[x];
  21.     set[x]=findx(set[x]);
  22.     dis[x]+=dis[p];
  23.     return set[x];
  24. }
  25. bool uniom(int x,int y,int m)
  26. {
  27.     int a=findx(x);
  28.     int b=findx(y);
  29.     if(a==b)
  30.     {
  31.         if(dis[x]+m!=dis[y])
  32.         return false;
  33.         return true;
  34.     }
  35.     else
  36.     {   
  37.         set[b]=a;
  38.         dis[b]=dis[x]+m-dis[y];
  39.         return true;
  40.     }
  41. }
  42. int main()
  43. {
  44.     int n,m;
  45.     int A,B,X;
  46.     int ans;
  47.     while(~scanf("%d%d",&n,&m))
  48.     {
  49.         init(n);
  50.         ans=0;
  51.         for(int i=0;i<m;i++)
  52.         {
  53.             scanf("%d%d%d",&A,&B,&X);
  54.             if(!uniom(A,B,X))
  55.             ans++;
  56.         }
  57.         printf("%d\n",ans);
  58.     }
  59.     return 0;
  60. }

hdu 3047 Zjnu Stadium【带权并查集】


联系
我们