# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
398080 |
2021-05-03T15:49:35 Z |
ntabc05101 |
Editor (BOI15_edi) |
C++14 |
|
218 ms |
34884 KB |
#include<bits/stdc++.h>
using namespace std;
const int mxN = 300000;
const int lgN = 19;
int a[mxN + 5], w[mxN + 5], par[mxN + 5][lgN + 5];
int get_par(int u, int mx_w) {
if (w[u] <= mx_w) return u;
for (int i = lgN - 1; i >= 0; i--) {
if (w[par[u][i]] > mx_w) {
u = par[u][i];
}
}
return par[u][0];
}
int main() {
cin.tie(0)->sync_with_stdio(0);
int n; cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] < 0) {
w[i] = -a[i];
int b = get_par(i - 1, w[i] - 1);
par[i][0] = get_par(b - 1, w[i] - 1);
for (int j = 1; j < lgN; j++) par[i][j] = par[par[i][j - 1]][j - 1];
}
cout << a[get_par(i, 0)] << "\n";
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
3 ms |
588 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
4 ms |
844 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
3 ms |
844 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
3 ms |
844 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
153 ms |
32708 KB |
Output is correct |
2 |
Correct |
133 ms |
32708 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
64 ms |
9064 KB |
Output is correct |
2 |
Correct |
72 ms |
12008 KB |
Output is correct |
3 |
Correct |
167 ms |
26836 KB |
Output is correct |
4 |
Correct |
133 ms |
34216 KB |
Output is correct |
5 |
Correct |
129 ms |
34884 KB |
Output is correct |
6 |
Correct |
121 ms |
32164 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
3 ms |
588 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
4 ms |
844 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
3 ms |
844 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
3 ms |
844 KB |
Output is correct |
10 |
Correct |
153 ms |
32708 KB |
Output is correct |
11 |
Correct |
133 ms |
32708 KB |
Output is correct |
12 |
Correct |
64 ms |
9064 KB |
Output is correct |
13 |
Correct |
72 ms |
12008 KB |
Output is correct |
14 |
Correct |
167 ms |
26836 KB |
Output is correct |
15 |
Correct |
133 ms |
34216 KB |
Output is correct |
16 |
Correct |
129 ms |
34884 KB |
Output is correct |
17 |
Correct |
121 ms |
32164 KB |
Output is correct |
18 |
Correct |
132 ms |
20192 KB |
Output is correct |
19 |
Correct |
120 ms |
20012 KB |
Output is correct |
20 |
Correct |
218 ms |
33416 KB |
Output is correct |
21 |
Correct |
146 ms |
34264 KB |
Output is correct |
22 |
Correct |
128 ms |
34864 KB |
Output is correct |