Cod sursa(job #1851180)

Utilizator teo.cons98Constantin Teodor-Claudiu teo.cons98 Data 19 ianuarie 2017 14:27:12
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include<iostream>
#include<fstream>

using namespace std;

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

int n, m, i, tata[100001], x, y, c;

int compr(int v)
{
    if(tata[v]==v)
    {
        return v;
    }
    tata[v]=compr(tata[v]);
    return tata[v];
}

int main()
{
    fin>>n>>m;
    for(int i=1; i<=n; ++i)
    {
        tata[i]=i;
    }
    for(m = m; m > 0; --m)
    {
        fin>>c>>x>>y;
        x=compr(x);
        y=compr(y);
        if(c==1)
        {
            tata[x]=y;
        }
        else
        {
            if(x == y)
            {
                fout<<"DA"<<'\n';
            }
            else
            {
                fout<<"NU"<<'\n';
            }
        }
    }
}