Mai intai trebuie sa te autentifici.

Cod sursa(job #2959076)

Utilizator BuzatuCalinBuzatu Calin BuzatuCalin Data 29 decembrie 2022 19:23:34
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.16 kb
#include <iostream>
#include <fstream>
using namespace std;
const int NMAX = 1e6 + 1;
int t[NMAX], rang[NMAX], n, m, op;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
void uneste(int x, int y)
{
    if (rang[x] > rang[y])
    {
        t[y] = x;
    }
    else
    {
        t[x] = y;
        if (rang[x] == rang[y])
        {
            rang[y] ++;
        }
    }
}
int gaseste_multime(int x)
{
    if (x != t[x])
    {
        t[x] = gaseste_multime(t[x]);
    }
    return t[x];
}
void formeaza_multime(int x)
{
    t[x] = x;
    rang[x] = 0;
}
void reuneste(int x, int y)
{
    uneste(gaseste_multime(x), gaseste_multime(y));
}
int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        formeaza_multime(i);
    }
    int x, y;
    while (m--)
    {
        fin >> op >> x >> y;
        if (op == 1)
        {
            reuneste(x, y);
        }
        else
        {
            if (gaseste_multime(x) == gaseste_multime(y))
            {
                fout << "DA\n";
            }
            else
            {
                fout << "NU\n";
            }
        }
    }
}