Pagini recente » Cod sursa (job #1090104) | Cod sursa (job #2329450) | Cod sursa (job #250441) | Cod sursa (job #1914103) | Cod sursa (job #1333511)
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int i,N,M,c,x,y;
int v[100001];
int fi(int x){return (v[x]==x?x:v[x]=fi(v[x]));}
void u(int x,int y){v[fi(x)]=fi(y);}
int main()
{
f>>N>>M;
for (i=1;i<=N;++i)v[i]=i;
while (M--)
{ f>>c>>x>>y;
if (c == 2)
if (fi(x)==fi(y))g<<"DA\n";else g<<"NU\n";
else u(x,y);
}
return 0;
}