Zjnu Stadium
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6593 Accepted Submission(s): 2503
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
每次给3个数xyw,x距离y为w,询问是否合法,合法就记录,输出不合法的数量;
用并查集记录关系,对于每次询问如果两个数在同一个祖先下,查询是否合法,不在就建立关系;
用一个sum数组记录到祖先的距离,同一个祖先时有sum(y)==sum(x)+w;
不同时就给sum[y]加上sum[y1],具体看代码
#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
const int maxn = 1000010;
int f[maxn];
int sum[maxn];//当前点到当前点祖先的距离
int find(int x){
if(x != f[x]){
int pre = f[x];
f[x] = find(f[x]);
sum[x] += sum[pre];
}
return f[x];
}
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m)){
int out = 0;
for(int i = 0; i <= n; i++)
f[i] = i;
memset(sum, 0, sizeof(sum));
for(int i = 0; i < m; i++){
int x, y, w, x1, y1;
scanf("%d%d%d", &x, &y, &w);
x1 = find(x);
y1 = find(y);
if(x1 == y1){
if(sum[y] - sum[x] != w)
out++;
}else{
sum[y1] = w + sum[x] - sum[y]; //建立关系,确定与祖先的距离
f[y1] = x1;
}
}
cout<<out<<endl;
}
}