Cod sursa(job #1881208)
Utilizator | Data | 16 februarie 2017 11:44:17 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define NMAX 100001
int n, q, tata[NMAX];
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int get_tata(int x)
{
if(x==tata[x])
return x;
return get_tata(tata[x]);
}
int main()
{
f>>n>>q;
for(int i=1;i<=n;i++)
tata[i]=i;
while(q--)
{
int query, a, b;
f>>query>>a>>b;
if(query==1)
{
tata[get_tata(a)]=get_tata(b);
}
else
{
g<<((get_tata(a)==get_tata(b))?"DA":"NU")<<'\n';
}
}
return 0;
}