Cod sursa(job #2955083)

Utilizator culiteramicacristiana culiteramica Data 16 decembrie 2022 03:34:00
Problema Paduri de multimi disjuncte Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.69 kb
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

int cod,n,m,x,y;
int multime[100001];
int mult(int x)
{
    if(multime[x]==x);
        return multime[x];
    multime[x]=mult(multime[x]);
    return multime[x];
}
int main()
{
    fin>>n>>m;
    for(int i=1; i<=n;i++)
    {
        multime[i]=i;
    }
    for(int i=1;i<=m;i++)
    {
        fin>>cod>>x>>y;

        if(cod==1)
             multime[mult(x)]=mult(y);
        else
        {
            if(mult(x)==mult(y))
                fout<<"da"<<'\n';
            else fout<<"nu"<<'\n';
        }
    }
    return 0;
}