Pagini recente » Cod sursa (job #1549807) | Cod sursa (job #730726) | Cod sursa (job #1177661) | Cod sursa (job #678796) | Cod sursa (job #407447)
Cod sursa(job #407447)
#include<stdio.h>
#include<vector>
#include<fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int padure[100001],n,m;
void reuneste(int x, int y)
{
int m1,m2,i;
m1=padure[x];
m2=padure[y];
for(i=1;i<=n;i++)
if (padure[i]==m2)
padure[i]=m1;
}
void verifica(int x, int y)
{ if(padure[x]==padure[y])
g<<"DA\n";
else
g<<"NU\n";
}
int main()
{ int x, y,i,nr;
f>>n>>m;
for(i=1;i<=n;i++)
padure[i]=i;
for(i=1;i<=m;i++)
{f>>nr>>x>>y;
if(nr==1) reuneste(x,y);
else if (nr==2) verifica(x,y);
}
return 0;
}