Cod sursa(job #2236360)

Utilizator AlexGanasideAlex Ganaside AlexGanaside Data 29 august 2018 12:08:49
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <fstream>

using namespace std;

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

const int MAX = 1e5 + 1;
int n, m, tata[MAX];

int find_tata(int fiu)
{
    if(tata[fiu] == fiu)
    {
        return fiu;
    }

    int ans = find_tata(tata[fiu]);
    tata[fiu] = ans;

    return ans;
}

int main()
{
    cin >> n >> m;

    for(int i = 1; i <= n; ++i)
    {
        tata[i] = i;
    }

    for(int i = 1; i <= m; ++i)
    {
        int cod, x, y;
        cin >> cod >> x >> y;

        int tx = find_tata(x);
        int ty = find_tata(y);

        if(cod == 1)
        {
            tata[tx] = ty;
        }

        else
        {
            if(tx == ty)
            {
                cout << "DA\n";
            }

            else
            {
                cout << "NU\n";
            }
        }
    }

    return 0;
}