答案:<pre class="brush:cpp;toolbar:false">//参考程序1
#include <iostream>
#include <vector>
using namespace std;
struct Node {
int addr, data, next;
};
int main() {
int head, n, k;
cin >> head >> n >> k;
vector<Node> nodes(100000);
for (int i = 0; i < n; ++i) {
int addr;
cin >> addr;
cin >> nodes[addr].data >> nodes[addr].next;
nodes[addr].addr = addr;
}
vector<Node> negative, zeroToK, greater;
for (int p = head; p != -1; p = nodes[p].next) {
if (nodes[p].data < 0) negative.push_back(nodes[p]);
else if (nodes[p].data <= k) zeroToK.push_back(nodes[p]);
else greater.push_back(nodes[p]);
}
negative.insert(negative.end(), zeroToK.begin(), zeroToK.end());
negative.insert(negative.end(), greater.begin(), greater.end());
for (int i = 0; i < negative.size(); ++i) {
if (i < negative.size() - 1) negative[i].next = negative[i + 1].addr;
else negative[i].next = -1;
printf("%05d %d ", negative[i].addr, negative[i].data);
if (negative[i].next != -1) printf("%05d\n", negative[i].next);
else printf("-1\n");
}
return 0;
}</pre><p><br/></p><pre class="brush:cpp;toolbar:false">//参考程序2
#include <iostream>
#include <unordered_map>
#include <vector>
#include <string>
using namespace std;
struct NodeInfo {
string address;
int data;
string next;
};
int main() {
string start_addr;
int N, K;
cin >> start_addr >> N >> K;
unordered_map<string, pair<int, string>> node_map;
for (int i = 0; i < N; ++i) {
string addr, next;
int data;
cin >> addr >> data >> next;
node_map[addr] = {data, next};
}
vector<NodeInfo> nodes_old;
string current = start_addr;
while (current != "-1") {
auto& p = node_map[current];
nodes_old.push_back({current, p.first, p.second});
current = p.second;
}
vector<NodeInfo> group_neg, group_mid, group_big;
for (auto& node : nodes_old) {
if (node.data < 0) {
group_neg.push_back(node);
} else if (node.data <= K) {
group_mid.push_back(node);
} else {
group_big.push_back(node);
}
}
vector<NodeInfo> nodes_new;
nodes_new.insert(nodes_new.end(), group_neg.begin(), group_neg.end());
nodes_new.insert(nodes_new.end(), group_mid.begin(), group_mid.end());
nodes_new.insert(nodes_new.end(), group_big.begin(), group_big.end());
for (int i = 0; i < nodes_new.size(); ++i) {
if (i == nodes_new.size() - 1) {
nodes_new[i].next = "-1";
} else {
nodes_new[i].next = nodes_new[i+1].address;
}
}
for (auto& node : nodes_new) {
cout << node.address << " " << node.data << " " << node.next << endl;
}
return 0;
}</pre><p></p>
这道题暂未补解析。