Pagini recente » Cod sursa (job #580752) | Cod sursa (job #1368238) | Cod sursa (job #1432937) | Cod sursa (job #914518) | Cod sursa (job #1927771)
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n, m, t[100001], rang[100001];
int gaseste(int x)
{
int r, aux;
r=x;
while(t[r]!=r)
r=t[r];
while(t[x]!=x)
{
aux=t[x];
t[x]=r;
x=aux;
}
return r;
}
void uneste(int x, int y)
{
if(rang[y]<rang[x])
t[y]=x;
else t[x]=y;
if(rang[x]==rang[y])
rang[y]++;
}
int main()
{
int i, op, x, y;
fin>>n>>m;
for(i=1; i<=n; i++)
{
t[i]=i;
rang[i]=i;
}
for(i=1; i<=m; i++)
{
fin>>op>>x>>y;
if(op==1)
uneste(gaseste(x), gaseste(y));
else if(gaseste(x)==gaseste(y))
fout<<"DA\n";
else fout<<"NU\n";
}
fin.close();
fout.close();
return 0;
}