Cod sursa(job #2517856)
Utilizator | Data | 4 ianuarie 2020 13:06:00 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#define NM 100003
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int i,n,m,x,y,t,v1,v2;
int a[NM];
int main()
{
f>>n>>m;
for(i=1;i<=m;i++){
f>>t>>x>>y;
while(y!=0) { v1=y; y=a[y]; }
while(x!=0) { v2=x; x=a[x]; }
if(t==1) a[v1]=v2;
else {
if(v1==v2) g<<"DA"<<'\n';
else g<<"NU"<<'\n';
}
}
return 0;
}