Cod sursa(job #2304045)
| Utilizator | Data | 17 decembrie 2018 14:07:32 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.87 kb |
#include<fstream>
#include<cstring>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,rx,ry,op,x,y;
int t[100010];
int rad(int x){
while(t[x]>0){
x=t[x];
}
return x;
}
int main(){
fin>>n>>m;
for(int i=1;i<=n;i++)
t[i]=-1;
while(m!=0){
fin>>op>>x>>y;
if(op==1){
rx=rad(x);
ry=rad(y);
if(rx!=ry){
if(t[rx]<t[ry]){
t[rx]+=t[ry];
t[ry]=rx;
}
else{
t[ry]+=t[rx];
t[rx]=ry;
}
}
}
else{
if(rad(x)==rad(y))
fout<<"DA"<<"\n";
else
fout<<"NU"<<"\n";
}
m--;
}
return 0;
}
