Cod sursa(job #1894312)
Utilizator | Jordan jordan1998 | Data | 26 februarie 2017 19:01:31 |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 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;
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{
while(v[a]!=a)a=v[a];
while(v[b]!=b)b=v[b];
if(b==a) g<<"DA"<<'\n'; else g<<"NU"<<'\n';
}
}
}