Problem I
I Can Guess the Data Structure!
There is a bag-like data structure, supporting two operations:
1 x
Throw an element x into the bag.
2
Take out an element from the bag.
Given a sequence of operations with return values, you're going to guess the data structure. It is a stack (Last-In, First-Out), a queue (First-In, First-Out), a priority-queue (Always take out larger elements first) or something else that you can hardly imagine!
Input
There are several test cases. Each test case begins with a line containing a single integer n (1<=n<=1000). Each of the next n lines is either a type-1 command, or an integer 2 followed by an integer x. That means after executing a type-2 command, we get an element x without error. The value of x is always a positive integer not larger than 100. The input is terminated by end-of-file (EOF). The size of input file does not exceed 1MB.
Output
For each test case, output one of the following:
stack
It's definitely a stack.
queue
It's definitely a queue.
priority queue
It's definitely a priority queue.
impossible
It can't be a stack, a queue or a priority queue.
not sure
It can be more than one of the three data structures mentioned above.
Sample Input
6 1 1 1 2 1 3 2 1 2 2 2 3 6 1 1 1 2 1 3 2 3 2 2 2 1 2 1 1 2 2 4 1 2 1 1 2 1 2 2 7 1 2 1 5 1 1 1 3 2 5 1 4 2 4
Output for the Sample Input
queue not sure impossible stack priority queue
题意:输入包含多组数据,每组数据第一行为一个整数n(n>=1 && n<=1000),一下n行每行为一个操作1或2(1x表示把x放入,2x为取出一个数为x),问是哪种数据结构。
思路:要想确定是否为stack,queue,priority_queue,那就创建三个相应的对象,然后模拟输入的数据,如果每一次取出来的数和真正的数据结构取出的值相同就认为是的,否则认为不是的。需要注意的是题目说无错的返回,所以要调用一下empty()函数,看取值是是否为空。
#include <iostream>
#include <cstdio>#include <stack>
#include <queue>
using namespace std;
const int MAXN=1010;
int id[MAXN],x[MAXN],n;
bool isstack();
bool isqueue();
bool ispriority_queue();
int main()
{
int i;
bool st=false,qu=false,pq=false;
while(cin>>n)
{
for(i=0;i<n;i++)
cin>>id[i]>>x[i];
st=isstack();
qu=isqueue();
pq=ispriority_queue();
if(!st &&!qu&&!pq)
cout<<"impossible"<<endl;
else if((!st&&qu&&pq) || (st&&!qu&&pq) || (st&&qu&&!pq) || (st&&qu&&pq))
cout<<"not sure"<<endl;
else if(st)
cout<<"stack"<<endl;
else if(qu)
cout<<"queue"<<endl;
else if(pq)
cout<<"priory queue"<<endl;
}
return 0;
}
bool isstack()
{
stack<int> s;
int v,i;
for(i=0;i<n;i++)
{
if(id[i]==1)
s.push(x[i]);
else
{
if(s.empty())
return false;
v=s.top();
s.pop();
if(v!=x[i])
return false;
}
}
return true;
}
bool isqueue()
{
queue<int> q;
int v,i;
for(i=0;i<n;i++)
{
if(id[i]==1)
q.push(x[i]);
else
{
if(q.empty())
return false;
v=q.front();
q.pop();
if(v!=x[i])
return false;
}
}
return true;
}
bool ispriority_queue()
{
priority_queue<int> pq;
int v,i;
for(i=0;i<n;i++)
{
if(id[i]==1)
pq.push(x[i]);
else
{
if(pq.empty())
return false;
v=pq.top();
pq.pop();
if(v!=x[i])
return false;
}
}
return true;
}