Pagini recente » Cod sursa (job #941550) | Cod sursa (job #2166821) | Cod sursa (job #1074864) | Cod sursa (job #536329) | Cod sursa (job #1100908)
#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;
}