Pagini recente » Cod sursa (job #1303316) | Cod sursa (job #2897980) | Cod sursa (job #1127571) | Cod sursa (job #2265992) | Cod sursa (job #868639)
Cod sursa(job #868639)
#include <fstream>
#include <iostream>
using namespace std;
int main() {
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n, m;
int *p, *r;
fin>>n>>m;
p = new int[n+1];
r = new int[n+1];
for(int i=1; i<=n; i++) {p[i]=i;r[i]=1;}
for(int i=1; i<=m; i++) {
int t,x,y;
fin>>t>>x>>y;
if(t==1) {
if(r[y]>r[x]) {
int c = x;
x = y;
y = c;
}
int a = p[y];
while(a != p[a]) {
p[a] = x;
r[a] = r[x]+1;
a = p[a];
}
p[a]=x;
r[a]=r[x]+1;
} else {
int a, b;
a = p[x];
b = p[y];
while(a != p[a]) a = p[a];
while(b != p[b]) b = p[b];
if(a==b) fout<<"DA"<<endl; else fout<<"NU"<<endl;
}
}
return 0;
}