PAT——A1074 Reversing Linked List

最新推荐文章于 2024-10-31 22:45:34 发布

ZMST

最新推荐文章于 2024-10-31 22:45:34 发布

阅读量130

点赞数

分类专栏：链表

本文链接：https://blog.csdn.net/qq_42232118/article/details/82116975

版权

链表专栏收录该内容

3 篇文章 0 订阅

订阅专栏

题目链接：

#include<utility>
#include<iostream>
#include<stdio.h>
#include<string>
#include<algorithm>
#include<map>
#include<vector>
#include<queue>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
#define maxn 100010
struct Node{
 int data;
 int next;
 int address;
 int order;
}node[maxn];
bool cmp(Node a,Node b)
{
    return a.order<b.order;
}
int main()
{
    for(int i=0;i<maxn;i++)
    {
      node[i].order=maxn;
    }
    int begin,n,k,address;
    scanf("%d%d%d",&begin,&n,&k);
    for(int i=0;i<n;i++)
    {
        scanf("%d",&address);
        scanf("%d%d",&node[address].data,&node[address].next);
        node[address].address=address;
    }
    int p=begin;
    int count=0;
    while(p!=-1)
    {
        node[p].order=count++;
        p=node[p].next;
    }
    sort(node,node+maxn,cmp);
    n=count;
    for(int i=0;i<n/k;i++)
    {
        for(int j=(i+1)*k-1;j>i*k;j--)
        {
            printf("%05d %d %05d\n",node[j].address,node[j].data,node[j-1].address);
        }
        printf("%05d %d ",node[i*k].address,node[i*k].data);
        if(i<n/k-1)
        {
            printf("%05d\n",node[(i+2)*k-1].address);
        }
        else
        {
            if(n%k==0)
            {
                printf("-1\n");
            }
            else
            {
                printf("%05d\n",node[(i+1)*k].address);
                for(int i=n/k*k;i<n;i++)
                {
                    printf("%05d %d ",node[i].address,node[i].data);
                    if(i<n-1)
                        printf("%05d\n",node[i+1].address);
                    else
                        printf("-1\n");
                }
            }
        }
      }
    return 0;
}