Cod sursa(job #1797346)

Utilizator radu.leonardoThe Doctor radu.leonardo Data 4 noiembrie 2016 11:45:15
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <stdio.h>
using namespace std;
int v[100001],n,m,t,x,y;
char buff[180000];int pos;
FILE*f=freopen("disjoint.in","r",stdin);
FILE*g=freopen("disjoint.out","w",stdout);
inline void read(int &nr)
{
    while(buff[pos] < '0' || buff[pos] > '9') if(++pos == 180000) fread(buff, 1, 180000, stdin), pos = 0;
    nr = 0;
    while('0' <= buff[pos] && buff[pos] <= '9')
    {
        nr = nr * 10 + buff[pos] - '0';
        if(++pos == 180000) fread(buff, 1, 180000, stdin), pos = 0;
    }
}

int root(int i)
{
    while(i!=v[i]) v[i]=v[v[i]],i=v[i];
    return i;
}
void unite(int p,int q)
{ v[root(p)]=root(q);

}
int main()
{fread(buff,1,180000,stdin);
    read(n);read(m);int i;
 for(i=1;i<=n;i++) v[i]=i;
 for(i=1;i<=m;i++)
 {read(t);read(x);read(y);
  if(t==1) unite(x,y);

  else
    { if(root(x)==root(y)) printf("DA\n");
      else printf("NU\n");
    }


 }

}