Pagini recente » Cod sursa (job #341149) | Cod sursa (job #171764) | Cod sursa (job #1245439) | Cod sursa (job #2609733) | Cod sursa (job #1379967)
#include<fstream>
#define Nmax 100099
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,T[Nmax];
int gr(int x)
{
if(T[x]!=x) T[x]=gr(T[x]);
return T[x];
}
void Reunion(int x,int y)
{
T[gr(x)]=gr(y);
}
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++) T[i]=i;
for(int i=1;i<=m;i++)
{
int op,x,y;
f>>op>>x>>y;
if(op==1) Reunion(x,y);
if(op==2) if(gr(x)==gr(y)) g<<"DA\n";
else g<<"NU\n";
}
f.close();g.close();
return 0;
}