Cod sursa(job #3376621)

Utilizator bobitzaxddCucos Bogdan bobitzaxdd Data 18 noiembrie 2026 17:32:51
Problema Paduri de multimi disjuncte Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.1 kb
#include <fstream>
#include <vector>
using namespace std;

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

vector<int> tata(100001, 0), marime(100001, 0);


int main()
{
    int N, M, a, b, c;
    cin >> N >> M;

    for(int i = 1; i <= N; i++) tata[i] = i;

    for(int i = 1; i <= M; i++)
    {
        cin >> c >> a >> b;

        if(c == 1)
        {
            if(marime[a] < marime[b])
            {
                tata[a] = tata[b];
                marime[a] = max(marime[a], marime[b]+1);
            }
            else 
            {
                tata[b] = tata[a];
                marime[b] = max(marime[b], marime[a]+1);
            }
        }
        else 
        {
            while (tata[tata[a]] != tata[a] || tata[tata[b]] != tata[b])
            {
                tata[a] = tata[tata[a]];
                tata[b] = tata[tata[b]];
            }
            if(tata[a] == tata[b])
            {
                cout << "DA" << '\n';
            }
            
            else cout << "NU" << '\n';
            
            
        }
    }
}