space amp number ati you min AI not 成了

Find them, Catch them

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 49640		Accepted: 15255

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*3，結果當N最大的時候N*3超過了maxn，然後就一直RE，絕望。用的並查集的模板

#include<iostream>
#include<cstdio>
using namespace std;
#define maxn 100000*2+500
int criminals[maxn];
int Rank[maxn];
 
int N,M;
//初始化
void init()
{
    for(int i=0;i<N*2;i++)
    {
        criminals[i] = i;
        Rank[i] = 0;
    }
}
//查樹根
int findRoot(int x)
{
    if(criminals[x] == x) return x;
    return criminals[x] = findRoot(criminals[x]);
}
//查是否相同
bool same(int x,int y)
{
    x = findRoot(x);
    y = findRoot(y);
    return x == y;
}
//合並

void united(int x,int y)
{
    x = findRoot(x);
    y = findRoot(y);
    if(x == y) return ;
    if(Rank[x] < Rank[y])
    {
        criminals[x] = y;
    }else{
        criminals[y] = x;
        if(Rank[x] == Rank[y])
            Rank[x]++;
    }
}

int main()
{
    int T;
    char fu;
    int x,y;
    cin>>T;
    for(int i=0;i<T;i++)
    {
        scanf("%d%d",&N,&M);
        getchar();
        init();
        for(int j=0;j<M;j++)
        {
            scanf("%c%d%d",&fu,&x,&y);
            getchar();
            if(fu==‘A‘)
            {
                if(same(x,y+N)||same(x+N,y)) printf("In different gangs.\n");
                else if(same(x+N,y+N)||same(x,y)) printf("In the same gang.\n");
                else{
                    printf("Not sure yet.\n");
                }
            }else{
                united(x,y+N);
                united(x+N,y);
            }
        }
    }
    return 0;
}

poj1703-並查集