Cod sursa(job #2721751)

Utilizator raduk11Serban Mihai-Radu raduk11 Data 12 martie 2021 10:45:00
Problema Paduri de multimi disjuncte Scor 40
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.93 kb
#include <fstream>

using namespace std;

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

int t[100001],rang[100001];

int radacina(int x)
{
    if(t[x]==0)
        return x;
    else return t[x]=radacina(t[x]);
}
void uniune(int x, int y)
{
    int rx = radacina(x), ry = radacina(y);
    if(rx != ry)
    {
        if(rang[rx] > rang[ry])
            t[ry] = rx;
        else
        {
            t[rx] = ry;
            if(rang[rx] == rang[ry])
                rang[ry] ++;
        }
    }
}
bool colegi(int x, int y)
{
    if(radacina(x)==radacina(y))
        return 1;
    return 0;
}
int main()
{
    int n,m,x,y,op;
    in>>n>>m;
    for(int i=1; i<=m; i++)
    {
        in>>op>>x>>y;
        if(op==1)
            uniune(x,y);
        else
        {
            if(colegi(x,y))
                out<<"DA"<<endl;
            else out<<"NU"<<endl;
        }
    }
    return 0;
}