Cod sursa(job #3296874)

Utilizator 0021592Grecu rares 0021592 Data 18 mai 2025 10:56:39
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.68 kb
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int n, m, v[100010], i, j, x, y, cer;
int fnd(int k)
{
    if (k == v[k])
        return k;
    v[k] = fnd(v[k]);
    return v[k];
}
void unite(int x, int y)
{
    int tx = fnd(x);
    int ty = fnd(y);
    v[tx] = ty;
}
int main()
{
    in >> n >> m;
    for (i = 1; i <= n; i++)
        v[i] = i;
    for (i = 1; i <= m; i++)
    {
        in >> cer >> x >> y;
        if (cer == 1)
            unite(x, y);
        else
        {
            if (fnd(x) == fnd(y))
                out << "DA\n";
            else
                out << "NU\n";
        }
    }
}