Cod sursa(job #963466)
| Utilizator | Data | 17 iunie 2013 15:53:13 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
#define N 100009
int n,m;
int v[N];
int prog(int x)
{
if(v[x] == 0){
return x;
}
return prog(v[x]);
}
void citire()
{
int x,y,c,a,b;
f>>n>>m;
for( int i=1;i<=m;i++)
{
f>>c>>x>>y;
a = prog(x);
b = prog(y);
if(c==1){
v[b]=a;
}
else{
if(a == b){g<<"DA"<<'\n';
}else {g<<"NU"<<'\n';}}}} int main(){citire();return 0;}