Pagini recente » Cod sursa (job #2900388) | Cod sursa (job #3283355) | Cod sursa (job #515642) | Cod sursa (job #2603787) | Cod sursa (job #2977209)
#include<bits/stdc++.h>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int n,m,cod,x,y,h[100005],t[100005];
int rad(int x)
{int r=x;
while(t[r]!=r)
r=t[r];
while(x!=r)
{int aux=t[x];
t[x]=r; x=aux;
}
return r;
}
void unif(int r1, int r2)
{
if(h[r1]<h[r2]) t[r1]=r2;
else t[r2]=r1;
if(h[r1]==h[r2]) h[r1]++;
}
int main()
{in>>n>>m;
for(int i=1;i<=n;i++)
h[i]=1,t[i]=i;
for(int i=1;i<=m;i++)
{in>>cod>>x>>y;
int r1=rad(x),r2=rad(y);
if(cod==1) unif(x,y);
else
{
if(r1==r2) out<<"DA\n";
else out<<"NU\n";
}
}
return 0;
}