#include<stdio.h>
int main(void)
{
int next1,next2,n,t1,t2,t3,t4=0,t5=0,t6=0,count1=0,count2=0;
scanf("%d %d %d",&next1,&next2,&n);
int a[100001][2],d1[n],d2[n],add[n];
for(int i=0;i<n;i++)
{
scanf("%d %d %d",&t1,&t2,&t3);
a[t1][0]=t2;
a[t1][1]=t3;
}
while(next1!=-1)
{
d1[count1++]=next1;
next1=a[next1][1];
}
while(next2!=-1)
{
d2[count2++]=next2;
next2=a[next2][1];
}
int*pl=&d1[0];
int*ps=&d2[0];
if(count1<count2)
{
int t=count1;
count1=count2;
count2=t;
int*p=pl;
pl=ps;
ps=p;
}
int flag1=-2;
t5=count2-1;
for(int i=0;i<count1+count2;i++)
{
if(flag1++||t5<0)
{
add[t6++]=pl[t4++];
continue;
}
if(t5>=0)
{
add[t6++]=ps[t5--];
flag1=-2;
}
}
for(int i=0;i<t6;i++)
i==t6-1?printf("%05d %d -1\n",add[i],a[add[i]][0]):printf("%05d %d %05d\n",add[i],a[add[i]][0],add[i+1]);
return 0;
}
PTAbasic 1105链表合并
最新推荐文章于 2023-11-07 14:32:56 发布