用两个数组模拟双向列表
// Problem#: 1934
// Author#: Reid Chan
#include <iostream>
using namespace std;
void initial(int *f, int *b, int n) {
int i;
for (i = 0; i < n; i++) { f[i] = i + 1; }
for (i = n; i > 0; i--) { b[i] = i - 1; }
}
void move_ball(int o, int x, int y, int *f, int *b) {
f[b[x]] = f[x], b[f[x]] = b[x];
if (o == 1) {
f[x] = y, f[b[y]] = x;
b[x] = b[y], b[y] = x;
} else {
b[x] = y, b[f[y]] = x;
f[x] = f[y], f[y] = x;
}
}
void output(int *f, int n) {
int i = 0, c = 0;
while (c++ < n) {
cout << f[i] << ' ';
i = f[i];
}
cout << endl;
}
int main() {
int t, n, m;
int o, x, y;
int forward[500002], backward[500002];
cin >> t;
while (t--) {
cin >> n >> m;
initial(forward, backward, n);
while (m--) {
cin >> o >> x >> y;
move_ball(o, x, y, forward, backward);
}
output(forward, n);
}
return 0;
} // Problem#: 1934
// Author#: 
