# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
712780 |
2023-03-19T23:21:28 Z |
study |
Editor (BOI15_edi) |
C++17 |
|
2 ms |
852 KB |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5+1;
int pere[20][N], sufmin[20][N],res[N];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i=1; i<=n; ++i){
int a;
cin >> a;
if (a > 0){
pere[i][0] = i;
res[i] = a;
}
else{
a = -a;
int prev = i-1;
for (int j=19; j>=0; --j){
if (sufmin[j][prev] >= a) prev = pere[j][prev];
}
// undo operation prev
// cout << "undo " << prev-1 << endl;
res[i] = res[prev-1];
pere[0][i] = res[prev-1];
sufmin[0][i] = a;
for (int j=1; j<20; ++j){
pere[j][i] = pere[j-1][pere[j-1][i]];
sufmin[j][i] = min(sufmin[j-1][i],sufmin[j-1][sufmin[j-1][i]]);
}
}
cout << res[i] << '\n';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2 ms |
852 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2 ms |
724 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |