L2-022 重排链表

思路：既记录正向链，也记录他们的前驱，方便从往前输出；先把头输出，再按规律输出中间的，判断一下结尾；

坑：不止一条链=-=

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<map>
#include<stack>
#include<string>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=2e5+9;
const int mod=1e9+7;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

struct node
{
    int val;
    int nex;
}p[maxn];
int pre[maxn];
int main()
{
    int st,n,ed;
    cin>>st>>n;
    for(int i=0;i<n;i++)
    {
        int id;
        int va;
        int nx;
        cin>>id>>va>>nx;
        p[id].nex=nx;
        p[id].val=va;
        if(nx!=-1)
        {
            pre[nx]=id;
        }
    }
    int nx=st;
    int tol=0;
    while(nx!=-1)
    {
        tol++;
        if(p[nx].nex==-1) ed=nx;
        nx=p[nx].nex;
    }
    int num=1;
    printf("%05d %d ",ed,p[ed].val);
    if(n==1)
    {
        cout<<-1<<endl;
        return 0;
    }
    ed=pre[ed];
    while(1)
    {
        if(num%2)
            printf("%05d\n%05d %d ",st,st,p[st].val),st=p[st].nex;
        else printf("%05d\n%05d %d ",ed,ed,p[ed].val),ed=pre[ed];
        num++;
        if(num==tol)
        {
            cout<<-1<<endl;
            break;
        }
    }
    return 0;
}