uva 10158

并查集

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
#include <string>
#include <cstring>
#include <algorithm>
#include <iostream>
#define maxn 20010
#define INF 0x7fffffff
#define inf 10000000
#define MOD 1000000007
#define ull unsigned long long
#define ll long long
using namespace std;

int f[maxn];

int findd(int x)
{
    return f[x] == x ? x : f[x] = findd(f[x]);
}

void init()
{
    for(int i = 0; i < maxn; ++ i) f[i] = i;
}

int main()
{
    int n;
    while(scanf("%d", &n) == 1)
    {
        init();
        int x, y, c;
        while(scanf("%d%d%d", &c, &x, &y) == 3 && x+y+c)
        {
            int q1 = findd(x), q2 = findd(x+n), q3 = findd(y), q4 = findd(y+n);
            if(c == 1)
            {
                if(q1 == q4) puts("-1");
                else f[q1] = q3, f[q2] = q4;
            }
            else if(c == 2)
            {
                if(q1 == q3) puts("-1");
                else f[q1] = q4, f[q2] = q3;
            }
            else if(c == 3)
            {
                if(q1 == q3) puts("1");
                else puts("0");
            }
            else
            {
                if(q1 == q4) puts("1");
                else puts("0");
            }
        }
    }
    return 0;
}