O - Zjnu Stadium
来源:互联网 发布:宜兴俊知集团招聘2016 编辑:程序博客网 时间:2024/05/23 12:47
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 101 2 1503 4 2001 5 2702 6 2006 5 804 7 1508 9 1004 8 501 7 1009 2 100
Sample Output
2
Hint
#include<stdio.h>const int N=50005;int d[N],seat[N];int n,count;int find(int x){if(x==d[x]) return x;int t=d[x];d[x]=find(d[x]);seat[x]+=seat[t]; //seat表示点的位置 return d[x];}void merge(int x,int y,int z){int fx=find(x);int fy=find(y);if(fx!=fy) {seat[fy]=seat[x]+z+seat[fy]-seat[y]; // d[fy]=fx;}else if(seat[y]!=seat[x]+z) count++;}int main(){int a,b,c,m;while(~scanf("%d%d",&n,&m)){count=0;for(int i=1;i<=n;i++){d[i]=i;seat[i]=0;}while(m--){scanf("%d%d%d",&a,&b,&c);merge(a,b,c);}printf("%d\n",count);}}
- O - Zjnu Stadium
- Zjnu Stadium
- Zjnu Stadium
- Zjnu Stadium
- HDU 3047 Zjnu Stadium
- hdu 3047 Zjnu Stadium
- hdu 3047 Zjnu Stadium
- HDU 3047 Zjnu Stadium
- hdu 3047 Zjnu Stadium
- hdu 3047:Zjnu Stadium
- HDU Zjnu Stadium
- hdu3047 Zjnu Stadium
- hdu 3047 Zjnu Stadium
- Hdoj 3047 Zjnu Stadium
- HDU3047 Zjnu Stadium
- HDU-3047-Zjnu Stadium
- hdu 3047 Zjnu Stadium
- Zjnu Stadium HDU
- 函数堆栈
- AJAX调用WCF的配置
- 泛型(generic)是C#语言2
- rqnoj-26-合唱队形
- HDU-2153
- O - Zjnu Stadium
- 黄鸿升《千分之一》荣登冠军 甜蜜温暖情寄七夕
- Kinect for windows 开发入门 四:Hello world
- Java Thread学习之二
- Java如何连接Access数据库(两种方式实例代码)
- 归并排序及其应用
- HDU4608+简单题
- HDU-2154
- Partition List