ZOJ 3210 A Stack or A Queue ?
来源:互联网 发布:无线网速监控软件 编辑:程序博客网 时间:2024/05/29 17:50
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
431 2 33 2 131 2 31 2 331 2 11 2 131 2 32 3 1
Sample Output
stackqueuebothneither
Author: CAO, Peng
Source: The 6th Zhejiang Provincial Collegiate Programming Contest
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <queue>#include <stack>using namespace std;int T,n,s[105],q[105],num;int flagq,flags;int a[105];int main(){ stack<int> st; queue<int> qu; memset(s,0,sizeof(s)); memset(q,0,sizeof(q)); cin>>T; while(T--) { if(!st.empty()) st.pop(); if(!qu.empty()) qu.pop(); cin>>n; for(int i=1;i<=n;i++) { cin>>num; st.push(num); qu.push(num); } flagq=flags=1; for(int i=1;i<=n;i++) { s[i]=st.top(); st.pop(); q[i]=qu.front(); qu.pop(); } for(int i=1;i<=n;i++) { cin>>a[i]; if(a[i]!=s[i]) flags=0; if(a[i]!=q[i]) flagq=0; } if(flagq&&!flags) cout<<"queue"<<endl; if(!flagq&&flags) cout<<"stack"<<endl; if(flagq&&flags) cout<<"both"<<endl; if(!flagq&&!flags) cout<<"neither"<<endl; } return 0;}
- ZOJ 3210 A Stack or A Queue
- zoj 3210 A Stack or A Queue?
- A Stack or A Queue?(zoj 3210)
- ZOJ 3210 A Stack or A Queue?
- ZOJ 3210 A Stack or A Queue?
- ZOJ 3210 A Stack or A Queue?
- ZOJ 3210 A Stack or A Queue?
- ZOJ#3210:A Stack or A Queue?
- ZOJ 3210 A Stack or A Queue ?
- ZOJ 3210 A Stack or A Queue?
- ZOJ 3210A Stack or A Queue?
- zoj 3210 A Stack or A Queue?
- ZOJ 3210 A Stack or A Queue ? 水
- ZOJ 3210A Stack or A Queue?(暴力)
- ZOJ 3210 A Stack or A Queue?【模拟】
- ZOJ 3210 A Stack or A Queue? 水题
- A Stack or A Queue?
- A Stack or A Queue?
- angular2中自定义window对象
- 图结构练习——BFSDFS——判断可达性
- 十七、Hive 表数据加载、导出、查询
- 访问量分类统计(QQ,微信,微博,网页,网站APP,其他)
- Android中的下拉刷新
- ZOJ 3210 A Stack or A Queue ?
- POJ 2948 Martian Mining
- MAC如果管理多个java版本
- AngularJs基本语法应用(mvc)
- String类型和Date类型的互转,以及其他类型
- 【matlab】 动态绘制三维心形图
- Webpack简介使用教程
- CCF之集合竞价(java)
- synchronized