Pagini recente » Cod sursa (job #9525) | Cod sursa (job #2185346) | Cod sursa (job #3234849) | Cod sursa (job #932757) | Cod sursa (job #2717206)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int n,m,t[100005],cod,x,y;
int tata(int nod)
{
if(t[nod]==nod)return nod;
return (t[nod]=tata(t[nod]));
}
void unire(int a,int b)
{
t[tata(a)]=tata(b);
}
int main()
{
in>>n>>m;
for(int i=1;i<=n;i++)
{
t[i]=i;
}
for(int i=1;i<=m;i++)
{
in>>cod>>x>>y;
if(cod==1)
{
unire(x,y);
}
else
{
if(tata(x)==tata(y))
{
out<<"DA";
}
else out<<"NU";
out<<'\n';
}
}
return 0;
}