Pagini recente » Istoria paginii runda/vlad_oji2 | Cod sursa (job #111067) | Cod sursa (job #809005) | Cod sursa (job #1978448) | Cod sursa (job #705916)
Cod sursa(job #705916)
#include<fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int x,y,aux,aux1,aux2,n,m,i,grad[100001],par[100001];
inline void leg()
{int aux1,aux2;
aux1 = x;
while (par[aux1] != aux1)
aux1 = par[aux1];
aux2 = y;
while (par[aux2] != aux2)
aux2 = par[aux2];
if (grad[aux1] < grad[aux2])
par[aux1] = aux2;
else
{ par[aux2] = aux1;
if (grad[aux1] == grad[aux2])
++grad[aux1];
}
}
inline void ver()
{ aux1 = x;
while (par[aux1] != aux1)
aux1 = par[aux1];
aux2 = y;
while (par[aux2] != aux2)
aux2 = par[aux2];
if (aux1 != aux2)
fout << "NU \n";
else
fout << "DA \n";
}
int main()
{ fin >> n >> m;
for (i=1;i<=n;++i)
par[i] = i;
for (i=1;i<=m;++i)
{ fin >> aux >> x >> y;
if (aux == 1)
leg();
else
ver();
}
return 0;
}