思路:
前向星建图,之后从2个起始节点顺序遍历,并依次将信息存入2个vector中,之后按照题目要求顺序重排链表即可,其优点在于当节点地址大小远大于节点个数时,可以节省空间
注意:
对最后一个节点-1
的处理
代码:
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define f(i,a,n) for(int i=a;i<n;++i)
#define ff(i,a,n) for(int i=a;i<=n;++i)
const int INF=0x3f3f3f3f;
using namespace std;
typedef long long ll;
//
const int N=1e5+5;
int h1,h2;
vector<int> v1,v2,v3;
int n,ne[N],e[N];
int main(){
cin>>h1>>h2>>n;
f(i,0,n){
int adr,data,next;
cin>>adr>>data>>next;
e[adr]=data;
ne[adr]=next;
}
for(int i=h1;~i;i=ne[i])v1.push_back(i);
for(int i=h2;~i;i=ne[i])v2.push_back(i);
if(v2.size()>v1.size())swap(v2,v1);
while(1){
if(v1.size())v3.push_back(v1[0]);
if(v1.size())v1.erase(v1.begin());
if(v1.size())v3.push_back(v1[0]);
if(v1.size())v1.erase(v1.begin());
if(v2.size())v3.push_back(v2[v2.size()-1]);
if(v2.size())v2.erase(v2.end()-1);
if(!v1.size() && !v2.size())break;
}
f(i,0,v3.size()){
printf("%05d %d ",v3[i],e[v3[i]]);
if(i!=v3.size()-1)printf("%05d\n",v3[i+1]);
else cout<<-1<<endl;
}
return 0;
}