Pagini recente » Cod sursa (job #2541015) | Cod sursa (job #1847360) | Cod sursa (job #507646) | Cod sursa (job #2030270) | Cod sursa (job #3248398)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int v[100001];
int main()
{
int n,m;
f>>n>>m;
for(int i=1;i<=n;i++)
v[i]=i;
for(int i=1;i<=m;i++)
{
int caz,x,y;
f>>caz>>x>>y;
if(caz==1){
while(v[x]!=x){x=v[x];}
v[y]=x;
}
else if(caz==2){
while(v[x]!=x){x=v[x];}
while(v[y]!=y){y=v[y];}
if(x==y)g<<"DA\n";
else g<<"NU\n";
}
}
return 0;
}