# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
951486 |
2024-03-22T03:21:52 Z |
Trisanu_Das |
Editor (BOI15_edi) |
C++17 |
|
3000 ms |
5736 KB |
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
using namespace std;
const int MAXN = 300010, LOG=18;
int n, x, ans[MAXN], par[MAXN], mn[MAXN];
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>n;
for (int i=1; i<=n; i++){
cin>>x;
if (x>0){
par[i]=i;
ans[i]=x;
}
else{
mn[i]=x=-x;
int v=i-1;
while (mn[v]>=x) v=par[v];
par[i]=v-1;
ans[i]=ans[par[i]];
}
cout<<ans[i]<<'\n';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2396 KB |
Output is correct |
2 |
Correct |
1 ms |
2396 KB |
Output is correct |
3 |
Correct |
1 ms |
2396 KB |
Output is correct |
4 |
Correct |
1 ms |
2396 KB |
Output is correct |
5 |
Correct |
6 ms |
2396 KB |
Output is correct |
6 |
Correct |
1 ms |
2396 KB |
Output is correct |
7 |
Correct |
1 ms |
2396 KB |
Output is correct |
8 |
Correct |
1 ms |
2396 KB |
Output is correct |
9 |
Correct |
2 ms |
2392 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
39 ms |
5716 KB |
Output is correct |
2 |
Correct |
38 ms |
5736 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
27 ms |
3920 KB |
Output is correct |
2 |
Correct |
23 ms |
5456 KB |
Output is correct |
3 |
Execution timed out |
3048 ms |
4928 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2396 KB |
Output is correct |
2 |
Correct |
1 ms |
2396 KB |
Output is correct |
3 |
Correct |
1 ms |
2396 KB |
Output is correct |
4 |
Correct |
1 ms |
2396 KB |
Output is correct |
5 |
Correct |
6 ms |
2396 KB |
Output is correct |
6 |
Correct |
1 ms |
2396 KB |
Output is correct |
7 |
Correct |
1 ms |
2396 KB |
Output is correct |
8 |
Correct |
1 ms |
2396 KB |
Output is correct |
9 |
Correct |
2 ms |
2392 KB |
Output is correct |
10 |
Correct |
39 ms |
5716 KB |
Output is correct |
11 |
Correct |
38 ms |
5736 KB |
Output is correct |
12 |
Correct |
27 ms |
3920 KB |
Output is correct |
13 |
Correct |
23 ms |
5456 KB |
Output is correct |
14 |
Execution timed out |
3048 ms |
4928 KB |
Time limit exceeded |
15 |
Halted |
0 ms |
0 KB |
- |