Pagini recente » Cod sursa (job #1480202) | Cod sursa (job #107754) | Cod sursa (job #2092022) | Cod sursa (job #145726) | Cod sursa (job #1886115)
#include <fstream>
#define lmax 100005
using namespace std;
int n,m,x,i,p[lmax],cod,y;
int str(int x)
{
while(x!=p[x])x=p[x];
return x;
}
int main()
{
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
fin>>n>>m;
for(i=1;i<=n;i++)
p[i]=i;
for(i=1;i<=m;i++)
{
fin>>cod>>x>>y;
if(cod==1)
p[str(x)]=str(y),p[str(y)]=str(x);
else
{
if(str(x)==str(y))fout<<"DA\n";
else fout<<"NU\n";
}
}
return 0;
}
///1->2 , 2->3