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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
struct PairHash {inline std::size_t operator()(const std::pair<int,int> & v) const {return v.first*31+v.second;}};
#define MAX_N 202020
#define INF 987654321
#define EPS 1e-9
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all3 array<ll,3>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vi vector<int>
#define vs vector<string>
#define usll unordered_set<ll>
#define uspll unordered_set<pll, PairHash>
#define umll unordered_map<ll,ll>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
using namespace std;
struct CompPoly {
bool operator()(pll& a, pll& b) {
if(a.first == b.first) return a.second > b.second;
return a.first < b.first;
}
};
struct CompMono {
bool operator()(pll& a, pll& b) {
return a.second > b.second;
}
};
ll id = 1;
queue<pll> mono;
priority_queue<pll, vpll, CompMono> rmmono;
priority_queue<pll, vpll, CompPoly> poly, rmpoly;
void qry1() {
ll m;
cin>>m;
mono.push({m, id});
poly.push({m, id});
id++;
}
ll qry2() {
while(!rmmono.empty() and rmmono.top().second == mono.front().second) {
rmmono.pop();
mono.pop();
}
rmpoly.push({mono.front()});
ll res = mono.front().second; mono.pop();
return res;
}
ll qry3() {
while(!rmpoly.empty() and rmpoly.top().second == poly.top().second) {
rmpoly.pop();
poly.pop();
}
rmmono.push({poly.top()});
ll res = poly.top().second; poly.pop();
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll tc = 1;
for(ll i = 1; i <= tc; i++) {
ll q, t;
cin>>q;
for(ll j = 0; j < q; j++) {
cin>>t;
if(t == 1) qry1();
else if(t == 2) cout<<qry2()<<endl;
else if(t == 3) cout<<qry3()<<endl;
}
}
return 0;
}
|
