Cod sursa(job #2330718)

Utilizator alexconstantinalexandru constantin alexconstantin Data 28 ianuarie 2019 19:46:21
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.59 kb
#include <bits/stdc++.h>
using namespace std;
int T[100005];

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

void join(int x, int y)
{
    T[sef(y)]=sef(x);
}
ifstream in("disjoint.in");
ofstream out("disjoint.out");
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
        {
            (sef(T[x])==sef(T[y]))? out<<"DA\n" :out<<"NU\n";
        }
    }
    return 0;
}