# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
787690 | 2023-07-19T10:58:05 Z | vjudge1 | Editor (BOI15_edi) | C++17 | 214 ms | 72508 KB |
//i_love_aisukiuwu #include <bits/stdc++.h> using namespace std; #ifdef LOCAL #include "/home/trucmai/.vim/tools.h" #define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl; #else #define debug(x...) #endif void open(){ if(fopen("i.inp","r")){ freopen("i.inp","r",stdin); freopen("o.out","w",stdout); } } #define ll long long #define all(a) (a).begin(), (a).end() #define vi vector<ll> #define pi pair<ll,ll> #define pii pair<ll,pair<ll,ll>> #define fi first #define se second #define gcd __gcd #define mset(a,v) memset(a, v, sizeof(a)) #define endl '\n' #define spc " " const int MN1 = 1e6 + 5,MN2 = 1e4 + 5,LOG = 27; const ll MOD = 1e9 + 7,INF = 1e9; ll n,a[MN1],up[MN1][LOG],lvl[MN1]; void solve(){ cin>>n; for(ll i = 1;i <= n;++i) cin>>a[i]; auto lift=[&](ll u,ll w)->ll{ if(lvl[u] <= w) return u; for(ll i = LOG-1;i >= 0;--i) if(lvl[up[u][i]] > w) u = up[u][i]; return up[u][0]; }; for(ll i = 1;i <= n;++i){ if(a[i] < 0){ lvl[i] = -a[i]; ll tmp = lift(i-1,lvl[i]-1); up[i][0] = lift(tmp-1,lvl[i]-1); //cout<<"DEBUG "<<tmp<<endl; for(ll j = 1;j < LOG;++j) up[i][j] = up[up[i][j-1]][j-1]; } cout<<a[lift(i,0)]<<endl; } } signed main(){ cin.tie(0) -> sync_with_stdio(0); open(); ll t = 1; //cin>>t; while(t--) solve(); #ifdef LOCAL cerr << endl << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; #endif }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 2 ms | 980 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
5 | Correct | 3 ms | 1492 KB | Output is correct |
6 | Correct | 1 ms | 340 KB | Output is correct |
7 | Correct | 3 ms | 1536 KB | Output is correct |
8 | Correct | 1 ms | 332 KB | Output is correct |
9 | Correct | 2 ms | 1492 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 129 ms | 71752 KB | Output is correct |
2 | Correct | 128 ms | 71728 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 59 ms | 19788 KB | Output is correct |
2 | Correct | 66 ms | 23620 KB | Output is correct |
3 | Correct | 173 ms | 56904 KB | Output is correct |
4 | Correct | 129 ms | 71732 KB | Output is correct |
5 | Correct | 120 ms | 72408 KB | Output is correct |
6 | Correct | 116 ms | 69684 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 2 ms | 980 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
5 | Correct | 3 ms | 1492 KB | Output is correct |
6 | Correct | 1 ms | 340 KB | Output is correct |
7 | Correct | 3 ms | 1536 KB | Output is correct |
8 | Correct | 1 ms | 332 KB | Output is correct |
9 | Correct | 2 ms | 1492 KB | Output is correct |
10 | Correct | 129 ms | 71752 KB | Output is correct |
11 | Correct | 128 ms | 71728 KB | Output is correct |
12 | Correct | 59 ms | 19788 KB | Output is correct |
13 | Correct | 66 ms | 23620 KB | Output is correct |
14 | Correct | 173 ms | 56904 KB | Output is correct |
15 | Correct | 129 ms | 71732 KB | Output is correct |
16 | Correct | 120 ms | 72408 KB | Output is correct |
17 | Correct | 116 ms | 69684 KB | Output is correct |
18 | Correct | 116 ms | 39580 KB | Output is correct |
19 | Correct | 107 ms | 39464 KB | Output is correct |
20 | Correct | 214 ms | 70944 KB | Output is correct |
21 | Correct | 129 ms | 71788 KB | Output is correct |
22 | Correct | 119 ms | 72508 KB | Output is correct |