Pagini recente » Cod sursa (job #710010) | Cod sursa (job #1876115) | Cod sursa (job #585571) | Cod sursa (job #1804760) | Cod sursa (job #2304034)
#include <fstream>
using namespace std;
ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");
int n, m, v[100005], x, y, rx, ry, t;
int rad(int p){
while(v[p] > 0){
p = v[p];
}
return p;
}
int main()
{
fin>>n>>m;
for(int i = 1; i <= n; i++){
v[i] = -1;
}
for(int 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(v[rx] < v[ry]){
v[rx] += v[ry];
v[ry] = rx;
}
else{
v[ry] += v[rx];
v[rx] = ry;
}
}
}
}
return 0;
}