Find them, Catch them
POJ - 1703
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
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.
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 4Sample Output
Not sure yet. In different gangs. In the same gang.
题意:共有两个帮派,D后面两个数代表他们不在同一个帮派,A是询问是否在一个帮派。
思路:与食物链相似
AC代码:
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define LL long long
#define maxn 200005
using namespace std;
int p[maxn];
int find(int x){
if(p[x] == x)return x;
return p[x] = find(p[x]);
}
bool same(int x,int y)
{
return find(x)==find(y);
}
void unite(int x,int y)
{
int fx = find(x);
int fy = find(y);
if(fx!=fy)
p[fx] = fy;
}
int main()
{
int T,n,m,a,b;
char ch;
scanf("%d",&T);
while(T--){
scanf("%d %d",&n,&m);
for(int i=1;i<=2*n;++i) p[i]=i;//i属于帮派A,i+N属于帮派B
for(int i=1;i<=m;++i){
getchar();
scanf("%c %d %d",&ch,&a,&b);
if(ch == 'D'){ //此时若a属于A,则b属于B,若a属于B,则b属于A
if(!same(a,b+n)&&!same(a+n,b)){ //a:a属于A,a+n:a属于B
unite(a,b+n); //如果ab不属于同类,则a与b+n(或a+n与b则为同类),将同类相连
unite(a+n,b);
}
}
else if(ch == 'A'){
if(same(a,b)||same(a+n,b+n)) //a,b都属于帮派A或者帮派B
printf("In the same gang.\n");
else if(same(a+n,b)||same(a,b+n))
printf("In different gangs.\n");
else printf(("Not sure yet.\n"));
}
}
}
return 0;
}
用Java写会超时......我也很无奈呀......
import java.math.*;
import java.util.*;
public class Main {
static int par[] = new int [200010];
static int rank[] = new int [200010];
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
int T = cin.nextInt();
while(T-->0){
int n = cin.nextInt();
int m = cin.nextInt();
init(n);
for(int i=1;i<=m;++i){
char c = cin.next().charAt(0);
int a = cin.nextInt();
int b = cin.nextInt();
if(c=='D'){
if(!same(a,b+n)&&!same(a+n,b)){
unite(a,b+n);
unite(a+n,b);
}
}
if(c=='A'){
if(same(a,b)||same(a+n,b+n))
System.out.println("In the same gang.");
else if(same(a,b+n)||same(a+n,b))
System.out.println("In different gangs.");
else
System.out.println("Not sure yet.");
}
}
}
}
static void init(int n){
for(int i=1;i<=2*n;++i){
par[i] = i;
rank[i] = 0;
}
}
static int find(int x){
if(par[x]==x) return x;
return par[x] = find(par[x]);
}
static boolean same(int x,int y){
if(find(x)==find(y)) return true;
return false;
}
static void unite(int x,int y){
int fx = find(x);
int fy = find(y);
if(fx == fy) return;
if(rank[fx]<rank[fy])
par[fx] = fy;
else{
par[fy] = fx;
if(rank[fx] == rank[fy]) rank[fx]++;
}
}
}