Pagini recente » Cod sursa (job #1096588) | Cod sursa (job #244637) | Cod sursa (job #1836757) | Cod sursa (job #1089690) | Cod sursa (job #2488821)
#include <fstream>
using namespace std;
ifstream fin ( "disjoint.in" );
ofstream fout( "disjoint.out" );
int t[100009];
int n,m,op,rx,ry,x,y,i;
int rad ( int x) {
while ( t[x] > 0 )
x = t[x];
return x;
}
int main() {
fin>>n>>m;
for ( i=1; i <= n; i++ )
t[i] = -1;
while (m--) {
fin>>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 ) fout<<"DA"<<"\n";
else fout<<"NU"<<"\n";
}
return 0;
}