Pagini recente » Cod sursa (job #1165051) | Cod sursa (job #1790413) | Cod sursa (job #2834597) | Cod sursa (job #1196397) | Cod sursa (job #2815877)
#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
short int tata[100001];
int sef(int x)
{
if(sef(x)==x)
return x;
else
{
return tata[x]=sef(x);
}
}
int unire(int x, int y)
{
int s1=sef(x);
int s2=sef(y);
tata[y]=s1;
}
int main()
{
int n , m , i , j , x , y , tip;
cin>>n>>m;
for(i=1;i<=n;i++)
tata[i]=i;
for(i=1;i<=m;i++)
{
cin>>tip>>x>>y;
if(tip==2)
{
if(sef(x)==sef(y))
cout<<"DA"<<"/n";
else
cout<<"NU"<<"/n";
}
if(tip==1)
{
unire(x,y);
}
}
return 0;
}