# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
564007 |
2022-05-18T12:16:46 Z |
KoD |
Editor (BOI15_edi) |
C++17 |
|
3000 ms |
6360 KB |
#include <bits/stdc++.h>
using std::vector;
using std::array;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int N;
std::cin >> N;
vector<int> op(N);
for (auto& x : op) {
std::cin >> x;
}
vector<char> active(N);
vector<int> par(N);
vector<int> prev(N);
for (int i = 0; i < N; ++i) {
active[i] = true;
if (op[i] < 0) {
int j = i - 1;
while (op[j] <= op[i] or !active[j]) {
j -= 1;
}
par[i] = j;
prev[i] = j - 1;
int k = i;
while (op[k] < 0) {
active[par[k]] ^= 1;
k = par[k];
}
{
int x = i - 1;
while (op[x] <= op[i]) {
x = prev[x];
}
assert(x == j);
}
} else {
par[i] = -1;
prev[i] = i;
}
int ans = 0;
for (int j = i; j >= 0; --j) {
if (active[j] and op[j] > 0) {
ans = op[j];
break;
}
}
std::cout << ans << '\n';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
9 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
50 ms |
412 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
2 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
712 ms |
6260 KB |
Output is correct |
2 |
Correct |
790 ms |
6360 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3082 ms |
3404 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
9 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
50 ms |
412 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
2 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
712 ms |
6260 KB |
Output is correct |
11 |
Correct |
790 ms |
6360 KB |
Output is correct |
12 |
Execution timed out |
3082 ms |
3404 KB |
Time limit exceeded |
13 |
Halted |
0 ms |
0 KB |
- |