滴水穿石,慢慢积累,总会有成果

随手记录,持之以恒

POJ 1703 Find them, Catch them (并查集扩展应用)
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;
}


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/helloiamclh/article/details/49952771
个人分类: 并查集
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

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

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭