Cod sursa(job #2175208)

Utilizator GoogalAbabei Daniel Googal Data 16 martie 2018 15:57:49
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1 kb
#include <iostream>
#include <fstream>
#include <cstring>

using namespace std;

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

const int NMAX = 1e5;

int n, m;
int ssz[1 + NMAX];
int sef[1 + NMAX];
string ans;

int getsef(int el) {
  if(el == sef[el])
    return el;
  else {
    sef[el] = getsef(sef[el]);
    return sef[el];
  }
}

int main()
{
  in >> n >> m;
  for(int i = 1; i <= n; i++) {
    sef[i] = i;
    ssz[i] = 1;
  }

  for(int i = 1; i <= m; i++) {
    int op, x, y;
    in >> op >> x >> y;

    if(op == 1) {
      int sx = getsef(x);
      int sy = getsef(y);

      if(ssz[sx] <= ssz[sy]) {
        sef[sy] = sx;
        ssz[sx] += ssz[sy];
      } else {
        sef[sx] = sy;
        ssz[sy] += ssz[sx];
      }
    } else {
      int sx = getsef(x);
      int sy = getsef(y);

      if(sx == sy)
        ans += "DA\n";
      else
        ans += "NU\n";
    }
  }

  out << ans;

  in.close();
  out.close();
  return 0;
}