| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 690971 |
2023-01-30T19:48:15 Z |
EthanKim8683 |
Editor (BOI15_edi) |
C++17 |
|
195 ms |
27876 KB |
#include<bits/stdc++.h>
using namespace std;
using I=int;
const I N=300000;
const I LOGN=19;
I a_arr[N];
I ancs[N][LOGN];
void bld(I i){
for(I j=1;j<LOGN;j++)ancs[i][j]=ancs[ancs[i][j-1]][j-1];
}
I fnd(I i,I a){
if(max(-a_arr[i],0)<a)return i;
for(I j=LOGN-1;j>=0;j--){
I k=ancs[i][j];
if(max(-a_arr[k],0)>=a)i=k;
}
return ancs[i][0];
}
I main(){
cin.tie(0)->sync_with_stdio(0);
I n;cin>>n;
for(I i=0;i<n;i++)cin>>a_arr[i+1];
for(I i=1;i<n+1;i++){
I a=a_arr[i];
if(a>0)ancs[i][0]=fnd(i-1,1),bld(i);
if(a<0)ancs[i][0]=fnd(max(fnd(i-1,-a)-1,0),-a),bld(i);
printf("%i\n",a_arr[fnd(i,1)]);
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
2 ms |
724 KB |
Output is correct |
| 3 |
Correct |
0 ms |
328 KB |
Output is correct |
| 4 |
Correct |
0 ms |
340 KB |
Output is correct |
| 5 |
Correct |
4 ms |
732 KB |
Output is correct |
| 6 |
Correct |
0 ms |
340 KB |
Output is correct |
| 7 |
Correct |
3 ms |
724 KB |
Output is correct |
| 8 |
Correct |
0 ms |
328 KB |
Output is correct |
| 9 |
Correct |
3 ms |
756 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
149 ms |
27156 KB |
Output is correct |
| 2 |
Correct |
142 ms |
27128 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
69 ms |
13916 KB |
Output is correct |
| 2 |
Correct |
74 ms |
16524 KB |
Output is correct |
| 3 |
Correct |
138 ms |
21172 KB |
Output is correct |
| 4 |
Correct |
144 ms |
27240 KB |
Output is correct |
| 5 |
Correct |
155 ms |
27852 KB |
Output is correct |
| 6 |
Correct |
143 ms |
25132 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
2 ms |
724 KB |
Output is correct |
| 3 |
Correct |
0 ms |
328 KB |
Output is correct |
| 4 |
Correct |
0 ms |
340 KB |
Output is correct |
| 5 |
Correct |
4 ms |
732 KB |
Output is correct |
| 6 |
Correct |
0 ms |
340 KB |
Output is correct |
| 7 |
Correct |
3 ms |
724 KB |
Output is correct |
| 8 |
Correct |
0 ms |
328 KB |
Output is correct |
| 9 |
Correct |
3 ms |
756 KB |
Output is correct |
| 10 |
Correct |
149 ms |
27156 KB |
Output is correct |
| 11 |
Correct |
142 ms |
27128 KB |
Output is correct |
| 12 |
Correct |
69 ms |
13916 KB |
Output is correct |
| 13 |
Correct |
74 ms |
16524 KB |
Output is correct |
| 14 |
Correct |
138 ms |
21172 KB |
Output is correct |
| 15 |
Correct |
144 ms |
27240 KB |
Output is correct |
| 16 |
Correct |
155 ms |
27852 KB |
Output is correct |
| 17 |
Correct |
143 ms |
25132 KB |
Output is correct |
| 18 |
Correct |
135 ms |
27800 KB |
Output is correct |
| 19 |
Correct |
148 ms |
27636 KB |
Output is correct |
| 20 |
Correct |
195 ms |
26436 KB |
Output is correct |
| 21 |
Correct |
143 ms |
27096 KB |
Output is correct |
| 22 |
Correct |
143 ms |
27876 KB |
Output is correct |
