-
Notifications
You must be signed in to change notification settings - Fork 0
/
11995.cpp
74 lines (69 loc) · 1.25 KB
/
11995.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<vector>
#include<set>
#include<stack>
#include<map>
#include<queue>
#include<sstream>
#define lli long long int
#define ulli unsigned long long int
#define rep(n) for(int i=0;i<n;i++)
#define iterate(x) for(auto itr=x.begin(); itr!=x.end();itr++)
using namespace std;
int main()
{
int n;
while (cin >> n)
{
bool stk = true, q = true, pq = true;
stack<int> myStack;
queue<int> myQ;
priority_queue<int> myPQ;
rep(n)
{
int cmd, tmp;
cin >> cmd;
if (cmd == 1)
{
cin >> tmp;
myStack.push(tmp);
myQ.push(tmp);
myPQ.push(tmp);
}
else
{
int result;
cin >> result;
if (!myStack.empty() && myStack.top() == result)
myStack.pop();
else
stk = false;
if (!myQ.empty() && myQ.front() == result)
myQ.pop();
else
q = false;
if (!myPQ.empty() && myPQ.top() == result)
myPQ.pop();
else
pq = false;
}
}
if (!stk && !q && !pq)
cout << "impossible";
else if (stk && !q && !pq)
cout << "stack";
else if (!stk && q && !pq)
cout << "queue";
else if (!stk && !q && pq)
cout << "priority queue";
else
cout << "not sure";
cout << endl;
}
return 0;
}
//AC