poj1703find them,catch them
来源:互联网 发布:file multiple java 编辑:程序博客网 时间:2024/05/21 10:07
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u
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<string.h>using namespace std;int n,m;const int maxn=100000+5;int set[maxn+maxn];//set[d]是罪犯d所属集合int set_find(int d)//查找罪犯d所属并查集{ if(set[d]<0) return d; return set[d]=set_find(set[d]);//递归计算d所在集合}int main(){ int loop; scanf("%d",&loop); while(loop--) { scanf("%d%d",&n,&m); memset(set,-1,sizeof(set));//所有罪犯各自一个帮派 for(int i=0;i<m;i++) { int a,b; char s[5]; scanf("%s%d%d",s,&a,&b); if(s[0]=='A') { if(set_find(a)!=set_find(b)&&set_find(a)!=set_find(b+n)) printf("%s\n","Not sure yet."); else if(set_find(a)==set_find(b)) printf("%s\n","In the same gang."); else printf("%s\n","In different gangs."); } else { if(set_find(a)!=set_find(b+n)) { set[set_find(a)]=set_find(b+n); set[set_find(b)]=set_find(a+n); } } } } return 0;}
0 0
- poj1703find them,catch them
- poj1703Find them, Catch them
- poj1703find them,catch them
- poj1703Find them catch them
- 并查集(种类并查集)POJ1703Find them, Catch them解题报告
- Find them, Catch them
- BIT1062Find them, Catch them
- Find them, Catch them
- Find them, Catch them
- Find them, Catch them
- Find them, Catch them
- Find them, Catch them
- Find them, Catch them
- Find them, Catch them
- Find them, Catch them
- Find them, Catch them
- Find them, Catch them
- Find them, Catch them
- PHP中date函数月和日带0问题
- 从今天开始写博客
- linux搭建hexo博客并发布到github
- Trie树详解及其应用
- DNS服务器使用协议
- poj1703find them,catch them
- 100+经典Java面试题及答案解析
- mysql 技巧
- 安卓基本控件之ImageButton
- 小小菜之Cocos2d-x游戏开发旅程——项目实例:飞机大战(1)
- C++面试考点
- 使用spring @Scheduled注解执行定时任务
- sizeof
- javac compile java project and run