DataStructure/Double_end_priority_queue.test.cpp

• View this file on GitHub
• Last update: 2025-06-11 15:37:14+07:00
• Problem: https://judge.yosupo.jp/problem/double_ended_priority_queue

Depends on

• template.h

Code

#define PROBLEM "https://judge.yosupo.jp/problem/double_ended_priority_queue"

#include "../template.h"

void solve() {
    int n, q; cin >> n >> q;
    priority_queue<int> maxElement;
    priority_queue<int, vector<int>, greater<int>> minElement;
    unordered_map<int, int> maxRev, minRev;
    for (int i = 0; i < n; i++) {
        int x; cin >> x;
        maxElement.push(x);
        minElement.push(x);
    }
    auto lazyRev = [&]() {
        while (!maxElement.empty() && maxRev[maxElement.top()] > 0) {
            maxRev[maxElement.top()]--;
            maxElement.pop();
        }
        while (!minElement.empty() && minRev[minElement.top()] > 0) {
            minRev[minElement.top()]--;
            minElement.pop();
        }
    };
    while (q--) {
        int tv; cin >> tv;
        if (tv == 0) {
            int x; cin >> x;
            maxElement.push(x);
            minElement.push(x);
        } else if (tv == 1) {
            lazyRev();
            int mn = minElement.top();
            minElement.pop();
            maxRev[mn]++;
            cout << mn << '\n';
        } else if (tv == 2) {
            lazyRev();
            int mx = maxElement.top();
            maxElement.pop();
            minRev[mx]++;
            cout << mx << '\n';
        }
    }
}

#line 1 "DataStructure/Double_end_priority_queue.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/double_ended_priority_queue"

#line 2 "template.h"

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define MOD (ll)(1e9+7)
#define all(x) (x).begin(),(x).end()
#define unique(x) x.erase(unique(all(x)), x.end())
#define INF32 ((1ull<<31)-1)
#define INF64 ((1ull<<63)-1)
#define inf (ll)1e18

#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

const int mod = 998244353;

void solve();

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    // cin.exceptions(cin.failbit);
    // int t; cin >> t;
    // while(t--)
        solve();
    cerr << "\nTime run: " << 1000 * clock() / CLOCKS_PER_SEC << "ms" << '\n';
    return 0;
}
#line 4 "DataStructure/Double_end_priority_queue.test.cpp"

void solve() {
    int n, q; cin >> n >> q;
    priority_queue<int> maxElement;
    priority_queue<int, vector<int>, greater<int>> minElement;
    unordered_map<int, int> maxRev, minRev;
    for (int i = 0; i < n; i++) {
        int x; cin >> x;
        maxElement.push(x);
        minElement.push(x);
    }
    auto lazyRev = [&]() {
        while (!maxElement.empty() && maxRev[maxElement.top()] > 0) {
            maxRev[maxElement.top()]--;
            maxElement.pop();
        }
        while (!minElement.empty() && minRev[minElement.top()] > 0) {
            minRev[minElement.top()]--;
            minElement.pop();
        }
    };
    while (q--) {
        int tv; cin >> tv;
        if (tv == 0) {
            int x; cin >> x;
            maxElement.push(x);
            minElement.push(x);
        } else if (tv == 1) {
            lazyRev();
            int mn = minElement.top();
            minElement.pop();
            maxRev[mn]++;
            cout << mn << '\n';
        } else if (tv == 2) {
            lazyRev();
            int mx = maxElement.top();
            maxElement.pop();
            minRev[mx]++;
            cout << mx << '\n';
        }
    }
}

Back to top page