Pagini recente » Cod sursa (job #360238) | Cod sursa (job #907405) | Cod sursa (job #2196828) | Cod sursa (job #1936819) | Cod sursa (job #1017343)
#include<fstream>
#define maxnm 100005
using namespace std;
ifstream fi("disjoint.in");
ofstream fo("disjoint.out");
int tata[maxnm],rang[maxnm];
int i,n,m;
int radacina(int x){
int aux,k; k=x;
while (x!=tata[x]) x=tata[x];
while (k!=x) {aux=k; k=tata[k]; tata[k]=x;}
return x;
}
void uneste(int x,int y){
if (rang[x]>rang[y]) tata[y]=x;
else tata[x]=y;
if (rang[x]==rang[y]) rang[y]++;
}
int main(void){
int oper1,x,y;
fi>>n>>m;
for(i=1;i<=n;i++) {
tata[i]=i;
rang[i]=0;
}
for(i=1;i<=m;i++) {
fi>>oper1>>x>>y;
if (oper1==1) uneste(radacina(x),radacina(y));
else {
if (radacina(x)==radacina(y)) fo<<"DA\n";
else fo<<"NU\n";
}
}
fi.close();
fo.close();
return 0;
}