Pagini recente » Istoria paginii runda/k/clasament | Cod sursa (job #2499486) | Cod sursa (job #1971037) | Cod sursa (job #2154646) | Cod sursa (job #3154099)
#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int tt[100001],v[100001];
int sef(int x)
{
if(tt[x]==x)
return x;
else
return tt[x]=sef(tt[x]);
}
void unire(int x, int y)
{
x=sef(x);
y=sef(y);
if(x==y)
return;
if(v[x]<v[y])
swap(x,y);
tt[y]=x;
v[x]+=v[y];
}
int main()
{
int n,m,i,c,x,y;
cin>>n>>m;
for(i=1;i<=n;i++)
{
tt[i]=i;
v[i]=1;
}
for(i=1;i<=m;i++)
{
cin>>c;
if(c==1)
{
cin>>x>>y;
unire(x,y);
}
else
if(c==2)
{
cin>>x>>y;
if(sef(x)==sef(y))
cout<<"DA"<<'\n';
else
cout<<"NU"<<'\n';
}
}
return 0;
}