原题链接: http://acm.hdu.edu.cn/showproblem.php?pid=3047
一:原题内容
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.
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.
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.
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
2HintHint: (PS: the 5th and 10th requests are incorrect)
二:分析理解
dis[i]保存i到根节点的距离,注意保存的是直接距离,而且pre[i]=根节点。
还有注意对300的取模。
三:AC代码
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
#define N 50005
int pre[N];
int dis[N];
int n, m;
int a, b, x;
int Find(int e)
{
if (e == pre[e]) return e;
int e_root = Find(pre[e]);
dis[e] = (dis[e] + dis[pre[e]]) % 300;
pre[e] = e_root;
return e_root;
}
bool Union(int a, int b, int x)
{
int a_root = Find(a);
int b_root = Find(b);
if (a_root == b_root)
{
if ((dis[b] - dis[a] + 300) % 300 == x)
return true;
return false;
}
pre[b_root] = a_root;
dis[b_root] = (dis[a] + x - dis[b] + 300) % 300;
return true;
}
int main()
{
while (~scanf("%d%d", &n, &m))
{
int ans = 0;
for (int i = 1; i < N; i++)
{
pre[i] = i;
dis[i] = 0;
}
while (m--)
{
scanf("%d%d%d", &a, &b, &x);
if (!Union(a, b, x))
ans++;
}
printf("%d\n", ans);
}
return 0;
}