C++ 代码：特工联系表构建 - 时空限制 1S, 64MB

#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n \n vector<int> contacts(N);\n contacts[0] = 1;\n \n for (int i = 1; i < N; i++) {\n int k, p;\n cin >> k >> p;\n \n if (p == 0) {\n contacts[i] = contacts[k-1];\n contacts[k-1] = i+1;\n } else {\n contacts[i] = i+1;\n }\n }\n \n for (int i = 0; i < N; i++) {\n cout << contacts[i] << " ";\n }\n \n return 0;\n}