ZOJ 3210 A Stack or A Queue ? 水
2015-08-17 15:26
591 查看
C - A Stack or A Queue?
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu
SubmitStatus
Description
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
Sample Output
ACcode:
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu
SubmitStatus
Description
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
ACcode:
#include <iostream> #include <cstring> #include <cstdio> using namespace std; int a[110],b[110]; int n,ans; void fun(){ ans=0; bool flag1=true,flag2=true; for(int i=0;i<n;++i){ if(a[i]!=b[i])flag1=false; if(b[i]!=a[n-1-i])flag2=false; } if(flag1&&flag2){ printf("both\n"); return; } if(flag1){ printf("queue\n"); return; } if(flag2){ printf("stack\n"); return; } printf("neither\n"); } int main(){ int loop; cin>>loop; while(loop--){ cin>>n; for(int i=0;i<n;++i)cin>>a[i]; for(int i=0;i<n;++i)cin>>b[i]; fun(); } return 0; }
相关文章推荐
- HDFS列式存储Parquet与行式存储(Avro)性能测试-Benchmark(hadoop, Spark, Scala)
- 【CF 570D】Tree Requests
- IOS UItableView得到group如何摆脱的剪裁线条样式问题
- request 和 response 的页面跳转
- POJ_3080_BlueJeans
- That Nice Euler Circuit (好看的一笔画)
- C#子线程中更新ui
- HDU 1711 — Number Sequence简单题
- UVA_10534_WavioSequence
- Refresh Global Unique Identifiers (GUIDs)
- iOS7对UITableViewCell的层级改变
- Ahui Writes Word
- Ahui Writes Word
- MySQL 一般查询日志(General Query Log)
- Android GUI之View布局
- HDU_2227_FindTheNondecreasingSubsequences
- intent中的请求码与结果码
- 64位简体中文 Win10最新版Build 10240.16425镜像下载
- Atlassian Confluence 安装
- POJ_2299_Ultra-QuickSort