제출 #66466

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
66466		Benq	Editor (BOI15_edi)	C++11	100 / 100	270 ms	99116 KiB

edi

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 300001;

template<class T> struct pseg {
    static const int LIMIT = 10000000;
    int l[LIMIT], r[LIMIT], nex = 0;
    T val[LIMIT];
    
    //// HELPER
    int copy(int cur) {
        int x = nex++;
        val[x] = val[cur], l[x] = l[cur], r[x] = r[cur];
        return x;
    }
    T comb(T a, T b) { return min(a,b); }
    void pull(int x) { val[x] = comb(val[l[x]],val[r[x]]); }
    
    int upd(int cur, int ind, int v, int L, int R) {
        int CUR = copy(cur);
        if (L == R) {
            val[CUR] = v;
            return CUR;
        }
        int M = (L+R)/2;
        if (ind <= M) l[CUR] = upd(l[cur],ind,v,L,M);
        else r[CUR] = upd(r[cur],ind,v,M+1,R);
        pull(CUR);
        return CUR;
    }
    
    int getFst(int cur, int v, int L, int R) {
        if (L == R) return L;
        int M = (L+R)/2;
        if (val[r[cur]] < v) return getFst(r[cur],v,M+1,R);
        return getFst(l[cur],v,L,M);
    }
    
    int build(int L, int R) {
        int z = nex++; val[z] = MOD;
        if (L == R) return z;
        int M = (L+R)/2;
        l[z] = build(L,M), r[z] = build(M+1,R);
        return z;
    }
};

pseg<int> p;
int loc[MX], n, ans[MX];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    loc[0] = p.build(1,n);
    FOR(i,1,n+1) {
        int z; cin >> z;
        if (z > 0) {
            ans[i] = z;
            loc[i] = p.upd(loc[i-1],i,0,1,n);
        } else {
            int x = p.getFst(loc[i-1],-z,1,n)-1;
            ans[i] = ans[x];
            loc[i] = p.upd(loc[x],i,-z,1,n);
        }
        cout << ans[i] << "\n";
    }
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

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