Find them, Catch them
来源:互联网 发布:迅雷赚钱宝 监控软件 编辑:程序博客网 时间:2024/04/28 19:20
Find them, Catch them
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 31132 Accepted: 9600
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.
Source
POJ Monthly--2004.07.18
代码:
#include <iostream>#include <cstring>#include <cstdio>using namespace std;const int maxn=100000+5;int n,m;int set[maxn+maxn];int set_find(int d){if(set[d]<0)return d;return set[d]=set_find(set[d]);}int main(){int loop;cin>>loop;while(loop--){scanf("%d%d",&n,&m);char s[5];int a,b,i,j;memset(set,-1,sizeof(set));for(i=0;i<m;i++){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.");elseif(set_find(a)==set_find(b))printf("%s\n","In the same gang.");elseprintf("%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
- 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
- Find them, Catch them
- pku1703 Find them, Catch them
- PKU1703 find them catch them
- Find them,catch them(P1703)
- poj1703 - Find them, Catch them
- POJ1703 Find them, Catch them
- poj1703 Find them, Catch them
- scala学习四 scala中的特质
- GCC头文件及库文件路径的配置
- HDU 1254——推箱子
- Java 查看java字节码(有图)
- MATLAB支持的几种图像文件格式
- Find them, Catch them
- 字典树
- HDU1042 高精度阶乘
- Unix中init的工作__处女篇博客
- vlc-android源码编译
- 生抽和老抽的区别
- poj-3321 Apple Tree(树状数组)
- 杭电ACM2052Picture(画图)----20140801
- hdoj.2071 Max Num 20140801