Pagini recente » Cod sursa (job #1026053) | Cod sursa (job #1698818) | Cod sursa (job #1925680) | Cod sursa (job #1695524) | Cod sursa (job #2304041)
#include <fstream>
using namespace std;
ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");
int t[100005], x, y, i, n, m, c, rx, ry;
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;
}
for (i=1; i<=m; i++){
fin >> c >> x >> y;
rx = rad (x), ry = rad (y);
if (c == 2){
fout << (rx == ry ? "DA" : "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;
}