Cod sursa(job #2573972)
Utilizator | Ana Toader anamariatoader | Data | 5 martie 2020 19:48:56 |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.85 kb |
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,i,t,x,y,X,Y,tata[100005];
int parinte(int nod){
while(tata[nod]>0)
nod=tata[nod];
return nod;
}
int main(){
fin>>n>>m;
for(i=1;i<=n;i++)
tata[i]=-1;
for(i=1;i<=m;i++){
fin>>t>>X>>Y;
x=parinte(X);
y=parinte(Y);
if(t==1){
if(x!=y){
if(tata[x]<tata[y]){
tata[x]+=tata[y];
tata[y]=x;
}
else{
tata[y]+=tata[x];
tata[x]=y;
}
}
}
else{
if(x==y)
fout<<"DA"<<'\n';
else
fout<<"NU"<<'\n';
}
}
return 0;
}