Pagini recente » Cod sursa (job #330361) | Cod sursa (job #2984642) | Cod sursa (job #1405996) | Cod sursa (job #3276882) | Cod sursa (job #553024)
Cod sursa(job #553024)
#include<fstream>
using namespace std;
int P[100001],n;
void uneste(int x, int y)
{
int m1,m2,i;
m1=P[y];
m2=P[x];
for(i=1;i<=n;i++)
if(P[i]==m2)
P[i]=m1;
}
int main()
{
int i, x, y, m,cod;
ifstream f("disjoint.in");
f>>n>>m;
ofstream g("disjoint.out");
for(i=1;i<=n;i++)
P[i]=i;
for(i=1;i<=m;i++)
{
f>>cod>>x>>y;
if(cod==1)
uneste(x,y);
else
{
if(P[x]==P[y])
g<<"DA\n";
else
g<<"NU\n";
}
}
f.close();
g.close();
return 0;
}