Cod sursa(job #2107477)

Utilizator andreeagoideaAndreea Goidea andreeagoidea Data 17 ianuarie 2018 11:55:19
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.7 kb
#include <iostream>
#include <fstream>

using namespace std;

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

int t[100001];

int tata(int x)
{
    if(t[x]==x) return x;
    else return t[x]=tata(t[x]);
}

void join(int x, int y)
{
    int rx, ry;
    rx=tata(x);
    ry=tata(y);
    t[rx]=ry;
}

int main()
{
    int m, n, tip, x, y;
    fin>>n>>m;
    for(int i=1; i<=n; i++) t[i]=i;
    for(int i=1; i<=m; i++)
    {
        fin>>tip>>x>>y;
        if(tip==1)
            join(x, y);
        else
        {
            if(tata(x)==tata(y))
                fout<<"DA"<<'\n';
            else
                fout<<"NU"<<'\n';
        }
    }
    return 0;
}