1074 Reversing Linked List

Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given L being 1→2→3→4→5→6, if K=3, then you must output 3→2→1→6→5→4; if K=4, you must output 4→3→2→1→5→6.

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 (≤10
​5
​​ ) which is the total number of nodes, and a positive K (≤N) which is the length of the sublist to be reversed. 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, and Next is the position of the next node.

Output Specification:
For each case, output the resulting ordered linked list. Each node occupies a line, and is printed in the same format as in the input.

Sample Input:
00100 6 4
00000 4 99999
00100 1 12309
68237 6 -1
33218 3 00000
99999 5 68237
12309 2 33218
Sample Output:
00000 4 33218
33218 3 12309
12309 2 00100
00100 1 99999
99999 5 68237
68237 6 -1
24分，最后一点始终过不了，我看别人是说可能有的点不再链表上，这个我也考虑了，但是就不知道哪里错了= =
做着题复习了reverse的用法，ceil,最主要还是对链表的复习，我觉得我写的还是比较简洁，虽然丑了点代码。

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cmath>
const int N=1e6+5;
using namespace std; 
struct node{
	int date,address,next;
}Node[N],NNode[N];
int main(){
	int n,s,k,p,d,q;
	cin>>s>>n>>k;
	for(int i=0;i<n;i++){
		cin>>p>>d>>q;
		NNode[p].address=p;
		NNode[p].date=d;
		NNode[p].next=q;
	}
    int w=0;
	while(s!=-1){
		Node[w].address=s;
		Node[w].date=NNode[s].date;
		Node[w].next=NNode[s].next;
		s=NNode[s].next;
		w++;
	}
	
	int sum=ceil(n/k),j=0;
    for(int i=0;i<sum;i++){
    	reverse(Node+j,Node+j+k);
    	j+=k;
	}
	for(int i=0;i<w;i++){
		if(i<w-1)
	 	printf("%05d %d %05d\n",Node[i].address,Node[i].date,Node[i+1].address);
		else
		printf("%05d %d -1",Node[i].address,Node[i].date);
	}
	return 0;
}