Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
108211 | 王子毅 | 序列变换II | C++ | Accepted | 1 MS | 276 KB | 717 | 2025-01-19 15:27:07 |
#include <iostream> #include <vector> #include <string> #include <sstream> using namespace std; int main() { int n; cin >> n; vector<int> original_sequence(n); for (int i = 0; i < n; ++i) { cin >> original_sequence[i]; } vector<int> new_sequence; for (int i = 0; i < n; ++i) { int index = original_sequence[i] - 1; int first = original_sequence[index] - 1; int second = original_sequence[first]; new_sequence.push_back(second); } for (int i = 0; i < new_sequence.size(); ++i) { if (i > 0) { cout << " "; } cout << new_sequence[i]; } cout << endl; return 0; }