Cod sursa(job #3261367)

Utilizator Gabriel_DaescuDaescu Gabriel Florin Gabriel_Daescu Data 5 decembrie 2024 16:47:02
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.03 kb
#include <fstream>
#define NMAX 100002
using namespace std;
ifstream  fin("disjoint.in");
ofstream fout("disjoint.out");
int N,M,rad[NMAX],nr[NMAX];

int Find(int x)
{
    if(rad[x]==x)
    {
        return x;
    }

    rad[x]=Find(rad[x]);
    return rad[x];
}

void Union(int a, int b)
{
    if(nr[a]>nr[b])
    {
        rad[b]=a;
        nr[a]+=nr[b];
    }
    else
    {
        rad[a]=b;
        nr[b]+=nr[a];
    }
}

int main()
{
    int tip,x,y;
    fin>>N>>M;

    for(int i=1; i<=N; i++)
    {
        rad[i]=i;
        nr[i]=1;
    }

    for(int i=1; i<=M; i++)
    {
        fin>>tip>>x>>y;
        int sef1,sef2;
        sef1=Find(x);
        sef2=Find(y);

        if(tip==1)
        {
            Union(sef1,sef2);
        }
        else
        {
            if(sef1==sef2)
            {
                fout<< "DA";
            }
            else
            {
                fout<< "NU";
            }
            fout<< "\n";
        }
    }

    return 0;
}