Cod sursa(job #2721398)

Utilizator valeriucaraselCarasel Valeriu valeriucarasel Data 11 martie 2021 19:27:53
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.97 kb
#include <iostream>
#include <fstream>

using namespace std;

const int N=100005;
int t[N],nr[N];

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

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

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

int main()
{
    ifstream in("disjoint.in");
    ofstream out("disjoint.out");
    int n,m;
    in>>n>>m;
    int c,x,y;
    for (int i=1;i<=m;i++)
    {
        in>>c>>x>>y;
        bool f;
        if (c==1)
        {
            reun(x,y);
        }
        else
            {f=verif(x,y);
                if (f) out<<"DA"<<"\n";
                else out<<"NU"<<"\n";
            }
    }
    in.close();
    out.close();
    return 0;
}