Cod sursa(job #2075914)
| Utilizator | Data | 25 noiembrie 2017 20:38:14 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include<fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int t[100005];
int main()
{
int n,m,i,j,x,y,p,sem,a;
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>p>>x>>y;
if(p==1)t[y]=x;
else{
sem=0;
a=t[y];
while(a!=0)
{
if(a==x){sem=1;break;}
a=t[a];
}
if(!sem){
a=t[x];
while(a!=0)
{
if(a==y){sem=1;break;}
a=t[a];
}
}
if(sem)g<<"DA\n";
else g<<"NU\n";
}
}
return 0;
}
