Cod sursa(job #1773351)

Utilizator alex.craciunCraciun Alexandru alex.craciun Data 7 octombrie 2016 19:15:00
Problema Paduri de multimi disjuncte Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include <iostream>
#include <cstdio>
using namespace std;
FILE *f=fopen("disjoint.in","r");
int n,m,v,x,y,t[100010];
FILE *f1=fopen("disjoint.out","w");
void citire( )
{
    fscanf(f,"%d%d",&n,&m);
    for(int i=1;i<=n;i++)
        t[i]=i;
    for(int i=1;i<=m;i++)
    { fscanf(f,"%d%d%d",&v,&x,&y);
        if(v==1)
        {
            t[y]=x;
            for(int i=1;i<=n;i++)
                if(t[i]==y)
                   t[i]=x;
        }

    else
        if(v==2)
    {
        int ok=1;
        for(int i=x;i<y;i++)
            if(t[i]!=t[i+1])
              ok=0;
        if(ok)
            fprintf(f1,"DA\n");
        else
            fprintf(f1,"NU\n");

    }
    }


}
int main()
{
    citire();
    return 0;
}