Cod sursa(job #1100908)

Utilizator AlexandruVVasiliu Alexandru AlexandruV Data 7 februarie 2014 17:10:37
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#include <iostream>
#include <fstream>

using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");

int n,m;
int t[100001],rg[100001];

int Cauta(int k)
{int i;
while(t[k]!=k) k=t[k];
return k;
}

void uneste(int x,int y)
{if(rg[x]>rg[y])
   t[x]=y;
else t[y]=x;

 if(rg[x]==rg[y]) rg[y]++;
}

void citire()
{int i,j,x,y,cod;

f>>n>>m;
for(i=1;i<=n;i++) {t[i]=i;rg[i]=1;}

for(i=1;i<=m;i++)
    {f>>cod>>x>>y;
     if(cod==2)
        if(Cauta(x)==Cauta(y)) {g<<"DA";g<<"\n";}
        else {g<<"NU";g<<"\n";}
    else uneste(Cauta(x),Cauta(y));
    }
}

int main()
{citire();
return 0;
}