HDU 3047 并查集
来源:互联网 发布:杨振宁 国籍 知乎 编辑:程序博客网 时间:2024/05/17 02:03
Zjnu Stadium
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 101 2 1503 4 2001 5 2702 6 2006 5 804 7 1508 9 1004 8 501 7 1009 2 100
Sample Output
2HintHint:(PS: the 5th and 10th requests are incorrect)
其实不是很理解..
#include <iostream>using namespace std;int p[1111111],dis[1111111];int cnt;int find(int x){ if(x==p[x])return x; int aa=p[x]; p[x]=find(p[x]); dis[x]+=dis[aa]; return p[x];}void merge(int a,int b,int c){ int x=find(a),y=find(b); if(x==y&&dis[b]-dis[a]!=c) cnt++; if(x!=y) { p[y]=x; dis[y]=dis[a]+c-dis[b]; }}int main(){ int n,m,i,j,k,a,b,c; while(~scanf("%d%d",&n,&m)) { cnt=0; memset(dis,0,sizeof(dis)); for(i=1;i<=n;i++) p[i]=i,dis[i]=0; while(m--) { scanf("%d%d%d",&a,&b,&c); merge(a,b,c); } printf("%d\n",cnt); } return 0;}
- HDU 3047 并查集
- HDU 3047 Zjnu Stadium - 并查集
- hdu 3047 带权并查集
- HDU 3047 带权并查集
- HDU 3047 带权并查集
- HDU 3047 Zjnu Stadium [并查集]
- hdu 3047 带权并查集
- hdu 3047 (带权并查集)@
- HDU 3047 带权并查集
- hdu 3047 带权并查集
- HDU 3371 并查集
- HDU 2473 并查集
- hdu 1116 并查集
- HDU 1856 并查集
- HDU 1598 并查集
- HDU-1232 并查集
- 【并查集】hdu 2818
- hdu 1232 并查集
- win7 x64安装oracle 10g x64的一些要点
- (step3.2.2)hdu 1087(Super Jumping! Jumping! Jumping!——简单DP)
- MongoDB自学笔记8--- 3.3 MongoDB Shell简介及简单使用
- timus 1572. Yekaterinozavodsk Great Well URAL 解题报告
- SQL 2005 完全卸载
- HDU 3047 并查集
- Unity3D性能优化之合并网格
- 题目1522:包含min函数的栈-九度
- 数据绑定时出现"这将导致集合中的两个绑定绑定到同一个属性"错误.
- LeetCode-Same Tree
- ids for this class must be manually assigned before calling save()
- IP数据报格式(网络层简介)
- SQL 2005 完全卸载
- POJ 2926 Requirements【最远曼哈顿距离】