Cod sursa(job #1011929)

Utilizator alexblackFMI - Dumitrache Alexandru alexblack Data 17 octombrie 2013 19:23:50
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.53 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("disjoint.in");
ofstream out("disjoint.out");
int const N=100005;
int n,m,t[N];
int find(int x)
{
    if(t[x]==0) return x;
    t[x]=find(t[x]); return t[x];
}
void query(int x, int y)
{
    if(find(x)==find(y)) out<<"DA\n";
    else                 out<<"NU\n";
}
int main()
{
    in>>n>>m;   int x,y,z;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y>>z;
        if(x==1) t[find(y)]=find(z);
        else     query(y,z);
    }
    return 0;
}