Pagini recente » Cod sursa (job #1845642) | Cod sursa (job #1541196) | Cod sursa (job #108930) | Cod sursa (job #2200970) | Cod sursa (job #2330718)
#include <bits/stdc++.h>
using namespace std;
int T[100005];
int sef(int x)
{
if(x==T[x])
return T[x];
return T[x] = sef(T[x]);
}
void join(int x, int y)
{
T[sef(y)]=sef(x);
}
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int main()
{
int n, m, cod, x, y, i;
in>>n>>m;
for(i = 1; i<=n; i++)
T[i]=i;
for(i = 1; i<=m; i++)
{
in>>cod>>x>>y;
if(cod==1)
join(x, y);
else
{
(sef(T[x])==sef(T[y]))? out<<"DA\n" :out<<"NU\n";
}
}
return 0;
}