ZOJ 3210 A Stack or A Queue?【模拟】

A Stack or A Queue?

---

Time Limit: 1 Second      Memory Limit: 32768 KB

---

Do you know stack and queue? They're both important data structures. A stack is a "first in last out" (FILO) data structure and a queue is a "first in first out" (FIFO) one.

Here comes the problem: given the order of some integers (it is assumed that the stack and queue are both for integers) going into the structure and coming out of it, please guess what kind of data structure it could be - stack or queue?

Notice that here we assume that none of the integers are popped out before all the integers are pushed into the structure.

Input

There are multiple test cases. The first line of input contains an integer T (T <= 100), indicating the number of test cases. Then T test cases follow.

Each test case contains 3 lines: The first line of each test case contains only one integer N indicating the number of integers (1 <= N <= 100). The second line of each test case contains N integers separated by a space, which are given in the order of going into the structure (that is, the first one is the earliest going in). The third line of each test case also contains N integers separated by a space, whick are given in the order of coming out of the structure (the first one is the earliest coming out).

Output

For each test case, output your guess in a single line. If the structure can only be a stack, output "stack"; or if the structure can only be a queue, output "queue"; otherwise if the structure can be either a stack or a queue, output "both", or else otherwise output "neither".

Sample Input
4
3
1 2 3
3 2 1
3
1 2 3
1 2 3
3
1 2 1
1 2 1
3
1 2 3
2 3 1
Sample Output
stack
queue
both
neither

---

Author: CAO, Peng
Source: The 6th Zhejiang Provincial Collegiate Programming Contest

题目大意：给你两个序列，第一个序列表示入队列/栈的顺序，第二个表示出队列/栈的顺序，问你这两个序列都能表示哪种情况。

1、对于栈，先进后出。

2、对于队列，先进先出。

思路：直接用STL的栈和队列模拟操作即可。

AC代码：

#include<stdio.h>#include<string.h>#include<stack>#include<queue>using namespace std;int a[1212];int main(){    int t;    scanf("%d",&t);    while(t--)    {        queue<int >s;        stack<int >q;        int n;        scanf("%d",&n);        for(int i=0;i<n;i++)//把序列都入栈和队列        {            int k;            scanf("%d",&k);            s.push(k);            q.push(k);        }        for(int i=0;i<n;i++)        {            scanf("%d",&a[i]);        }        int bushiduilie=0;        int bushizhan=0;        for(int i=0;i<n;i++)//如果对不上队列的情况，那么标记上        {            if(s.front()!=a[i])bushiduilie=1;            s.pop();        }        for(int i=0;i<n;i++)//如果对不上栈的情况，那么也标记上        {            if(q.top()!=a[i])bushizhan=1;            q.pop();        }        if(bushiduilie==0&&bushizhan==0)//以下是各种情况的判断         {            printf("both\n");        }        if(bushiduilie==0&&bushizhan==1)        {            printf("queue\n");        }        if(bushiduilie==1&&bushizhan==0)        {            printf("stack\n");        }        if(bushiduilie==1&&bushizhan==1)        {            printf("neither\n");        }    }}