Pagini recente » Cod sursa (job #1820628) | Cod sursa (job #3210330) | Cod sursa (job #783257) | Cod sursa (job #1639807) | Cod sursa (job #2061214)
#include <fstream>
#define NMAX 100002
using namespace std;
int tata[NMAX],h[NMAX],n,m;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int CautaTata(int x)
{
int aux=x;
while(tata[x]) x=tata[x];
while(tata[aux]){int aux2=tata[aux];tata[aux]=x;aux=aux2;}
return x;
}
void UnesteArbori(int x,int y)
{
x=CautaTata(x);
y=CautaTata(y);
if(h[x]>h[y]) {tata[x]=y;return;}
else if(h[x]==h[y]) h[y]++;
tata[y]=x;
}
void Query(int x,int y)
{
x=CautaTata(x);
y=CautaTata(y);
if(x==y) g<<"DA\n";
else g<<"NU\n";
}
int main()
{
f>>n>>m;
int i,t,x,y;
for(i=1;i<=n;++i) h[i]=1;
for(i=0;i<m;++i)
{
f>>t>>x>>y;
if(t-2) UnesteArbori(x,y);
else Query(x,y);
}
return 0;
}