Book Pile sgu271

处理好输入格式就可以了

#include <iostream>#include <cstdio>#include <cstdlib>#include <cmath>#include <queue>#include <algorithm>#include <vector>#include <cstring>#include <stack>#include <cctype>#include <utility>   #include <map>#include <string>  #include <climits> #include <set>#include <string>    #include <sstream>#include <utility>   #include <ctime>using std::priority_queue;using std::vector;using std::swap;using std::stack;using std::sort;using std::max;using std::min;using std::pair;using std::map;using std::string;using std::cin;using std::cout;using std::set;using std::queue;using std::string;using std::istringstream;using std::make_pair;using std::getline;using std::greater;using std::endl;using std::multimap;using std::deque;typedef long long LL;typedef unsigned long long ULL;typedef pair<int, int> PAIR;typedef multimap<int, int> MMAP;const int MAXN(150010);const int MAXM(10010);const int MAXE(10010);const int SIGMA_SIZE(26);const int MAXH(19);const int INFI(2000000000);const int MOD(1000000007);const ULL BASE(31);const LL LIM(10000000);const int INV(-10000);struct NODE{int num, size, flag;    //s1表示区域正数的个数NODE *fa, *ch[2];};int K;char str[MAXN][5];int count;struct SPLAY_TREE{NODE pool[MAXN];NODE *root, *NIL, *rear;inline void push_up(NODE *sour)  {sour->size = sour->ch[0]->size+sour->ch[1]->size+1;}inline void updata_rev(NODE *sour){if(sour == NIL) return ;swap(sour->ch[0], sour->ch[1]);sour->flag ^= 1;}inline void push_down(NODE *sour){if(sour->flag){updata_rev(sour->ch[0]);updata_rev(sour->ch[1]);sour->flag = 0;}}void initNIL(){NIL->ch[0] = NIL->ch[1] = NIL->fa = NIL;NIL->num = NIL->size = 0;}void build(NODE *&sour, NODE *tf, int l, int r){if(l > r)return;int m = (l+r) >> 1;newnode(sour, tf, m);build(sour->ch[0], sour, l, m-1);build(sour->ch[1], sour, m+1, r);push_up(sour);}void init(int n){NIL = pool;initNIL();rear = pool+1;newnode(root, NIL, 0);  //插入无穷小newnode(root->ch[1], root, 0); //插入无穷大build(root->ch[1]->ch[0], root->ch[1], 1, n); //建树push_up(root->ch[1]);push_up(root);}void newnode(NODE *&sour, NODE *f, int num){sour = rear++;sour->num = num;sour->size = 1;sour->flag = 0;sour->fa = f;sour->ch[0] = sour->ch[1] = NIL;}void rotate(NODE *sour, int flag){NODE *f = sour->fa;push_down(f);push_down(sour);f->ch[!flag] = sour->ch[flag];sour->ch[flag]->fa = f;sour->fa = f->fa;if(f->fa != NIL)f->fa->ch[f->fa->ch[1] == f] = sour;sour->ch[flag] = f;f->fa = sour;push_up(f);}void splay(NODE *sour, NODE *goal){push_down(sour);while(sour->fa != goal){if(sour->fa->fa == goal)rotate(sour, sour->fa->ch[0] == sour);else{NODE *f = sour->fa;int flag = (f->fa->ch[0] == f);if(f->ch[flag] == sour)rotate(sour, !flag);elserotate(f, flag);rotate(sour, flag);}}push_up(sour);if(goal == NIL)root = sour;}NODE *select(NODE *sour, int r){while(sour != NIL){push_down(sour);if(r == sour->ch[0]->size+1)break;if(r <= sour->ch[0]->size)sour = sour->ch[0];else{r -= sour->ch[0]->size+1;sour = sour->ch[1];}}return sour;}void ADD(int num){NODE *tp = select(root, 1);splay(tp, NIL);tp = select(root, 2);splay(tp, root);newnode(tp->ch[0], tp, num);push_up(root->ch[1]);push_up(root);}void ROTATE(){int temp = root->size-2 < K? root->size: K+2;NODE *tp = select(root, 1);splay(tp, NIL);tp = select(root, temp);splay(tp, root);updata_rev(tp->ch[0]);push_up(root->ch[1]);push_up(root);}void print(){NODE *tp = select(root, 1);splay(tp, NIL);tp = select(root, root->size);splay(tp, root);dfs(tp->ch[0]);}void dfs(NODE *sour){if(sour == NIL)return;push_down(sour);dfs(sour->ch[0]);printf("%s\n", str[sour->num]);dfs(sour->ch[1]);}};SPLAY_TREE spt;int main(){int n, m;while(~scanf("%d%d%d", &n, &m, &K)){for(int i = 1; i <= n; ++i)scanf("%s", str[i]);count = n;spt.init(n);char temp, op[10];for(int i = 0; i < m; ++i){scanf(" %c", &temp);if(temp == 'A'){scanf("DD(%s", str[++count]);str[count][strlen(str[count])-1] = '\0';spt.ADD(count);}else{scanf("%s", op);spt.ROTATE();}}spt.print();}return 0;}