Cod sursa(job #2815888)

Utilizator David_PicardAnusca David Alexandru David_Picard Data 10 decembrie 2021 15:58:23
Problema Paduri de multimi disjuncte Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.66 kb
#include <fstream>

using namespace std;
ifstream cin("disjunct.in");
ofstream cout("disjunct.out");
int tata[100001];
int sef(int x)
{
    if(tata[x]==x)
        return x;
    else
        return tata[x]=sef(tata[x]);
}
void unire(int x, int y)
{
    tata[sef(y)]=sef(x);
}
int main()
{
    int n,m,c,x,y,i;
    cin>>n>>m;
    for(i=1; i<=n; i++)
        tata[i]=i;
    for(i=1; i<=m; i++)
    {
        cin>>c>>x>>y;
        if(c==1)
            unire(x,y);
        else
        {
            if(sef(x)==sef(y))
                cout<<"DA"<<'\n';
            else
                cout<<"NU"<<'\n';
        }

    }
    return 0;
}