Pagini recente » Cod sursa (job #2913555) | Cod sursa (job #1932097) | Cod sursa (job #2496050) | Cod sursa (job #2782334)
#include <fstream>
using namespace std;
int tata[100005],h[100005];
int fader(int x)
{
while(x!=tata[x])
x=tata[x];
return x;
}
int unire(int x, int y)
{
if(h[x]>h[y])
tata[y]=tata[x];
else if(h[y]>h[x])
tata[x]=tata[y];
else
{
tata[y]=x;
h[x]++;
}
}
int main()
{
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int n,m,c,a,b,x,y;
cin>>n>>m;
for(int i=1;i<=n;i++)
{
h[i]=1;
tata[i]=i;
}
for(int i=0;i<m;i++)
{
cin>>c>>a>>b;
if(c==1)
{
unire(fader(a),fader(b));
}
if(c==2)
{
if(fader(a)==fader(b))
cout<<"DA"<<'\n';
else
cout<<"NU"<<'\n';
}
}
return 0;
}