Cod sursa(job #1114249)

Utilizator MutescuMutescu Alexandru Mutescu Data 21 februarie 2014 14:02:53
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include <cstdio>
#define mx 100010
using namespace std;
int p[mx],i,j,x,y,cod,n,m;
int baza(int a){
if(p[a]==a)
return a;
p[a]=baza(p[a]);
return p[a];}
void unire(int x,int y)
{p[baza(x)]=baza(y);
}

int main()
{   freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
scanf("%d %d",&n,&m);
for(i=1;i<=n;i++)
p[i]=i;

   for (i=1;i<=m;i++) {
        scanf("%d %d %d", &cod, &x, &y);

        switch (cod) {
        case 1:
            unire(x, y);
            break;
        case 2:
            if (baza(x)==baza(y)) {
                printf("DA\n");
            } else {
                printf("NU\n");
            }}
   }

return 0;}