Pagini recente » Cod sursa (job #2058005) | Cod sursa (job #113470) | Cod sursa (job #1017748) | Cod sursa (job #981006) | Cod sursa (job #2487906)
#include <fstream>
#define f in
#define g out
using namespace std;
ifstream in ( "disjoint.in" );
ofstream out( "disjoint.out" );
int n, m, op, rx, ry, x, y, i;
int t[100009];
int rad ( int x) {
while ( t[x] > 0 )
x = t[x];
return x;
}
int main() {
f>>n>>m;
for ( i=1; i <= n; i++ )
t[i] = -1;
for ( ; m--; ){
f>>op>>x>>y;
rx = rad(x);
ry = rad(y);
if ( op == 1 ){
if ( t[rx] < t[ry] ){
t[rx] += t[ry];
t[ry] = rx;
} else {
t[ry] += t[rx];
t[rx] = ry;
}
} else
if ( rx == ry )
g<<"DA\n";
else g<<"NU\n";
}
return 0;
}