Cod sursa(job #2809736)

Utilizator ana_madalina_18Radu Ana Madalina ana_madalina_18 Data 27 noiembrie 2021 15:10:53
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.07 kb
#include <fstream>

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n, m;
int tata[100009], lung_max[100009];
int radacina(int x)
{
    if(tata[x]==x)
    {
        return x;
    }
    return radacina(tata[x]);
}
void unire(int x, int y)
{
    int rad_x=radacina(x);
    int rad_y=radacina(y);
    if(lung_max[rad_x]>lung_max[rad_y])
    {
        tata[rad_y]=rad_x;
    }
    else if(lung_max[rad_x]<lung_max[rad_y])
    {
        tata[rad_x]=rad_y;
    }
    else
    {
        tata[rad_y]=rad_x;
        lung_max[rad_x]+=1;
    }
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        tata[i]=i;
        lung_max[i]=1;
    }
    for(int i=1;i<=m;i++)
    {
        int op;
        int x, y;
        fin>>op>>x>>y;
        if(op==1)
        {
            unire(x,y);
        }
        else
        {
            if(radacina(x)==radacina(y))
            {
                fout<<"DA"<<'\n';
            }
            else
                fout<<"NU\n";
        }
    }
    return 0;
}