zoj3210 A Stack or A Queue?
2015-07-27 22:26
387 查看
A Stack or A Queue?
Submit Status
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
Source
The 6th Zhejiang Provincial Collegiate Programming Contest
分析:
水题。
ac代码:
#include <iostream>
#include<cstdio>
using namespace std;
int a[105],b[105];
int main()
{
int t,n,i;
bool flag[4];
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
scanf("%d",&b[i]);
}
for(i=0;i<4;i++)
flag[i]=false;//
for(i=0;i<n/2;i++)
{
if(a[i]!=a[n-i-1])
{
flag[0]=true;
break;
}
}
if(!flag[0])
{
printf("both\n");
}
else
{
for(i=0;i<n;i++)
{
if(a[i]!=b[i])
{
flag[1]=true;
break;
}
}
if(!flag[1])
{
printf("queue\n");
}
else
{
for(i=0;i<n;i++)
{
if(a[i]!=b[n-i-1])
{
flag[2]=true;
break;
}
}
if(!flag[2])
{
printf("stack\n");
}
else
{
printf("neither\n");
}
}
}
}
return 0;
}
Time Limit: 1000MS | Memory Limit: 32768KB | 64bit IO Format: %lld & %llu |
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
Source
The 6th Zhejiang Provincial Collegiate Programming Contest
分析:
水题。
ac代码:
#include <iostream>
#include<cstdio>
using namespace std;
int a[105],b[105];
int main()
{
int t,n,i;
bool flag[4];
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
scanf("%d",&b[i]);
}
for(i=0;i<4;i++)
flag[i]=false;//
for(i=0;i<n/2;i++)
{
if(a[i]!=a[n-i-1])
{
flag[0]=true;
break;
}
}
if(!flag[0])
{
printf("both\n");
}
else
{
for(i=0;i<n;i++)
{
if(a[i]!=b[i])
{
flag[1]=true;
break;
}
}
if(!flag[1])
{
printf("queue\n");
}
else
{
for(i=0;i<n;i++)
{
if(a[i]!=b[n-i-1])
{
flag[2]=true;
break;
}
}
if(!flag[2])
{
printf("stack\n");
}
else
{
printf("neither\n");
}
}
}
}
return 0;
}
相关文章推荐
- Android UI 实战之圆形ImageView
- UI004---图片浏览器
- IOS--UI--LessonDataPersistiser 数据持久化
- UIWindow
- Integer Inquiry
- UI中 View、Label的方法
- Balanced and stabilized quicksort method
- UITableView beginUpdate和endUpdate使用的前提
- Xcode6自动提示图片 KSImageNamed 支持自定义 UIImageNamed(name),UIImageLoad(name, type)方法
- UI第一天
- std::list与std::deque用法
- Day07_request-response
- 使用命令行工具运行Xcode 7 UI Tests
- Quicksum
- LinkedBlockingQueue源码分析
- 黑马程序员——java学习7(152-165)——String类和StringBuffer,StringBuilder
- 3.NSNumber,NSValue,NSData,NSDate及简单数据解析
- leetcode 51: N-Queens
- iOS -UI-视图创建及动画的实现
- Permutation Sequence