Pagini recente » Cod sursa (job #2546222) | Cod sursa (job #651811) | Cod sursa (job #1429389) | Cod sursa (job #1044611) | Cod sursa (job #2507420)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int Tata[100001], Rang[100001];
int n, m;
int Gaseste_Radacina(int x)
{ int R,y;
R=x;
while(Tata[R]!=R)
{ R=Tata[R];
}
//Compresia Drumurilor
while(Tata[x]!=x)
{ y=Tata[x];
Tata[x]=R;
x=y;
}
return R;
}
inline void Uneste_arbori(int x, int y)
{ if(Rang[x]>=Rang[y])
Tata[y]=x;
else Tata[x]=y;
if(Rang[x]==Rang[y]) Rang[x]++;
}
int main()
{int i,op,x,y;
f>>n>>m;
for(i=1;i<=n;i++)
{ Tata[i]=i;
Rang[i]=1;
}
for(i=1;i<=m;i++)
{ f>>op>>x>>y;
if(op==1)
{ int R1, R2;
R1=Gaseste_Radacina(x); R2=Gaseste_Radacina(y);
if(R1!=R2)
Uneste_arbori(R1, R2);
}
else { if(Gaseste_Radacina(x)==Gaseste_Radacina(y))
g<<"DA"<<'\n';
else g<<"NU"<<'\n';
}
}
f.close();
g.close();
return 0;
}