Cod sursa(job #1470821)

Utilizator fluture.godlikeGafton Mihnea Alexandru fluture.godlike Data 12 august 2015 13:35:46
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.08 kb
#include <cstdio>
#include <cstring>
#define NMAX 100007
FILE *fin, *fout;
using namespace std;
int n, m, pmd[NMAX], t, a, b;
int root(int x)
{
    int rx = x;
    while(pmd[rx] >= 0)
    {
        rx = pmd[rx];
    }
    while(x!= rx)
    {
        int aux = pmd[x];
        pmd[x] = rx;
        x = aux;
    }
    return rx;
}
void unit(int x, int y)
{
    int rx = root(x), ry = root(y);
    if(pmd[rx] < pmd[ry]) {pmd[rx] += pmd[ry]; pmd[ry] = rx;}
    else {pmd[ry] += pmd[rx]; pmd[rx] = ry;}
}
bool query(int x, int y)
{
    return root(x) == root(y);
}
int main()
{
    fin = freopen("disjoint.in", "r", stdin);
    fout = freopen("disjoint.out", "w", stdout);
    scanf("%d %d", &n, &m);
    memset(pmd, -1, sizeof(pmd));
    for(int i = 1; i<= m; ++i)
    {
        scanf("%d %d %d", &t, &a, &b);
        if(t == 1)
        {
            unit(a, b);
        }
        if(t == 2)
        {
            if(query(a, b) == 1) printf("DA\n");
            else printf("NU\n");
        }
    }
    fclose(fin);
    fclose(fout);
    return 0;
}