Cod sursa(job #2058436)

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

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

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

int cauta(int x)
{
    int r,y;
    r=x;
    while(t[r]!=r)
    {
        r=t[r];
    }
    while(t[x]!=x)
    {
        y=t[x];
        t[x]=r;
        x=y;
    }
    return r;
}

void uneste(int x,int y)
{
    if(rg[y]>rg[x])
        t[x]=y;
    else
        t[y]=x;
    if(rg[y]==rg[x])
        rg[y]++;
}

int main()
{
    int n,m;
    fin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        t[i]=i;
        rg[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(cauta(x),cauta(y));
        }
    }
    return 0;
}