Cod sursa(job #2495497)

Utilizator anisca22Ana Baltaretu anisca22 Data 19 noiembrie 2019 15:47:41
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.83 kb
#include <bits/stdc++.h>
#define NMAX 100005

using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

int N, M;
int parent[NMAX];

int _parent(int nod)
{
    if (nod == parent[nod])
        return nod;
    return parent[nod] = _parent(parent[nod]);
}

void uniteSets(int x, int y)
{
    int px = _parent(x);
    int py = _parent(y);
    parent[px] = py;
}

int main()
{
    fin >> N >> M;
    for (int i = 1; i <= N; i++)
        parent[i] = i;

    for (int i = 1; i <= M; i++)
    {
        int type, x, y;
        fin >> type >> x >> y;
        if (type == 1)
        {
            uniteSets(x, y);
        }
        else
        {
            if (_parent(x) == _parent(y))
                fout << "DA\n";
            else fout << "NU\n";
        }
    }
    return 0;
}