Cod sursa(job #2972580)

Utilizator andreibrosPeta Andrei Mathias andreibros Data 29 ianuarie 2023 19:00:28
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.89 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int tata[100005];
int h[100005];
int Find(int x)
{
    if(tata[x]==x)
        return x;
    tata[x]=Find(tata[x]);
    return tata[x];
}
void Unite(int x, int y)
{
    int a=Find(x);
    int b=Find(y);
    if(h[a]<h[b])
    {
        tata[a]=b;
    }else
    {
        if(h[a]==h[b])
            h[a]++;
        tata[b]=a;
    }
}
int main()
{
    int n,m;
    in>>n>>m;
    for(int i=1; i<=n; i++)
        tata[i]=i;
    int t,x,y;
    for(int i=1; i<=m; i++)
    {
        in>>t>>x>>y;
        if(t==2)
        {
            if(Find(x)==Find(y))
                out<<"DA"<<'\n';
            else
                out<<"NU"<<'\n';
        }
        else
            if(t==1)
        {
            Unite(x,y);
        }

    }
    return 0;
}