Pagini recente » Cod sursa (job #2233928) | Cod sursa (job #1648856) | Cod sursa (job #2654833) | Cod sursa (job #1327985) | Cod sursa (job #1450139)
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int i,m,n,T[100010],A[100010],B[100010],x,y,a,b,c;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
T[i]=i;
for(;m;m--)
{
f>>c>>x>>y;
for(a=0;;x=T[x]){A[++a]=x;if(T[x]==x)break;}
for(b=0;;y=T[y]){B[++b]=y;if(T[y]==y)break;}
for(i=1;i<=a;i++)T[A[i]]=x;
for(i=1;i<=b;i++)T[B[i]]=y;
if(c==1)T[x]=y;
else if(x==y)g<<"DA\n";
else g<<"NU\n";
}
return 0;
}