1075 链表元素分类 (25分)

AC代码

#include <iostream>
#include <cstdio>
using namespace std;
struct node{
    int cur, value, nxt;
}nodes[100010], tmp[100010], tmp2[100010], tmp3[100010];
int main(){
    int ori, n, k, x, pos = 0, index = 0, scroll = 0;
    scanf("%d%d%d", &ori, &n, &k);
    for (int i = 0; i < n; i++){
        scanf("%d", &x);
        nodes[x].cur = x;
        scanf("%d%d", &nodes[x].value, &nodes[x].nxt);
    }
    while (true){
        if (nodes[ori].value < 0)
            tmp[pos++] = nodes[ori];
        else if (nodes[ori].value >= 0 && nodes[ori].value <= k)
            tmp2[index++] = nodes[ori];
        else tmp3[scroll++] = nodes[ori];
        if (nodes[ori].nxt == -1) break;
        ori = nodes[ori].nxt;
    }
    for (int i = 0; i < index; i++)
        tmp[pos++] = tmp2[i];
    for (int i = 0; i < scroll; i++)
        tmp[pos++] = tmp3[i];
    for (int i = 0; i < pos-1; i++)
        printf("%05d %d %05d\n", tmp[i].cur, tmp[i].value, tmp[i+1].cur);
    printf("%05d %d -1", tmp[pos-1].cur, tmp[pos-1].value);
    return 0;
}