Pagini recente » Cod sursa (job #1985314) | Cod sursa (job #652844) | Cod sursa (job #1936299) | Cod sursa (job #1999101) | Cod sursa (job #1933189)
#include <fstream>
using namespace std;
ifstream fi("disjoint.in");
ofstream fo("disjoint.out");
const int dim = 100001;
int n,m,op,t[dim],x,y;
int radacina (int x)
{
int r=x,j;
while(t[r]!=0) {r=t[r];}
while(t[x]!=0) {j=t[x];t[x]=r;x=j;}
return r;
}
int main()
{
fi>>n>>m;
for(int i = 1 ; i<=m ; i++)
{
fi>>op>>x>>y;
if (op==1)
t[radacina(y)]=radacina(x);
if (op==2)
if(radacina(x)==radacina(y)) fo<<"DA"<<'\n';
else fo<<"NU"<<'\n';
}
return 0;
}