Cod sursa(job #1247161)

Utilizator andi12Draghici Andrei andi12 Data 22 octombrie 2014 11:08:28
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.7 kb
#include <cstdio>

using namespace std;
int t[100005];
FILE *in,*out;
int rad(int x)
{
    if(t[x]==0)
        return x;
    t[x]=rad(t[x]);
        return t[x];
}
void gaseste(int x,int y)
{
    if(rad(x)==rad(y))
        fprintf(out,"DA\n");
    else
        fprintf(out,"NU\n");
}
void combina(int x,int y)
{
    int r1=rad(x);
    int r2=rad(y);
    t[r1]=r2;
}
int main()
{
    in=fopen("disjoint.in","r");
    out=fopen("disjoint.out","w");
    int n,m,cod,x,y,i;
    fscanf(in,"%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        fscanf(in,"%d%d%d",&cod,&x,&y);
        if(cod==1)
            combina(x,y);
        else
            gaseste(x,y);
    }
    return 0;
}