关闭

POJ 1703 Find them, Catch them (并查集扩展应用)

170人阅读 评论(0) 收藏 举报
分类:
Find them, Catch them
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 37663   Accepted: 11612

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.

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

1
5 5
A 1 2
D 1 2
A 1 2
D 2 4
A 1 4

Sample Output

Not sure yet.
In different gangs.
In the same gang.



题意:n个人,A表示查询两个人是否在一个集团,D表示两个人不在同一个集团

思路:并查集的扩展应用,在递归过程中,对节点和其父节点之间的关系进行更新

ac代码:
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#define fab(a) (a)>0?(a):(-a)
#define LL long long
#define MAXN 100010
#define mem(x) memset(x,0,sizeof(x))
#define INF 0xfffffff 
#define PI acos(-1.0)
using namespace std;
int pri[MAXN];
int rist[MAXN];
int find(int x)
{
	int temp=pri[x];
	if(pri[x]==x)
	return x;
	pri[x]=find(pri[x]);
	rist[x]=(rist[x]+rist[temp])%2;
	return pri[x];
}

int main()
{
	int t,n,a,b,m,i;
	char s[3];
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&m);
		for(i=1;i<=n;i++)
		pri[i]=i,rist[i]=0;
		while(m--)
		{
			scanf("%s%d%d",s,&a,&b);
			int nx=find(a);
			int ny=find(b);
			if(s[0]=='D')
			{
				if(nx!=ny)
				{
					pri[ny]=nx;
					rist[ny]=(rist[a]+rist[b]+1)%2;
				}
				//printf("%d %d\n",pri[nx],pri[ny]);
			}
			else if(s[0]=='A')
			{
				//printf("%d %d\n",nx,ny);
				if(nx!=ny)
				printf("Not sure yet.\n");
				else if(rist[a]==rist[b])
				printf("In the same gang.\n");
				else
				printf("In different gangs.\n");
			}
		}
	}
	return 0;
}


0
0
查看评论
发表评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场

POJ 1703 Find them, Catch them【典型并查集:判断在不同的集合】

Find them, Catch them Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 2...
  • Cfreezhan
  • Cfreezhan
  • 2013-04-08 19:04
  • 3595

poj 1703 Find them, Catch them (分组并查集 偏移向量实现)

前段时间做了不少并查集的题目,前天又接触了一种新的类型——分组类型的并查集,通常解法就是加一个偏移量,查了很多资料看了很多的并查集相关的解释终于把向量偏移给搞明白了,不得不说这个“向量偏移的名字”起的...
  • IAccepted
  • IAccepted
  • 2014-03-14 13:29
  • 1473

【二分答案nlogn/标解O(n)】【UVA1121】Subsequence

A sequence of N positive integers (10 N , each of them less than or equal 10000, and a positive inte...
  • zy691357966
  • zy691357966
  • 2014-10-18 16:23
  • 1410

POJ-1703 find the, catch them 并查集

功夫不负有心人,改了一天,总算AC。 并查集用来表示等价类,这里的等价类是什么?是“关系可以确定”。如果A和B的关系可以确定,B和C的关系可以确定,则A,B,C之间的关系都能确定,所以该关系有传递性...
  • creativewang
  • creativewang
  • 2011-10-27 22:24
  • 384

POJ1703——Find them, Catch them 并查集应用

Find them, Catch them Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 3...
  • say_c_box
  • say_c_box
  • 2016-03-15 09:27
  • 415

[poj 1703] Find them, Catch them 并查集应用

Find them, Catch them Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 39600 ...
  • ALPS233
  • ALPS233
  • 2016-04-05 16:34
  • 486

并查集 POJ-1703 Find them, Catch them

传送门:vjudge 或者 原网址 本题与食物连相似  传送门 题目大意:警察抓捕罪犯,罪犯有两个帮派(龙帮和蛇帮。。。抓罪犯还要分帮派,难道是龙蛇混杂,龙帮不敢抓??), ...
  • lcuwb
  • lcuwb
  • 2017-07-22 14:19
  • 104

poj 1703 Find them, Catch them 并查集

《挑战》练习题,并查集基础题。
  • xc19952007
  • xc19952007
  • 2015-11-11 22:37
  • 186

POJ 1703 Find them, Catch them(种类并查集)

Find them, Catch them Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 4...
  • a88770202
  • a88770202
  • 2016-08-10 16:26
  • 187

POJ 1703 Find them, Catch them【典型并查集:判断在不同的集合】

Find them, Catch them Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 2...
  • Cfreezhan
  • Cfreezhan
  • 2013-04-08 19:04
  • 3595
    时刻记住--never give up
    人生如棋,吾愿为卒,吾行虽慢,谁曾见吾后退半步!
    个人资料
    • 访问:194887次
    • 积分:8858
    • 等级:
    • 排名:第2502名
    • 原创:723篇
    • 转载:3篇
    • 译文:0篇
    • 评论:27条