Find them,catch them(P1703)

这个转移的状态还是要注意仔细想一下，

#include<iostream>
#include<stdlib.h>
#include<math.h>
#include<stdio.h>
#include<algorithm>
#include<queue>
#include<string.h>
#include<stack>
#include<math.h>
#include<string>
#include<stdlib.h>
#include<list>
#include<vector>
#include<map>

using namespace std;

#define N 100010

int f[2*N];
char c;
int n,m;

int find(int k)
{
    int i,j;
    if (f[k]!=k)
        f[k]=find(f[k]);
    return f[k];
}

void un(int x,int y)
{
    int i,j,k;
    i=find(x);
    j=find(y);
    if (i!=j)
        f[i]=j;
}

int main()
{
    int i,j,k;
    int t;
    scanf("%d",&t);
    while (t--)
    {
        scanf("%d%d",&n,&m);
        for(i=1;i<=2*n;i++)
            f[i]=i;
        while (m--)
        {
            scanf("\n%c%d%d",&c,&i,&j);
            if (c=='A')
            {
                if (find(i)==find(j))
                    puts("In the same gang.");
                else if (find(i)==find(j+n)||find(j)==find(i+n))
                    puts("In different gangs.");
                else
                    puts("Not sure yet.");
            }
            else
            {
                un(i,j+n);
                un(j,i+n);
            }
        }
    }
}

Register Update your info Authors ranklist

Current Contest Past Contests Scheduled Contests Award Contest

jiangjiashi      Log Out Mail:1(0) Login Log      Archive

Language:

Find them, Catch them

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 20439		Accepted: 6050

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.

Source