Cod sursa(job #2941830)

Utilizator matei0000Neacsu Matei matei0000 Data 18 noiembrie 2022 13:27:44
Problema Paduri de multimi disjuncte Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.63 kb
#include <fstream>

using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int t[100005];
int tata(int nod)
{
    if(t[nod]==nod)
        return nod;
    t[nod]=tata(t[nod]);
    return t[nod];
}
int join(int x, int y)
{
    x=tata(x);
    y=tata(y);
    t[x]=y;
}
string query(int x, int y)
{
    if(tata(x)==tata(y))
        return "DA";
    return "NU";
}

int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        t[i]=i;
    for(int i=0;i<m;i++)
    {
        int cod,x,y;
        cin>>cod>>x>>y;
        if(cod==1)
            join(x,y);
        else
            cout<<query(x,y)<<'\n';
    }
}