1133 Splitting A Linked List

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 (≤10​5​​) which is the total number of nodes, and a positive K (≤10​3​​). 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 [−10​5​​,10​5​​], 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 10
23333 10 27777
00000 0 99999
00100 18 12309
68237 -6 23333
33218 -4 00000
48652 -2 -1
99999 5 68237
27777 11 48652
12309 7 33218

Sample Output:

33218 -4 68237
68237 -6 48652
48652 -2 12309
12309 7 00000
00000 0 99999
99999 5 23333
23333 10 00100
00100 18 27777
27777 11 -1

#include<iostream>
#include <bits/stdc++.h>

using namespace std;
int start,n,k;
bool negempty,inempty,outempty;
struct node{
    int id,value,next;
};
node f[100000],top;
queue<node>neg,inside,outside;
int main(){
    scanf("%d%d%d",&start,&n,&k);
    for(int i=0;i<n;i++){
        node tp;
        scanf("%d %d %d",&tp.id,&tp.value,&tp.next);
        f[tp.id]=tp;
    }

    for(int it =start;it!=-1;it=f[it].next){
        if(f[it].value<0)neg.push(f[it]);
        else if(f[it].value<=k)inside.push(f[it]);
        else outside.push(f[it]);
    }
    if(neg.empty())negempty=true;
    if(outside.empty())outempty=true;
    if(inside.empty())inempty=true;
    
    while (!neg.empty()) {
        top = neg.front();
        neg.pop();
        if(!neg.empty())printf("%05d %d %05d\n",top.id,top.value,neg.front().id);
    }
        if(!negempty&&!inempty)printf("%05d %d %05d\n",top.id,top.value,inside.front().id);
        while (!inside.empty()) {
            top = inside.front();
            inside.pop();
            if(!inside.empty())printf("%05d %d %05d\n",top.id,top.value,inside.front().id);
        }
    
    if(!outempty&&(!negempty||!inempty))printf("%05d %d %05d\n",top.id,top.value,outside.front().id);
    else if(!negempty||!inempty)printf("%05d %d -1\n",top.id,top.value);
    while (!outside.empty()) {
        top = outside.front();
        outside.pop();
        if(!outside.empty())printf("%05d %d %05d\n",top.id,top.value,outside.front().id);
        else printf("%05d %d -1\n",top.id,top.value);
    }
    
    
    return 0;
}