Pagini recente » Cod sursa (job #864946) | Cod sursa (job #2213994) | Cod sursa (job #827241) | Cod sursa (job #613208) | Cod sursa (job #3218536)
#include <fstream>
#define NMAX 100002
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int tata[NMAX], n, h[NMAX], m;
void uni(int x, int y)
{
if(h[x]<h[y])
{
tata[x]=y;
}
else if(h[y]<h[x])
{
tata[y]=x;
}
else //inaltimile sunt egale
{
tata[y]=x;
h[y]++;
}
}
int caut(int x)
{
///mai intai aflu rad arb din care e x
int r=x,y;
while(tata[r]!=r) r=tata[r];
do
{
y=tata[x];
tata[x]=r;
x=y;
}
while(tata[x]!=r);
return tata[x];
}
int main()
{
int i, a, b, cer;
fin>>n>>m;
for(i=1; i<=n; i++)
{
tata[i]=i; h[i]=1;
}
for(i=1; i<=m; i++)
{
fin>>cer>>a>>b;
if(cer==1)
uni(caut(a), caut(b));
else
{
if(caut(a)==caut(b))
fout<<"DA"<<"\n";
else
fout<<"NU"<<"\n";
}
}
return 0;
}