Cod sursa(job #2361134)

Utilizator HelloWorldBogdan Rizescu HelloWorld Data 2 martie 2019 13:19:23
Problema Paduri de multimi disjuncte Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.86 kb
#include <fstream>
using namespace std;
ifstream in("disjoints.in");
ofstream out("disjoints.out");
int n,m,i,cod,x,y,r[100001],t[100001];
int Gaseste(int x)
{
    while (t[x]!=x)
        x=t[x];
    return x;
}
void Reunire(int x,int y)
{
    if (r[x]>r[y])  /// legam arborele mai mic de arborele mai mare
        t[y]=x;
    else if (r[y]>r[x]) /// legam arborele mai mic de arborele mai mare
        t[x]=y;
    else
    {
        r[x]++;
        t[y]=x;
    }
}
int main()
{
    in>>n>>m;
    for (i=1; i<=n; ++i)
    {
        t[i]=i;
        r[i]=1;
    }
    for (i=1; i<=m; ++i)
    {
        in>>cod>>x>>y;
        if (cod==1)
            Reunire(x,y);
        else if (cod==2)
        {
            if (Gaseste(x)==Gaseste(y))
                out<<"DA\n";
            else
                out<<"NU\n";
        }
    }
}