Pagini recente » Cod sursa (job #2021555) | Cod sursa (job #611275) | Cod sursa (job #1605175) | Cod sursa (job #1775254) | Cod sursa (job #662048)
Cod sursa(job #662048)
#include<fstream>
#include<iostream>
#include<stdlib.h>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int main()
{
int *v,n,i,m,j,op,x,y,c;
in>>n;
//alocarea vectorului
v=( int *)malloc((n+1)*sizeof( int ));
//padurea disjuncta
for(i=1;i<=n;i++)
v[i]=i;
in>>m;
for(j=1;j<=m;j++)
{
in>>op;
in>>x>>y;
if(op==1)
{
if(x<y)
{
c=v[y];
for(i=1;i<=n;i++)
if(v[i]==c)
v[i]=v[x];
}
else
{
c=v[x];
for(i=1;i<=n;i++)
if(v[i]==c)
v[i]=v[y];
}
}
else
{
if(v[x]==v[y])
out<<"DA"<<"\n";
else
out<<"NU"<<"\n";
}
}
free(v);
in.close();
out.close();
return 0;
}