UVA - 11995 I Can Guess the Data Structure!

I Can Guess the Data Structure!

Time Limit: 1000MS

Memory Limit: Unknown

64bit IO Format: %lld & %llu

Submit Status

Description

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

---

Rujia Liu's Present 3: A Data Structure Contest Celebrating the 100th Anniversary of Tsinghua University
Special Thanks: Yiming Li
Note: Please make sure to test your program with the gift I/O files before submitting!

分析：

数据结构基础题，就是用来熟悉一下栈，队列，优先队列。模拟即可。

为了编程简便，把三个判断分别写在三个函数里，再用数组传参（数组很小，附加空间很小）。这种编程方式应该是值得学习的。

ac代码：

#include <iostream>
#include<cstdio>
#include<stack>
#include<queue>
using namespace std;
const int maxn=1000+10;
int id[maxn],x[maxn],n;

bool is_stack()
{
    stack<int> s;
    for(int i=0;i<n;i++)
    {
        if(id[i]==1)
        s.push(x[i]);
        else
        {
            if(s.empty())
            return false;
            else
            {
                int val=s.top();
                s.pop();
                if(val!=x[i])
                return false;
            }
        }
    }
    return true;
}


bool is_queue()
{
    queue<int> q;
    for(int i=0;i<n;i++)
    {
        if(id[i]==1)
        q.push(x[i]);
        else
        {
            if(q.empty())
            return false;
            else
            {
                int val=q.front();//注意这里是front，不是top
                q.pop();
                if(val!=x[i])
                return false;
            }
        }
    }
    return true;
}


bool is_priority()
{
    priority_queue<int> pq;
    for(int i=0;i<n;i++)
    {
        if(id[i]==1)
        pq.push(x[i]);
        else
        {
            if(pq.empty())
            return false;
            else
            {
                int val=pq.top();
                pq.pop();
                if(val!=x[i])
                return false;
            }
        }
    }
    return true;
}


int main()
{
    bool st=false,qu=false,pr=false;
    while(scanf("%d",&n)!=EOF)
    {
        for(int i=0;i<n;i++)
        scanf("%d%d",&id[i],&x[i]);
        st=is_stack();
        qu=is_queue();
        pr=is_priority();
        if(st&&!qu&&!pr)
        printf("stack\n");
        else if(qu&&!st&&!pr)
        printf("queue\n");
        else if(pr&&!st&&!qu)
        printf("priority queue\n");
        else if(!st&&!qu&&!pr)
        printf("impossible\n");
        else
        printf("not sure\n");
    }
    return 0;
}