Cod sursa(job #3342034)

Utilizator BidonTurtitBezdedan Eric BidonTurtit Data 22 februarie 2026 15:07:20
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.91 kb
#include <iostream>
#include <fstream>
#include <cstring>
#define NMax 1000005
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

int nxt[NMax];
int head[NMax];
int tail[NMax];
int n,m;
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        nxt[i]=0;
        head[i]=i;
        tail[i]=i;
    }
    for(int i=1;i<=m;i++)
    {
        int cod,x,y;
        fin>>cod>>x>>y;
        if(cod==2)
        {
            if(head[x]==head[y])
                fout<<"DA"<<"\n";
            else
                fout<<"NU"<<"\n";
        }
        else if(cod==1)
        {
            int hx=head[x];
            int hy=head[y];
            nxt[tail[hx]]=hy;
            tail[hx]=tail[hy];
            int i=hy;
            while(i!=0)
            {
                head[i]=hx;
                i=nxt[i];
            }
        }
    }
    return 0;
}