Cod sursa(job #1916303)
Utilizator | Data | 9 martie 2017 08:58:23 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
int x,y,n,c,i,j,v[100005],k,l;
int main()
{
ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");
fin>>n>>k;
for (i=1;i<=k;++i){
fin>>c;
if (c==1){
fin>>x>>y;
v[x]=y;
}
else{
fin>>j>>l;
while(v[j]!=0)
j=v[j];
while(v[l]!=0)
l=v[l];
if(l==j)
fout<<"DA"<<endl;
else
fout<<"NU"<<endl;
}
}
return 0;
}