제출 #1173750

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1173750		belgianbot	Editor (BOI15_edi)	C++20	15 / 100	64 ms	52808 KiB

edi

/*
    AUTHOR : BELGIANBOT
*/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

template<typename T> void read(T& x) { cin >> x;}
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second);}
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }

#define quit(x) return (void)(cout << x << endl)
#define pb push_back
#define fi first
#define se second
#define ordered_set tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define sz(x) (int)(x.size())
#define YES cout<<"YES\n"
#define NO cout<<"NO\n"
#define QYES quit("YES")
#define QNO quit("NO")
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define int long long
#define double long double


const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;

void solve();

signed main() {
   ios::sync_with_stdio(false);
   cin.tie(0);
   int t = 1;
   //cin >> t;
   while (t--) solve();
   return 0;
}

int k, n, m, p, q;
const int N = 300000;
void solve() {
    cin >> n;
    vector<pair<set<pair<int,int>>,set<pair<int,int>>>> st(n);
    stack<int> active, undone;
    vector<int> val(n);
    for (int i = 0; i < n; i++) {
        int a; cin >> a;
        val[i] = a;
        if (a > 0) {
            st[i].fi.insert({0,i});
            active.push(i);
            cout << val[i] << '\n';
        }
        else {
            a = -a;
            int index1 = -1, index2 = -1;
            if (!active.empty()) {
                int x = active.top();
                auto it = st[x].fi.lower_bound({a,-1});
                if (it != st[x].fi.begin()) {
                    it--;
                    index1 = it->second;
                }
            }
            if (!undone.empty()) {
                int x = undone.top();
                auto it = st[x].fi.lower_bound({a,-1});
                if (it != st[x].fi.begin()) {
                    it--;
                    index2 = it->second;
                }
            }
            if (index1 > index2) {
                int x = active.top(); active.pop();
                swap(st[x].fi, st[x].se);
                auto it = st[x].fi.lower_bound({a,-1});
                st[x].fi.erase(it, st[x].fi.end());
                st[x].fi.insert({a, i});
                undone.push(x);
                if (active.empty()) cout << "0\n";
                else cout << val[active.top()] << '\n';
            }
            else{
                int x = undone.top(); undone.pop();
                swap(st[x].fi, st[x].se);
                auto it = st[x].fi.lower_bound({a,-1});
                st[x].fi.erase(it, st[x].fi.end());
                st[x].fi.insert({a, i});
                active.push(x);
                cout << val[x] << '\n';
            }
        }
    }
}

• Subtask 1: 0 / 20
• Subtask 2: 15 / 15
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37