Zjnu Stadium
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 835 Accepted Submission(s): 334
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)类似食物链那题,用偏移量的思维求解,详细解析见poj 1182 食物链。AC代码:#include <iostream> #include <cstring> #include <string> #include <cstdio> #include <algorithm> #include <queue> #include <map> #include <cmath> #include <vector> #include <cstdlib> using namespace std; const int MAX=50005; int father[MAX],rank[MAX]; int Find_set(int n) { int temp; if(n==father[n]) return n; temp=father[n]; father[n]=Find_set(father[n]); rank[n]=((rank[temp]+rank[n])%300); return father[n]; } void Union(int a,int b,int x) { int ra=Find_set(a); int rb=Find_set(b); father[rb]=ra; rank[rb]=(rank[a]-rank[b]+x+300)%300; } void init() { for(int i=0; i<MAX; i++) { father[i]=i; rank[i]=0; } } int main() { int n,m,x,a,b; while(scanf("%d%d",&n,&m)!=EOF) { int cnt=0; init(); while(m--) { scanf("%d%d%d",&a,&b,&x); int ra=Find_set(a); int rb=Find_set(b); if(ra==rb) { if((rank[b]-rank[a]+300)%300!=x) cnt++; } else Union(a,b,x); } cout<<cnt<<endl; } return 0; }