UVA - 11995

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).
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.

题目大意：有一个袋状的数据结构，支持两个操作：1 x将一个元素x放入包中，2从包里取出一个元素。现给出一系列操作，问该操作过程符合哪种或哪几种数据结构。

思路：模拟stack、queue、priority_queue，判断是否符合这些结构。

代码如下：

#include<cstdio>
#include<stack>
#include<queue>
using namespace std;

const int maxn=1005;
int a[maxn],b[maxn];

bool issta(int n)
{
	int i;
	stack<int> s;
	for (i=0;i<n;i++)
	  if (a[i]==1) s.push(b[i]);
	  else if (!s.empty() && s.top()==b[i]) s.pop();
	  else return false;
	return true;
} 

bool isque(int n)
{
	int i;
	queue<int> q;
	for (i=0;i<n;i++)
	  if (a[i]==1) q.push(b[i]);
	  else if (!q.empty() && q.front()==b[i]) q.pop();
	  else return false;
	return true;
}

bool isprque(int n)
{
	int i;
	priority_queue<int> pq;
	for (i=0;i<n;i++)
	  if (a[i]==1) pq.push(b[i]);
	  else if (!pq.empty() && pq.top()==b[i]) pq.pop();
	  else return false;
	 return true; 
}


int main()
{
	int n,i;
	while (~scanf("%d",&n))
	{ 
	for (i=0;i<n;i++)
	  scanf("%d%d,&",&a[i],&b[i]);
	bool f1,f2,f3;
	f1=issta(n);
	f2=isque(n);
	f3=isprque(n);
	if (!(f1 || f2 || f3)) printf("impossible\n");
	else if (f1 && !f2 && !f3) printf("stack\n");
	else if (!f1 && f2 && !f3) printf("queue\n");
	else if (!f1 && !f2 && f3) printf("priority queue\n");
	else printf("not sure\n");
	} 
	return 0;
 }