Pagini recente » Cod sursa (job #3001141) | Cod sursa (job #1064118) | Cod sursa (job #3002288) | Cod sursa (job #1867011) | Cod sursa (job #1745594)
#include <fstream>
using namespace std;
int n,m,i,rx,ry,t[100001],x,y,T;
int rad (int x){
while (t[x] > 0)
x = t[x];
return x;
}
ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");
int main (){
fin>>n>>m;
for (i=1;i<=n;i++)
t[i] = -1;
for (i=1;i<=m;i++){
fin>>T>>x>>y;
rx = rad (x);
ry = rad (y);
if (T == 2){
if (rx == ry)
fout<<"DA\n";
else
fout<<"NU\n";
}
else{
if (rx != ry){
if (t[rx] < t[ry]){
t[rx] += t[ry];
t[ry] = rx;
}
else{
t[ry] += t[rx];
t[rx] = ry;
}
}
}
}
return 0;
}