POJ 1703 (并查集)
来源:互联网 发布:java运用领域 编辑:程序博客网 时间:2024/04/30 14:07
Find them, Catch them
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20136 Accepted: 5963
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."
简单的并查集应用。。。可我开始时想傻×了。。。。甚至想做两层并查集
实际上。。。开一个数组,存放某人的敌人就好
#include<stdio.h>#include<string.h>#define clear(a,b) memset(a,b,sizeof(a))#define maxn 200000int fa[maxn],enemy[maxn];int getfa(int a){ if (fa[a] == a) return a; else fa[a] = getfa(fa[a]); return fa[a];}int judge(int a,int b){ return getfa(a) == getfa(b);}void unite(int a,int b){ fa[getfa(b)] = getfa(a);}void work(){ int m,n,i,b,a; char ch; clear(enemy,0); scanf("%d%d",&n,&m); for(i = 1;i <= n;i++) fa[i] = i; for(i = 1;i <= m;i++) { getchar(); scanf("%c%d%d",&ch,&a,&b); if (ch == 'D') { if (enemy[a]) unite(enemy[a],b); if (enemy[b]) unite(enemy[b],a); enemy[a] = b; enemy[b] = a; } else { if (getfa(a) == getfa(enemy[b])) printf("In different gangs.\n"); else if (getfa(a) == getfa(b)) printf("In the same gang.\n"); else printf("Not sure yet.\n"); } } return ;}int main(){ int k; scanf("%d",&k); while (k--) work(); return 0;}
- POJ 1703 并查集
- poj-1703 并查集
- poj 1703 并查集
- POJ 1703 (并查集)
- poj 1703(并查集)
- POJ-1703 并查集
- POJ-1703 并查集
- POJ 1703 (并查集)
- poj 1703 并查集
- poj 1703 并查集
- poj 1703(并查集)
- POJ 1703 并查集
- POJ 1703 并查集
- POJ 1703 并查集
- 并查集 POJ 1703
- POJ 1703 并查集
- Poj 并查集
- poj并查集
- Windows7下删除假顽固IE浏览器(或空白图标)的根本方法(中毒严重)
- 大数据量,海量数据 处理方法总结
- 论坛可用的伪静态规则代码.htaccess文件
- Win7桌面图标显示不正常或者显示错误的解决方法
- Windows 7 普通管理员获取system所有权限
- POJ 1703 (并查集)
- C#、WPF下实现普通快捷键的方法
- VisualSVN Server和TotoiseSVN的配置和基本使用方法
- ASP.NET用LINQ to SQL做的用户登录程序
- Android用Ksoap2类库调用.Net(C#)WebService类的实现
- LINQ查询返回DataTable类型
- poj 1790 Base Numbers(dp)
- 通过ksoap2访问.NET Webservice 的数据库
- milestone等系列android手机无法adb下使用sqlite3问题