Pagini recente » Cod sursa (job #1790275) | Cod sursa (job #2711321) | Cod sursa (job #2750325) | Cod sursa (job #2320625) | Cod sursa (job #2590886)
#include <fstream>
using namespace std;
int rang[100001], tata[100001];
int tata_multime(int x)
{
if(x != tata[x])
tata[x] = tata_multime(tata[x]);
return tata[x];
}
void unire(int x, int y)
{
x = tata_multime(x);
y = tata_multime(y);
if(x != y)
{
if(rang[x] < rang[y])
{
tata[x] = y;
rang[y] = rang[y] + rang[x];
}
else
{
tata[y] = x;
rang[x] = rang[x] + rang[y];
}
}
}
int main()
{
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n, x, y, k, t, i;
f >> n >> k;
for(i = 1; i <= n; ++ i)
{
tata[i] = i;
rang[i] = 1;
}
for(i = 1; i <= k; ++ i)
{
f >> t >> x >> y;
if(t == 1) unire(x, y);
else
{
if(tata_multime(x) == tata_multime(y)) g << "DA" << '\n';
else g << "NU" << "\n";
}
}
return 0;
}