Cod sursa(job #1894342)

Utilizator jordan1998Jordan jordan1998 Data 26 februarie 2017 19:24:03
Problema Paduri de multimi disjuncte Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include <iostream>
#include <fstream>
using namespace std;
#define no 100002
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int v[no],c,n,m,a,b,i,R1,R2,y;
int main()
{
   f>>n>>m;
   for(i=1;i<=n;i++)
    v[i]=i;
   for(i=1;i<=m;i++)
   {
       f>>c>>a>>b;
       if(c==1) {
         while(v[a]!=a)a=v[a];
       while(v[b]!=b)b=v[b];
       v[a]=b;
       }
       else{
            R1=a;R2=b;
       while(v[R1]!=R1)R1=v[R1];
       for (; v[a] != a;)
    {
        y = v[a];
        v[a] = R1;
        a = y;
    }
       while(v[R2]!=R2)R2=v[R2];
       for (; TT[b] != b;)
    {
        y = v[b];
        v[b] = R2;
        b = y;
    }
       if(b==a) g<<"DA"<<'\n'; else g<<"NU"<<'\n';
       }
   }
}