Pagini recente » Cod sursa (job #628992) | Istoria paginii runda/nimic_suspect/clasament | Cod sursa (job #735131) | Cod sursa (job #1210462) | Cod sursa (job #2011797)
#include <iostream>
#include <fstream>
using namespace std;
int tata[100003], rng[100003], v, x, y, i, n, m;
int rad(int x)
{
int T, y;
for(T=x; tata[T]!=T; T=tata[T]);
while(tata[x]!=x)
{
y=tata[x];
tata[x]=T;
x=y;
}
return T;
}
void unesc(int x, int y)
{
if(rng[x]>rng[y])
tata[y]=x;
else tata[x]=y;
if(rng[x]==rng[y]) rng[y]++;
}
int main()
{
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
fin>>n>>m;
for(i=1; i<=n; i++) tata[i]=i, rng[i]=1;
for(i=1; i<=m; i++)
{
fin>>v>>x>>y;
if(v==2)
{
if(rad(x)==rad(y)) fout<<"DA"<<"\n";
else fout<<"NU"<<"\n";
}
else if (v==1)
{
unesc(rad(x), rad(y));
}
}
return 0;
}