Cod sursa(job #2806375)

Utilizator StefaniaCriStefania Cristea StefaniaCri Data 22 noiembrie 2021 16:07:56
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.98 kb
#include <iostream>
#include <fstream>
using namespace std;
#define Nmax 100007
ifstream f("disjoint.in");
ofstream g("disjoint.out");

int parinte[Nmax],greutate[Nmax];
int find(int x)
{
    if(parinte[x]==x) return x;
    return parinte[x] = find(parinte[x]);
}

void unite(int x, int y)
{
    int parinte_x = find(x);
    int parinte_y = find(y);
    if(parinte_x!=parinte_y)
    {
        if(greutate[parinte_x]<greutate[parinte_y])
            swap(parinte_x,parinte_y);
        parinte[parinte_y]=parinte_x;
        greutate[parinte_x]+=greutate[parinte_y];
    }

}

int main()
{
    int n,m,op,x,y;
    f>>n>>m;
    for(int i=1;i<=n;i++){
        parinte[i]=i;
        greutate[i]=1;
    }
    for(int i=0;i<m;i++)
    {
        f>>op>>x>>y;
        if(op==1)
        {
           unite(x,y);
        }
        else
        {
            if(find(x)==find(y))
                g<<"DA\n";
            else g<<"NU\n";
        }
    }
    return 0;
}