Pagini recente » Cod sursa (job #1345714) | Cod sursa (job #2904143) | Cod sursa (job #278977) | Cod sursa (job #1290871) | Cod sursa (job #2054837)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream a("disjoint.in");
ofstream b("disjoint.out");
int n,m;
a>>n>>m;
int tmic,tmare,maxim;
int x,y,cod;
int v[100000];
for(int i=1;i<=100000;i++)v[i]=i;
for(int i=1;i<=m;++i){
a>>cod;
if(cod&1){
a>>x>>y;
if(x>maxim)maxim=x;
if(y>maxim)maxim=y;
if(v[x]<v[y]){
tmic=v[x];
tmare=v[y];
}
else{
tmic=v[y];
tmare=v[x];
}
for(int j=1;j<=maxim;j++){
if(v[j]==tmic)v[j]=tmare;
}
}
else
{
if(v[x]==v[y])b<<"DA\n";
else b<<"NU\n";
}
}
return 0;
}