Cod sursa(job #1333711)

Utilizator c0rn1Goran Cornel c0rn1 Data 3 februarie 2015 15:11:01
Problema Paduri de multimi disjuncte Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <iostream>
#include <cstdio>
#include <algorithm>
#define NMAX 100005

using namespace std;

int n, m;
int a[NMAX];
char rasp[][3]={"NU", "DA"};

void unire(int x, int y)
{
   for (int i=1; i<=n; i++)
      if (a[i] == y)
         a[i] = x;
}

int main()
{
   freopen("disjoint.in", "r", stdin);
   freopen("disjoint.out", "w", stdout);
   int o, x, y;
   scanf("%d %d\n", &n, &m);
   for (int i=1; i<=n; i++)
      a[i] = i;
   for (int i=0; i<m; i++){
      scanf("%d %d %d\n", &o, &x, &y);
      if (o==2){
         printf("%s\n", rasp[a[x]==a[y]]);
      }
      else{
         unire(x, y);
      }
   }

   return 0;
}