Pagini recente » Cod sursa (job #1338892) | Cod sursa (job #2143357) | Cod sursa (job #2942049) | Cod sursa (job #1522453) | Cod sursa (job #2681349)
#include <iostream>
#include <fstream>
std::ifstream fin("disjoint.in");
std::ofstream fout("disjoint.out");
using namespace std;
int t[100020], n, m;
int main()
{
int i, j, x, y, p, q, op;
fin >> n >> m;
for (i = 1; i <= n; i++)
t[i] = i;
for (i = 1; i <= m; i++)
{
fin >> op >> x >> y;
if (op == 2)
{
if (t[x] == t[y]) fout << "DA\n";
else fout << "NU\n";
}
else
{
if (t[x] != t[y])
{
p = t[x];
q = t[y];
for (j = 1; j <= n; j++)
if (t[j] == p) t[j] = q;
}
}
}
return 0;
}