Cod sursa(job #2117656)

Utilizator MithrilBratu Andrei Mithril Data 29 ianuarie 2018 08:32:41
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.97 kb
#include <bits/stdc++.h>
#define NMAX 100005
using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m;

int rang[NMAX];
int parent[NMAX];

int getParent(int x)
{
    int R, y;
    for(R=x; R!=parent[R]; R=parent[R]);
    for(; parent[x]!=x; x=parent[x])
    {
        y=parent[x];
        parent[x]=R;
        x=y;
    }
    return R;
}

void unite(int x, int y)
{
    if(rang[x]>rang[y])
    {
        parent[y]=x;
    }
    else
    {
        parent[x]=y;
        rang[y] = (rang[x] == rang[y]) ? (rang[y]+1):(rang[y]);
    }
 }

int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++) parent[i]=i;
    for(int i=1;i<=m;i++)
    {
        int x,y,z;
        fin>>x>>y>>z;
        if(x==1)
        {
            unite(getParent(y), getParent(z));
        }
        else
        {
            if(getParent(y)==getParent(z)) fout<<"DA\n";
            else fout<<"NU\n";
        }
    }
    return 0;
}