# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200619 | 2020-02-07T16:13:27 Z | TadijaSebez | Editor (BOI15_edi) | C++11 | 279 ms | 51324 KB |
#include <bits/stdc++.h> using namespace std; const int N=300050; const int L=19; int a[N],go[N][L],mn[N][L],ans[N]; int main(){ int n; scanf("%i",&n); for(int i=1;i<=n;i++){ scanf("%i",&a[i]); if(a[i]>0)ans[i]=a[i]; else{ int x=-a[i]; int j=i-1; for(int k=L-1;~k;k--)if(mn[j][k]>=x)j=go[j][k]; ans[i]=ans[j-1]; go[i][0]=j-1; mn[i][0]=x; for(int k=1;k<L;k++){ go[i][k]=go[go[i][k-1]][k-1]; mn[i][k]=min(mn[i][k-1],mn[go[i][k-1]][k-1]); } } printf("%i\n",ans[i]); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Correct | 7 ms | 760 KB | Output is correct |
3 | Correct | 5 ms | 376 KB | Output is correct |
4 | Correct | 5 ms | 376 KB | Output is correct |
5 | Correct | 7 ms | 1144 KB | Output is correct |
6 | Correct | 5 ms | 376 KB | Output is correct |
7 | Correct | 7 ms | 1144 KB | Output is correct |
8 | Correct | 5 ms | 248 KB | Output is correct |
9 | Correct | 7 ms | 1144 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 134 ms | 49784 KB | Output is correct |
2 | Correct | 136 ms | 49784 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 65 ms | 14072 KB | Output is correct |
2 | Correct | 75 ms | 16640 KB | Output is correct |
3 | Correct | 227 ms | 39012 KB | Output is correct |
4 | Correct | 135 ms | 49784 KB | Output is correct |
5 | Correct | 147 ms | 49852 KB | Output is correct |
6 | Correct | 172 ms | 48352 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Correct | 7 ms | 760 KB | Output is correct |
3 | Correct | 5 ms | 376 KB | Output is correct |
4 | Correct | 5 ms | 376 KB | Output is correct |
5 | Correct | 7 ms | 1144 KB | Output is correct |
6 | Correct | 5 ms | 376 KB | Output is correct |
7 | Correct | 7 ms | 1144 KB | Output is correct |
8 | Correct | 5 ms | 248 KB | Output is correct |
9 | Correct | 7 ms | 1144 KB | Output is correct |
10 | Correct | 134 ms | 49784 KB | Output is correct |
11 | Correct | 136 ms | 49784 KB | Output is correct |
12 | Correct | 65 ms | 14072 KB | Output is correct |
13 | Correct | 75 ms | 16640 KB | Output is correct |
14 | Correct | 227 ms | 39012 KB | Output is correct |
15 | Correct | 135 ms | 49784 KB | Output is correct |
16 | Correct | 147 ms | 49852 KB | Output is correct |
17 | Correct | 172 ms | 48352 KB | Output is correct |
18 | Correct | 132 ms | 27104 KB | Output is correct |
19 | Correct | 125 ms | 28924 KB | Output is correct |
20 | Correct | 279 ms | 49912 KB | Output is correct |
21 | Correct | 172 ms | 50680 KB | Output is correct |
22 | Correct | 155 ms | 51324 KB | Output is correct |