PAT 1074

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<stack>
using namespace std;

const int maxn=100010;

struct Node
{
	int address;
	int data;
	int next;
	int order;
}node[maxn];	

bool cmp(Node a,Node b)
{
	return a.order<b.order;
}

int main()
{
	int begin,n,k;
	int address;
	scanf("%d%d%d",&begin,&n,&k);

	for(int i=0;i<maxn;i++)
	{	
		node[i].order=maxn;
	}

	for(int i=0;i<n;i++)
	{
		scanf("%d",&address);
		scanf("%d%d",&node[address].data,&node[address].next);
		node[address].address=address;
	}

	int count=0;
	for(int i=begin;i!=-1;i=node[i].next)
	{
		node[i].order=count;
		count++;
	}

	sort(node,node+maxn,cmp);

	int num=count/k;
	if(count%k==0)
	{
		for(int i=1;i<=num;i++)
		{
			for(int j=(i*k-1);j>=(i-1)*k;j--)
			{		
				if(j==(num-1)*k)
				{
					printf("%05d %d -1\n",node[j].address,node[j].data);
				}
				else if(j==(i-1)*k)
					printf("%05d %d %05d\n",node[j].address,node[j].data,node[j+2*k-1].address);
				else 
					printf("%05d %d %05d\n",node[j].address,node[j].data,node[j-1].address);
			}
		}
	}
	else 
	{
		for(int i=1;i<=num;i++)
		{
			for(int j=(i*k-1);j>=(i-1)*k;j--)
			{		
				if(j==(num-1)*k)
				{
					printf("%05d %d %5d\n",node[j].address,node[j].data,node[j+k].address);
					begin=j+k;
				}
				else if(j==(i-1)*k)
					printf("%05d %d %05d\n",node[j].address,node[j].data,node[j+2*k-1].address);
				else 
					printf("%05d %d %05d\n",node[j].address,node[j].data,node[j-1].address);
			}
				}

		for(begin;begin<count-1;begin++)
		{
			printf("%05d %d %05d\n",node[begin].address,node[begin].data,node[begin].next);
		}
		printf("%05d %d -1\n",node[begin].address,node[begin].data);

	}
	system("pause");
	return 0;
}