HDU - 5929 Basic Data Structure 模拟到死，双向队列

Mr. Frog learned a basic data structure recently, which is called stack.There are some basic operations of stack：

∙∙ PUSH x： put x on the top of the stack, x must be 0 or 1.
∙∙ POP： throw the element which is on the top of the stack.

Since it is too simple for Mr. Frog, a famous mathematician who can prove “Five points coexist with a circle” easily, he comes up with some exciting operations：

∙∙REVERSE： Just reverse the stack, the bottom element becomes the top element of the stack, and the element just above the bottom element becomes the element just below the top elements… and so on.
∙∙QUERY： Print the value which is obtained with such way： Take the element from top to bottom, then do NAND operation one by one from left to right, i.e. If atop,atop−1,⋯,a1atop,atop−1,⋯,a1 is corresponding to the element of the Stack from top to the bottom, value=atopvalue=atop nand atop−1atop−1 nand … nand a1a1. Note that the Stack will not change after QUERY operation. Specially, if the Stack is empty now，you need to print ” Invalid.”(without quotes).

By the way, NAND is a basic binary operation：

∙∙ 0 nand 0 = 1
∙∙ 0 nand 1 = 1
∙∙ 1 nand 0 = 1
∙∙ 1 nand 1 = 0

Because Mr. Frog needs to do some tiny contributions now, you should help him finish this data structure： print the answer to each QUERY, or tell him that is invalid.
Input
The first line contains only one integer T (T≤20T≤20), which indicates the number of test cases.

For each test case, the first line contains only one integers N (2≤N≤2000002≤N≤200000), indicating the number of operations.

In the following N lines, the i-th line contains one of these operations below：

∙∙ PUSH x (x must be 0 or 1)
∙∙ POP
∙∙ REVERSE
∙∙ QUERY

It is guaranteed that the current stack will not be empty while doing POP operation.

Output
For each test case, first output one line “Case #x：w, where x is the case number (starting from 1). Then several lines follow, i-th line contains an integer indicating the answer to the i-th QUERY operation. Specially, if the i-th QUERY is invalid, just print " Invalid.”(without quotes). (Please see the sample for more details.)
Sample Input

2
8
PUSH 1
QUERY
PUSH 0
REVERSE
QUERY
POP
POP
QUERY
3
PUSH 0
REVERSE
QUERY

Sample Output

Case #1:
1
1
Invalid.
Case #2:
0

关于题只说一点。0和任何数运算都是1，所以一个站，只需要看最下面的0的位置前面，这个位置前所有数运算都是1，如果这个0的位置就是队头，那还就是0，然后看0下边还有几个1就行了。
双向队列记录的是0的位置。

#include <bits/stdc++.h>
#define ll long long
using namespace std;
int a[600009];
int main()
{
    int T, n, x;
    scanf("%d", &T);
    for(int k = 1; k <= T; k++)
    {
        printf("Case #%d:\n", k);
        deque<int> q;
        string str;
        char s[20];
        int l = 300000-1, r = 300000, now = 1; // now为1说明队头在右边，-1左边。
        scanf("%d", &n);
        for(int i = 1; i <= n; i++)
        {
            scanf("%s",s);  //这里注意，如果直接cin>>str就会tle。
            str = s;
            if(str == "PUSH")
            {
                scanf("%d",&x);
                if(now == 1)
                {
                    a[r] = x;
                    if(!x) q.push_back(r);
                    r++;
                }
                else
                {
                    a[l] = x;
                    if(!x) q.push_front(l);
                    l--;
                }
            }
            else if(str == "QUERY")
            {
                if(l+1==r) printf("Invalid.\n");
                else if(q.empty()) printf("%d\n", (r-l-1)%2);
                else
                {
                    int len;
                    if(now == 1)
                    {
                        len = q.front() - l - 1;
                        if(q.front() != r-1) len++;
                    }
                    else
                    {
                        len = r - q.back() - 1;
                        if(q.back() != l+1) len++;
                    }
                    printf("%d\n",len%2);
                }
            }
            else if(str == "REVERSE")
            {
                now = -now;
            }
            else if(str == "POP")
            {
                if(now == 1)
                {
                    r--;
                    if(!a[r]) q.pop_back();
                }
                else
                {
                    l++;
                    if(!a[l]) q.pop_front();
                }
            }
        }
    }
    return 0;
}