1934. 移动小球

http://soj.sysu.edu.cn/1934

中文题目

#include <iostream>
using namespace std;

struct ball {
  int left;
  int right;
};

int main() {
  int t;
  int n,m,c;
  int x,y,temp;
  cin >> t;
  while(t--) {
   cin >> n >> m;
   ball b[n+1];
   
   b[0].right = 1;
   b[n+1].left = n;
   
   for(int i = 1; i <= n ; i++) {
    b[i].left = i-1;
    b[i].right = i+1;
  }
  
   for(int i = 0 ; i < m ; i++) {
     cin >> c >> x >> y;
     b[b[x].right].left = b[x].left;
     b[b[x].left].right = b[x].right;
     
     if(c == 1) {
	b[x].left = b[y].left;
	b[b[y].left].right = x;
	b[x].right = y;
	b[y].left = x;
    }
    else {
	b[x].right = b[y].right;
	b[b[y].right].left = x;
	b[x].left = y;
	b[y].right = x;
    }
   }
  temp = 0;
  for(int i = 1;i<=n;i++) {
	cout << b[temp].right << ' ';
	temp = b[temp].right;
  }
  cout << endl;
   }
 return 0;
}