Submission #368123

# Submission time Handle Problem Language Result Execution time Memory
368123 2021-02-19T15:27:45 Z ACmachine Editor (BOI15_edi) C++17
100 / 100
249 ms 42220 KB
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

    
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int n; cin >> n;
    vector<int> lev(n + 1, 0);
    vector<vector<int>> nxt(n + 1, vector<int>(20, 0));
	vector<int> a(n + 1, 0); 
    FOR(i, 1, n + 1, 1) cin >> a[i];
    auto get_par = [&](int i, int height){
        if(lev[i] <= height) return i;
        REPD(j, 19) if(lev[nxt[i][j]] > height) i = nxt[i][j];
        return nxt[i][0];
    };
    FOR(i, 1, n + 1, 1){
        if(a[i] < 0){
            lev[i] = -a[i];
            int pf = get_par(i - 1, lev[i] - 1);
            nxt[i][0] = get_par(pf - 1, lev[i] - 1);
            FOR(j, 1, 20, 1) nxt[i][j] = nxt[nxt[i][j-1]][j-1];
        }  
        cout << a[get_par(i, 0)] << "\n";
    }
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 3 ms 1004 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 3 ms 1004 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 3 ms 1004 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 1152 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 143 ms 41364 KB Output is correct
2 Correct 135 ms 41324 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 63 ms 20972 KB Output is correct
2 Correct 80 ms 25068 KB Output is correct
3 Correct 177 ms 32492 KB Output is correct
4 Correct 131 ms 41292 KB Output is correct
5 Correct 131 ms 41964 KB Output is correct
6 Correct 129 ms 39404 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 3 ms 1004 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 3 ms 1004 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 3 ms 1004 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 1152 KB Output is correct
10 Correct 143 ms 41364 KB Output is correct
11 Correct 135 ms 41324 KB Output is correct
12 Correct 63 ms 20972 KB Output is correct
13 Correct 80 ms 25068 KB Output is correct
14 Correct 177 ms 32492 KB Output is correct
15 Correct 131 ms 41292 KB Output is correct
16 Correct 131 ms 41964 KB Output is correct
17 Correct 129 ms 39404 KB Output is correct
18 Correct 127 ms 41964 KB Output is correct
19 Correct 139 ms 41836 KB Output is correct
20 Correct 249 ms 40556 KB Output is correct
21 Correct 127 ms 41324 KB Output is correct
22 Correct 136 ms 42220 KB Output is correct