Cod sursa(job #2058455)

Utilizator GeorgeCalinPetruta George-Calin GeorgeCalin Data 5 noiembrie 2017 17:44:21
Problema Paduri de multimi disjuncte Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 0.85 kb
#include <fstream>
using namespace std;

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

int t[100002];
int c,x,y;

int cauta(int x)
{
    while(t[x]>0)
    {
        x=t[x];
    }
    return x;
}

void uneste(int x,int y)
{
    int rady=cauta(y);
    int radx=cauta(x);
    if(t[rady]<t[radx])
    {
        t[rady]+=t[radx];
        t[radx]=y;
    }
    else
    {
        t[radx]+=t[rady];
        t[rady]=x;
    }
}

int main()
{
    int n,m;
    fin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        t[i]=-1;
    }
    for(int i=1;i<=m;i++)
    {
        fin>>c>>x>>y;
        if(c==2)
        {
            if(cauta(x)==cauta(y))
                fout<<"DA\n";
            else
                fout<<"NU\n";
        }
        else
        {
            uneste(x,y);
        }
    }
    return 0;
}