Cod sursa(job #1405483)

Utilizator demetriad-dagpagDavid Demetriad demetriad-dagpag Data 29 martie 2015 12:04:46
Problema Paduri de multimi disjuncte Scor 100
Compilator c Status done
Runda Arhiva educationala Marime 0.83 kb
#include <stdio.h>
#include <stdlib.h>
int t[100001];
int radacina(int x)
{
    if(t[x]==0)
        return x;
    t[x]=radacina(t[x]);
    return t[x];
}
int gasire(int x,int y)
{
    int rx=radacina(x);
    int ry=radacina(y);
    return rx==ry;
}
int unificare(int x,int y)
{
    int rx=radacina(x);
    int ry=radacina(y);
    t[rx]=ry;
}
int main()
{
    int n,k,i,q,a,b;
    FILE *fin=fopen("disjoint.in","r");
    FILE *fout=fopen("disjoint.out","w");
    fscanf(fin,"%d%d",&n,&k);
    for(i=1; i<=k; i++)
    {
        fscanf(fin,"%d%d%d",&q,&a,&b);
        if(q==2){
            if(gasire(a,b)==1)
                fprintf(fout,"DA\n");
            else
                fprintf(fout,"NU\n");
        }
        else
            unificare(a,b);
    }
    fclose(fin);
    fclose(fout);

    return 0;
}