Pagini recente » Cod sursa (job #1605961) | Cod sursa (job #1483391) | Cod sursa (job #1506883) | Cod sursa (job #1775146) | Cod sursa (job #1797328)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int v[100001],n,m,i,t,x,y;
int main()
{f>>n>>m;
for(i=1;i<=n;i++) v[i]=i;
for(i=1;i<=m;i++)
{f>>t>>x>>y;
if(t==1)
{ while(v[x]!=y) {n=v[x];v[x]=y,x=n;}
}
else
{ while(v[x]!=x) x=v[x];
while(v[y]!=y) y=v[y];
if(x==y) cout<<"DA\n";
else cout<<"NU\n";
}
}
}