Pagini recente » Cod sursa (job #1280925) | Cod sursa (job #715748) | Cod sursa (job #2068015) | Cod sursa (job #1595246) | Cod sursa (job #1799160)
#include <fstream>
#include <stack>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,v[100010],op,x,y;
stack<int> q;
void grupeaza(int a, int b) {
while(v[a]!=0) {
q.push(a);
a=v[a];
}
while(!q.empty()) {
v[q.top()]=a;
q.pop();
}
while(v[b]!=0) {
q.push(b);
b=v[b];
}
while(!q.empty()) {
v[q.top()]=a;
q.pop();
}
v[a]=b;
}
void verifica(int a, int b) {
while(v[a]!=0){
q.push(a);
a=v[a];
}
while(!q.empty())
{
v[q.top()]=a;
q.pop();
}
while(v[b]!=0){
q.push(b);
b=v[b];
}
while(!q.empty())
{
v[q.top()]=b;
q.pop();
}
if(a==b)fout<<"DA\n";
else {
fout<<"NU\n";
}
}
int main() {
fin>>n>>m;
while(m--) {
fin>>op>>x>>y;
switch(op) {
case 1:
grupeaza(x,y);
break;
case 2:
verifica(x,y);
break;
}
}
return 0;
}