棒棒糖

#include<iostream>
#include <vector>
typedef struct node {
	int up = -1;
	int flag = 0;
	int down= -1;
};
using namespace std;

vector<node> shelf(10000000);
int fl = 1;//记录节点代数，用于清空后判断节点是否有效
int sum = 0;//记录总数
int least = 0;//记录最后一个
int dir = 1;//记录当前架子方向，每次旋转加一，奇数为正方向，偶数为反方向
node p1, p2, temp;

void insert(int x,int y) {
	if (sum == 0) {	 //若当前架子上无棒棒糖，即一定插在第0个的右边	
		p1.up = -1;
		p1.down = x;
		p1.flag = fl;
		shelf[0] = p1;//第0个,向上无，向下指向第x个，放在第0位,充当头节点

		p2.up = 0;
		p2.down = -1;
		p2.flag = fl;
		shelf[x] = p2;//第1个,向上指向0也就是头节点，向下无即-1，放在第x位

		least = x;//末节点指向最后一个
	}else if (dir % 2 == 1) {
		temp = shelf[y];//先获取被插入节点
		if (temp.down == -1) {//若被插入点是末节点
			shelf[y].down = x;
			p1.up = y;
			p1.down = -1;
			p1.flag = fl;
			least = x;//末节点指向最后一个
		}
		else {
			p1.up = y;
			p1.down = temp.down;
			p1.flag = fl;
			shelf[y].down = x;//被插入点指向新插入节点
			shelf[temp.down].up = x;//被插入点以前指向的节点的上一个替换成新插入点
		}
		shelf[x] = p1;
	}else if(dir%2==0){//逆转之后向右插入转化成向左插入即可
		temp = shelf[y];//先获取被插入节点
		if (y == 0) {//逆向插在第一个就是插在最后一个
			p1.up = least;
			p1.down = -1;
			p1.flag = fl;
			shelf[least].down = x;
			least = x;
		}else {
			p1.up = temp.up;
			p1.down = y;
			p1.flag = fl;
			shelf[y].up = x;
			shelf[temp.up].down = x;
		}
		shelf[x] = p1;
	}
	sum++;
}
void showAll() {
	if (dir % 2 == 1) {
		for (node i = shelf[0]; i.down != -1;) {
			if (i.flag == fl) {
				cout << i.down << " ";
				i = shelf[i.down];
			}
		}
	}
	else {
		cout << least << " ";
		for (node i = shelf[least]; i.up != 0;) {			
			if (i.flag == fl) {
				cout << i.up << " ";
				i = shelf[i.up];
			}
		}
	}
	cout << endl;
}
void showRight(int x) {
	if (dir % 2 == 1) {
		if (shelf[shelf[x].down].flag == fl) {
			cout << shelf[x].down << endl;
		}
	}
	else {
		if (shelf[shelf[x].up].flag == fl) {
			cout << shelf[x].up << endl;
		}
	}
}
void delet(int x) {
	temp = shelf[x];
	if (temp.down == -1) {//若要删除的点在最右边
		shelf[temp.up].down = -1;//将他上一个节点的向后指针指向-1
		shelf[x].up = -1;
		least = temp.up;//末节点指向最后一个
	}
	else {
		shelf[temp.up].down = temp.down;//将该节点的上一个节点的向右指针，指向该节点的向后指针
		shelf[temp.down].up = temp.up;
		shelf[x].up = -1;
		shelf[x].down = -1;
	}
	sum--;
}
int main() {
	int t;
	cin >> t;
	for (int i = 0; i < t; i++) {
		int n, x, y;	
		cin >> n;
		switch (n) {
			case 1: {
				cin >> x >> y;					
				insert(x, y);
				break;
			}
			case 2: {
				cin >> x;
				delet(x);
				break;
			}
			case 3: {
				cin >> x;
				if (shelf[x].up == -1 && shelf[x].down == -1 || shelf[x].flag != fl) {
					cout << "0" << endl;
				}
				else {
					cout << "1" << endl;
				}
				break;
			}
			case 4: {
				cout << sum << endl;
				break;
			}
			case 5: {
				showAll();
				break;
			}
			case 6: {
				cin >> x;
				showRight(x);
				break;
			}
			case 7: {
				shelf[0].down = -1;
				shelf[least].up = -1;
				sum = 0;
				least = 0;
				fl++;
				break;
			}
			case 8: {
				dir++;
				break;
			}
		}	
	}
	return 0;

}