Cod sursa(job #2151993)

Utilizator GeorgeCalinPetruta George-Calin GeorgeCalin Data 5 martie 2018 09:36:25
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <fstream>
#define nmax 100002
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

int t[nmax],r[nmax];

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

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

int main()
{
    int n,m,val,x,y;
    fin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        t[i]=i;
        r[i]=1;
    }
    for(int i=1;i<=m;i++)
    {
        fin>>val>>x>>y;
        int rx=rad(x);
        int ry=rad(y);
        if(val==1)
            unire(rx,ry);
        else
            if(rx==ry)
                fout<<"DA\n";
            else
                fout<<"NU\n";
    }
    return 0;
}