团体程序设计天梯赛-练习集 L2-002. 链表去重

团体程序设计天梯赛-练习集
L2-002. 链表去重
https://www.patest.cn/contests/gplt/L2-002
因为题目对时间的要求较严格，在加上数目并不大，用数组下表模拟链表地址。
打印时先打印地址与key值，再将当前地址向后移动，判断该点的key值是否可用，可用就打印，不可用就加如到已删除的列表中。

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 100000 + 10;
struct Node {
    int nextad;
    int key;
}node[maxn];
int address[maxn];
int amax = 0;
bool fand[maxn];
int main() {
    int hand, n;
    while (scanf_s("%d%d", &hand, &n) != EOF) {
        memset(node, -1, sizeof(node));
        memset(fand, true, sizeof(fand));
        int ad;
        for (int i = 0; i < n; i++) {
            scanf_s("%d", &ad);
            scanf_s("%d%d", &node[ad].key, &node[ad].nextad);
        }
        int path = hand;
        printf("%05d %d", path, node[path].key);
        int no;
        if (node[path].key < 0) {
            no = -node[path].key;
        }
        else {
            no = node[path].key;
        }
        fand[no] = false;
        while (true) {
            path = node[path].nextad;
            if (path == -1) {
                printf(" -1\n");
                break;
            }
            if (node[path].key < 0) {
                no = -node[path].key;
            }
            else {
                no = node[path].key;
            }
            if (fand[no]) {
                printf(" %05d\n%05d %d", path, path, node[path].key);
                fand[no] = false;
            }
            else {
                address[amax++] = path;
            }
        }
        if (amax != 0) {
            printf("%05d %d ", address[0], node[address[0]].key);
            for (int i = 1; i < amax; i++) {
                printf("%05d\n%05d %d ", address[i], address[i], node[address[i]].key);
            }

            printf("-1\n");
        }
    }
    return 0;
}