Pagini recente » Cod sursa (job #1804315) | Cod sursa (job #1867704) | Cod sursa (job #145804) | Cod sursa (job #3153913) | Cod sursa (job #1442757)
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
const int NMAX=100010;
int n,m,c,i,x,y;
int tatal[NMAX];
int query(int x)
{
int R=x;
while(R!=tatal[R]) R=tatal[R];
return R;
}
int main()
{
in>>n>>m;
for(i=1;i<=n;i++) tatal[i]=i;
for(i=1;i<=m;i++)
{
in>>c>>x>>y;
if(c==1)
{
tatal[query(x)]=query(y);
}
else
{
if(query(x)==query(y)) out<<"DA"<<'\n';
else out<<"NU"<<'\n';
}
}
return 0;
}