Cod sursa(job #867811)
| Utilizator | Data | 30 ianuarie 2013 10:24:32 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
int main() {
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n, m;
int *p;
fin>>n>>m;
p = new int[n+1];
for(int i=1; i<=n; i++) p[i]=i;
for(int i=1; i<=m; i++) {
int t,x,y;
fin>>t>>x>>y;
if(t==1) {
p[y]=x;
} 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;
}
