Cod sursa(job #2278967)

Utilizator DordeDorde Matei Dorde Data 8 noiembrie 2018 19:21:24
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.62 kb
#include <fstream>

using namespace std;
ifstream f ("disjoint.in");
ofstream g ("disjoint.out");
int t [1 + int(1e5)];
int M (int a){
    if (t [a] == a)
        return a;
    t [a] = M (t [a]);
    return t [a];
}
int main()
{
    int n , m;
    f >> n >> m;
    for(int i = 1 ; i <= n ; ++ i)
        t [i] = i;
    for(int i = 1 ; i <= m ; ++ i){
        int a , b , c;
        f >> a >> b >> c;
        if (a == 1)
            t [M (b)] = M (c);
        else{
            if (M (b) == M (c))
                g << "DA\n";
            else
                g << "NU\n";
        }
    }
    return 0;
}