# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
655408 |
2022-11-04T09:40:21 Z |
piOOE |
Triple Jump (JOI19_jumps) |
C++17 |
|
39 ms |
30152 KB |
#include <bits/stdc++.h>
using namespace std;
constexpr int inf = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
auto func = [&](int i, int j) {
return a[i] > a[j] ? i : j;
};
const int max_log = __lg(n) + bool(n & (n - 1));
vector<vector<int>> st(max_log);
st[0].resize(n);
iota(st[0].begin(), st[0].end(), 0);
for (int i = 1; i < max_log; ++i) {
st[i].resize(n - (1 << i) + 1);
for (int j = 0; j < (int) st[i].size(); ++j) {
st[i][j] = func(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);
}
}
vector<int> logn(n + 1);
for (int i = 2; i <= n; ++i) {
logn[i] = logn[i >> 1] + 1;
}
auto query = [&](int l, int r) {
int lg = logn[r - l];
return func(st[lg][l], st[lg][r - (1 << lg)]);
};
auto comp = [&](array<int, 3> x, array<int, 3> y) {
return a[x[0]] > a[y[0]];
};
int q;
cin >> q;
while (q--) {
int l, r;
cin >> l >> r;
--l;
vector<int> p;
set<array<int, 3>, decltype(comp)> pq(comp);
pq.insert(array{a[query(l, r)], l, r});
for (int t = 1; t <= 25 && !pq.empty(); ++t) {
auto [i, L, R] = *pq.begin();
pq.erase(pq.begin());
p.push_back(i);
if (L < i) {
pq.insert({query(L, i), L, i});
}
if (i + 1 < R) {
pq.insert({query(i + 1, R), i + 1, R});
}
while (pq.size() > 25) pq.erase(prev(pq.end()));
}
int ans = 0;
auto relax = [&](int i, int j) {
int R = j + (j - i);
if (R < r) {
ans = max(ans, a[i] + a[j] + a[query(R, r)]);
}
int len = j - i - 1;
if (len > 0) {
ans = max(ans, a[i] + a[j] + a[query(i + 1, i + 1 + ((len + 1) / 2))]);
}
int L = max(l, i - (j - i));
if (L < i) {
ans = max(ans, a[i] + a[j] + a[query(L, i)]);
}
};
sort(p.begin(), p.end());
vector<int> stk;
for (int i : p) {
while (!stk.empty() && a[stk.back()] <= a[i]) {
relax(stk.back(), i);
stk.pop_back();
}
if (!stk.empty()) {
relax(stk.back(), i);
}
stk.push_back(i);
}
cout << ans << '\n';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
340 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
340 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
39 ms |
30152 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
340 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |