首页 > 代码库 > (并查集) poj 1703
(并查集) poj 1703
Find them, Catch them
| Time Limit: 1000MS | Memory Limit: 10000K | |
| Total Submissions: 33284 | Accepted: 10258 |
Description
The police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify which gang a criminal belongs to. The present question is, given two criminals; do they belong to a same clan? You must give your judgment based on incomplete information. (Since the gangsters are always acting secretly.)
Assume N (N <= 10^5) criminals are currently in Tadu City, numbered from 1 to N. And of course, at least one of them belongs to Gang Dragon, and the same for Gang Snake. You will be given M (M <= 10^5) messages in sequence, which are in the following two kinds:
1. D [a] [b]
where [a] and [b] are the numbers of two criminals, and they belong to different gangs.
2. A [a] [b]
where [a] and [b] are the numbers of two criminals. This requires you to decide whether a and b belong to a same gang.
Assume N (N <= 10^5) criminals are currently in Tadu City, numbered from 1 to N. And of course, at least one of them belongs to Gang Dragon, and the same for Gang Snake. You will be given M (M <= 10^5) messages in sequence, which are in the following two kinds:
1. D [a] [b]
where [a] and [b] are the numbers of two criminals, and they belong to different gangs.
2. A [a] [b]
where [a] and [b] are the numbers of two criminals. This requires you to decide whether a and b belong to a same gang.
Input
The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. Each test case begins with a line with two integers N and M, followed by M lines each containing one message as described above.
Output
For each message "A [a] [b]" in each case, your program should give the judgment based on the information got before. The answers might be one of "In the same gang.", "In different gangs." and "Not sure yet."
Sample Input
15 5A 1 2D 1 2A 1 2D 2 4A 1 4
Sample Output
Not sure yet.In different gangs.In the same gang.
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<cstdlib>#include<algorithm>using namespace std;int tt,n,m,fa[100010],a[100010];char s[5];int find(int x){ return x==fa[x]?x:fa[x]=find(fa[x]);}void Union(int x,int y){ int fx,fy; fx=find(x),fy=find(y); if(fx!=fy) fa[fx]=fy;}int main(){ int x,y; scanf("%d",&tt); while(tt--) { memset(a,0,sizeof(a)); scanf("%d%d",&n,&m); for(int i=0;i<=n;i++) fa[i]=i; for(int i=1;i<=m;i++) { scanf("%s",s); if(s[0]==‘D‘) { scanf("%d%d",&x,&y); if(a[x]==0) { a[x]=y; } else { Union(a[x],y); } if(a[y]==0) { a[y]=x; } else { Union(a[y],x); } } else if(s[0]==‘A‘) { scanf("%d%d",&x,&y); int fx,fy; fx=find(x),fy=find(y); if(fx==fy) { printf("In the same gang.\n"); } else if(fx==find(a[y])) { printf("In different gangs.\n"); } else { printf("Not sure yet.\n"); } } } } return 0;}
(并查集) poj 1703
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。