Pagini recente » Cod sursa (job #196705) | Borderou de evaluare (job #2158624) | Monitorul de evaluare | Istoria paginii runda/winner18.1 | Cod sursa (job #2571412)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int i,j,x,y,aux,p,t[100010],m,n;
int dettata(int x)
{
while(t[x]!=x)
{
x=t[x];
}
return x;
}
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
{
t[i]=i;
}
for(i=1;i<=m;i++)
{
fin>>p>>x>>y;
if(p==1)
{
t[dettata(x)]=t[dettata(y)];
}
else
{
if(dettata(x)==dettata(y))
{
fout<<"DA"<<'\n';
}
else
{
fout<<"NU"<<'\n';
}
}
}
return 0;
}