This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |