Pagini recente » Cod sursa (job #473395) | Cod sursa (job #2107192) | Cod sursa (job #1033455) | Cod sursa (job #2600229) | Cod sursa (job #1711764)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int x, y, c, n, m, i;
int tata[100005], rang[100005];
void pune(int x, int y){
//
if (rang[x] > rang[y])
tata[y] = x;
else tata[x] = y;
if (rang[x] == rang[y]) rang[y]++;
}
int cauta(int x){
//
int r, y;
for (r = x; r != tata[r]; r = tata[r]);
for (; tata[x] != x;){
y = tata[x];
tata[x] = r;
x = y;
}
return r;
}
int main(){
f >> n >> m;
for (i = 1; i <= n; i++){
tata[i] = i;
rang[i] = 1;
}
for (i = 1; i <= m; i++){
f >> c >> x >> y;
if (c == 1){
pune(cauta(x), cauta(y));
}
else if (c == 2){
if (cauta(x) == cauta(y))
g << "DA\n";
else g << "NU\n";
}
}
return 0;
}