Cod sursa(job #2473615)

Utilizator bigmixerVictor Purice bigmixer Data 13 octombrie 2019 21:48:04
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.3 kb
#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(), (a).end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
///#define cin fin
///#define cout fout
using namespace std;

const int mod=1e9+7;
const int mod1=998244353;

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

int n,m,par[100005],siz[100005],t,x,y;

int root(int a){
    if(a!=par[a]) par[a]=root(par[a]);
    return par[a];
}

void mix(int a,int b){
    int x=root(a);
    int y=root(b);
    if(siz[x]<=siz[y]) swap(x,y);
    siz[x]+=siz[y];
    par[y]=x;
}

int32_t main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    fin >> n >> m;
    for(int i=1;i<=n;i++) par[i]=i,siz[i]=1;
    for(int i=1;i<=m;i++){
        fin >> t >> x >> y;
        if(t==1) mix(x,y);
        else{
            if(root(x)==root(y)) fout << "DA" << '\n';
            else fout << "NU" << '\n';
        }
    }
}