Cod sursa(job #399509)

Utilizator Bogdan_CCebere Bogdan Bogdan_C Data 20 februarie 2010 16:26:53
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.91 kb
#include<stdio.h>
#include<stdlib.h>
#define FIN "disjoint.in"
#define FOUT "disjoint.out"
#define NMAX 100004
using namespace std;

int t[NMAX],r[NMAX];

int caut(int x)
{int y,z;
 for(y=x;t[y]!=y;y=t[y]);
 for(;t[x]!=x;)
   {z=t[x];
    t[x]=y;
    x=z;}
 return y;   
    }

void unite(int x,int y)
 {if(r[x]>r[y]) t[y]=x;
 else t[x]=y;
  if(r[x]==r[y]) r[y]++;   
     }    
int n,m,cd,x,y;

int main()
{
    freopen(FIN,"r",stdin);
    freopen(FOUT,"w",stdout);
    scanf("%d %d",&n,&m);
    for(int i=1;i<=n;i++)
     {t[i]=i;
      r[i]=1;}
    
    for(;m;m--)
     {scanf("%d %d %d",&cd,&x,&y);
      if(cd==2) {if(caut(x)==caut(y))
                 printf("DA\n");
                 else printf("NU\n");
                }
      if(cd==1){unite(caut(x),caut(y));
                
                }
                         
               }  
      
    return 0;
    }