Cod sursa(job #2753899)

Utilizator rarestudurTudur Rares rarestudur Data 24 mai 2021 17:45:15
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.08 kb
#include <fstream>

using namespace std;

const int N = 1e6;

int t[N],nr[N];

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

int radacina(int x)
{
    if(t[x] == 0)
    {
        return x;
    }
    t[x] = radacina(t[x]);
    return t[x];
}

bool verificare(int x,int y)
{
    return (radacina(x) == radacina(y));
}

void reuniune(int x,int y)
{
    int rx = radacina(x);
    int ry = radacina(y);
    if(nr[ry] > nr[rx])
    {
         t[rx] = ry;
        nr[ry] += nr[rx];
    }
    else
    {
        t[ry] = rx;
        nr[rx] += nr[ry];
    }
}

int main()
{
    int n,m;
    in >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int tip,x,y;
        in >> tip >> x >> y;
        if(tip == 1)
        {
            reuniune(x,y);
        }
        else
        {
            if(verificare(x,y))
            {
                out << "DA" << "\n";
            }
            else
            {
                out << "NU" << "\n";
            }
        }
    }
    in.close();
    out.close();
    return 0;
}