Cod sursa(job #2277470)

Utilizator vladuteluVlad Oancea vladutelu Data 6 noiembrie 2018 12:39:47
Problema Paduri de multimi disjuncte Scor 40
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.68 kb
#include <iostream>
#include <fstream>
using namespace std;

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

int T[100005], t1, t2;

int sef(int x)
{
    if(x!=T[x])
        T[x] = sef(T[x]);
    return T[x];
}

void join(int x, int y)
{
    t1 = sef(x);
    t2 = sef(y);
    T[t2]=t1;
}

int main()
{
    int n, m, cod, x, y, i;
    in>>n>>m;
    for(i = 1; i<=n; i++)
        T[i]=i;
    for(i = 1; i<=m; i++)
    {
        in>>cod>>x>>y;
        if(cod==1)
            join(x, y);
        else
        {
            if(sef(T[x])==sef(T[y]))
                out<<"DA"<<endl;
            else out<<"NU"<<endl;
        }
    }
    return 0;
}