Pagini recente » Cod sursa (job #1103148) | Cod sursa (job #2790771) | Cod sursa (job #1822374) | Cod sursa (job #1837764) | Cod sursa (job #1805957)
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,x,y,c,i,j,a[100010],b[100010],t[100010];
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)t[i]=i;
for(;m;m--)
{
f>>c>>x>>y;
a[1]=x;i=1;while(t[x]-x){x=t[x];i++;a[i]=x;}
b[1]=y;j=1;while(t[y]-y){y=t[y];j++;b[j]=y;}
if(c==1)
x=y=a[i];
else
x==y?g<<"DA\n":g<<"NU\n";
for(;i;i--)t[a[i]]=x;
for(;j;j--)t[b[j]]=y;
}
return 0;
}