PAT (Advanced Level) Practise1133Splitting A Linked List (25)
来源:互联网 发布:edu域名查询 编辑:程序博客网 时间:2024/06/09 19:50
1133. Splitting A Linked List (25)
Given a singly linked list, you are supposed to rearrange its elements so that all the negative values appear before all of the non-negatives, and all the values in [0, K] appear before all those greater than K. The order of the elements inside each class must not be changed. For example, given the list being 18→7→-4→0→5→-6→10→11→-2 and K being 10, you must output -4→-6→-2→7→0→5→10→18→11.
Input Specification:
Each input file contains one test case. For each case, the first line contains the address of the first node, a positive N (<= 105) which is the total number of nodes, and a positive K (<=1000). The address of a node is a 5-digit nonnegative integer, and NULL is represented by -1.
Then N lines follow, each describes a node in the format:
Address Data Next
where Address is the position of the node, Data is an integer in [-105, 105], and Next is the position of the next node. It is guaranteed that the list is not empty.
Output Specification:
For each case, output in order (from beginning to the end of the list) the resulting linked list. Each node occupies a line, and is printed in the same format as in the input.
Sample Input:00100 9 1023333 10 2777700000 0 9999900100 18 1230968237 -6 2333333218 -4 0000048652 -2 -199999 5 6823727777 11 4865212309 7 33218Sample Output:
33218 -4 6823768237 -6 4865248652 -2 1230912309 7 0000000000 0 9999999999 5 2333323333 10 0010000100 18 2777727777 11 -1
#include<stdio.h>const int N = 1e5 + 10;int nt[N], u[N], v[N];int x, y, z;int s, n, m, t = -1;int main(){ scanf("%d%d%d",&s,&n,&m); for (int i = 1;i<=n;i++) { scanf("%d%d%d",&x,&y,&z); u[x] = y; nt[x] = z; } int now = -1; for (int i = s;i!=-1;i = nt[i]) { if (u[i] < 0) { if (t < 0) t = now = i; else { v[now] = i; now = i; } } } for (int i = s;i!=-1;i = nt[i]) { if (u[i] >= 0 && u[i] <= m) { if (t < 0) t = now = i; else { v[now] = i; now = i; } } } for (int i = s;i!=-1;i = nt[i]) { if (u[i] > m) { if (t < 0) t = now = i; else { v[now] = i; now = i; } } } v[now] = -1; for (int i = t;i!=-1;i=v[i]) { printf("%05d %d ",i,u[i]); if (v[i] == -1) printf("-1\n"); else printf("%05d\n",v[i]); } return 0;}
- PAT (Advanced Level) Practise1133Splitting A Linked List (25)
- 【PAT】【Advanced Level】1097. Deduplication on a Linked List (25)
- PAT (Advanced Level) 1097. Deduplication on a Linked List (25) 链表去重
- PAT (Advanced Level) Practise 1097 Deduplication on a Linked List (25)
- 1097. Deduplication on a Linked List (25)【链表】——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1097 Deduplication on a Linked List (25)
- 【C++】PAT (advanced level)1074. Reversing Linked List (25)
- PAT Advanced Level 1074. Reversing Linked List (25)
- PAT (Advanced Level) Practise 1052 Linked List Sorting (25)
- PAT (Advanced Level) Practise 1074 Reversing Linked List (25)
- PAT (Advanced Level) Practise 1074 Reversing Linked List (25)
- PAT (Advanced Level) Practise 1052 Linked List Sorting (25)
- 【PAT】【Advanced Level】1052. Linked List Sorting (25)
- 【PAT】【Advanced Level】1074. Reversing Linked List (25)
- Pat(Advanced Level)Practice--1097(Deduplication on a Linked List)
- Pat(Advanced Level)Practice--1052(Linked List Sorting)
- Pat(Advanced Level)Practice--1074(Reversing Linked List)
- PAT (Advanced Level) 1052. Linked List Sorting (25) 结构体排序
- 利用tf.truncated_normal与tf.random_normal进行张量初始化的详解
- 对String在多线程中的一些简单认识
- 各主流浏览器之间的兼容性-JS篇
- 对建造者模式的总结
- 解决Xcode 8以后的Alcatraz等插件不可用
- PAT (Advanced Level) Practise1133Splitting A Linked List (25)
- 有序的Map集合--LinkedHashMap
- JavaScript学习笔记_Reduce和Transduce
- 简单存储过程的编写
- java日期格式中MMM的问题
- HttpClient
- Python + opencv 实现图片马赛克
- log4net 使用笔记(c# .net framework)
- QObject::connect: Cannot queue arguments of type "xxx",(Make sure "xxx" is registed using qRegisterM