Cod sursa(job #3253590)

Utilizator tonealexandruTone Alexandru tonealexandru Data 3 noiembrie 2024 17:22:37
Problema Paduri de multimi disjuncte Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.74 kb
#include <bits/stdc++.h>

using namespace std;

int p[100005];

int root(int a)
{
    if(p[a] != a)
        a = root(a);

    return p[a];
}

void unite(int a, int b)
{
    a = root(a);
    b = root(b);

    if(p[a] != p[b])
        p[a] = b;
}

int main()
{
    ifstream cin("disjoint.in");
    ofstream cout("disjoint.out");
    int n, m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        p[i] = i;

    int c, a, b;
    for(int i=1;i<=m;i++)
    {
        cin>>c>>a>>b;
        if(c == 1) unite(a, b);
        else if(c == 2)
        {
            if(root(a) == root(b))
                cout<<"DA";
            else
                cout<<"NU";
            cout<<'\n';
        }
    }


    return 0;
}