Pagini recente » Cod sursa (job #1949033) | Cod sursa (job #2738314) | Cod sursa (job #3219495) | Cod sursa (job #1432928) | Cod sursa (job #1442758)
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int t[100001];
int query(int x)
{
int r=x;
while(r!=t[r]) r=t[r];
return r;
}
int main()
{
int i,n,m,c,x,y;
in>>n>>m;
for(i=1;i<=n;i++)
t[i]=i;
for(i=1;i<=m;i++)
{
in>>c>>x>>y;
if(c==1) t[query(x)]=query(y);
else if(query(x)==query(y)) out<<"DA"<<'\n';
else out<<"NU"<<'\n';
}
}