oj.uz

Submission #763462

# Submission time Handle Problem Language Result Execution time Memory
763462 2023-06-22T10:48:19 Z keta_tsimakuridze Triple Jump (JOI19_jumps) C++14
100 / 100
 1204 ms 107112 KB 
#include<bits/stdc++.h>
#define f first
#define s second
#define int long long
#define pii pair<int,int>
using namespace std;
const int N = 5e5 + 5, mod = 1e9 + 7; // !
pair<int,int> t[4 * N];
int lz[4 * N], a[N];
vector<int> x[N];
vector<pair<int,int>> qry[N];
void build(int u, int l, int r) {
    if(l == r) {
        t[u] = {-0, a[r]};
        return;
    }
    int mid = (l + r) / 2;
    build(2 * u, l, mid); build(2 * u + 1, mid + 1, r);
    t[u] = {max(t[2 * u].f, t[2 * u + 1].f), max(t[2 * u].s, t[2 * u + 1].s)};
}
void push(int u, int l, int r) {
    t[u].f = max(t[u].f, lz[u] + t[u].s);
    if(l != r) {
        lz[2 * u] = max(lz[2 * u], lz[u]);
        lz[2 * u + 1] = max(lz[2 * u + 1], lz[u]);
    }
    lz[u] = 0;
}
void upd(int u, int st,int en, int l, int r, int v) {
    if(lz[u]) push(u, l, r);
    if(l > en || r < st) return;
    if(st <= l && r <= en) {
        lz[u] = v;
        push(u, l, r);
        return;
    }
    int mid = (l + r) / 2;
    upd(2 * u, st, en, l, mid, v); upd(2 * u + 1, st, en, mid + 1, r, v);
    t[u] = {max(t[2 * u].f, t[2 * u + 1].f), max(t[2 * u].s, t[2 * u + 1].s)};
}
int get(int u, int st, int en, int l, int r) {
    if(lz[u]) push(u ,l ,r);
    if(l > en || r < st) return 0;
    if(st <= l && r <= en) return t[u].f;
    int mid = (l + r) / 2;
    return max(get(2 * u, st, en, l, mid), get(2 * u + 1, st, en, mid + 1, r));
}
main(){
    int n;
    cin >> n;
    stack<int> st;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        while(st.size() && a[st.top()] < a[i]) st.pop();
        if(st.size()) x[st.top()].push_back(i);
        st.push(i);
    }
    while(st.size()) st.pop();
    for(int i = n; i >= 1; i--) {
        while(st.size() && a[st.top()] < a[i]) st.pop();
        if(st.size()) x[i].push_back(st.top());
        st.push(i);
    }
    int q; cin >> q;
    vector<int> ans(q +2);
    for(int i = 1; i <= q; i++) {
        int l, r;
        cin >> l >> r;
        qry[l].push_back({i, r});
    }
    build(1, 1, n);
    for(int l = n; l >= 1; l--) {
        for(int j = 0; j < x[l].size(); j++) {
            int r = x[l][j];
            upd(1, 2 * r - l, n, 1, n, a[l] + a[r]);
//            cout << 2 * r - l << " __ " << n << " " << a[l] + a[r] << endl;
        }
        for(int i = 0; i < qry[l].size(); i++) {
            ans[qry[l][i].f] = get(1, l, qry[l][i].s, 1, n);
        }
    }
    for(int i = 1; i <= q; i++) cout << ans[i] << " ";
 }

Compilation message

jumps.cpp:48:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   48 | main(){
      | ^~~~
jumps.cpp: In function 'int main()':
jumps.cpp:73:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |         for(int j = 0; j < x[l].size(); j++) {
      |                        ~~^~~~~~~~~~~~~
jumps.cpp:78:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |         for(int i = 0; i < qry[l].size(); i++) {
      |                        ~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23892 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 11 ms 23764 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 11 ms 23764 KB Output is correct
7 Correct 11 ms 23764 KB Output is correct
8 Correct 11 ms 23764 KB Output is correct
9 Correct 11 ms 23764 KB Output is correct
10 Correct 15 ms 23764 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23892 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 11 ms 23764 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 11 ms 23764 KB Output is correct
7 Correct 11 ms 23764 KB Output is correct
8 Correct 11 ms 23764 KB Output is correct
9 Correct 11 ms 23764 KB Output is correct
10 Correct 15 ms 23764 KB Output is correct
11 Correct 400 ms 46776 KB Output is correct
12 Correct 386 ms 46560 KB Output is correct
13 Correct 360 ms 46704 KB Output is correct
14 Correct 403 ms 46624 KB Output is correct
15 Correct 400 ms 46628 KB Output is correct
16 Correct 381 ms 46120 KB Output is correct
17 Correct 389 ms 46088 KB Output is correct
18 Correct 381 ms 45916 KB Output is correct
19 Correct 394 ms 46600 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 45100 KB Output is correct
2 Correct 111 ms 45540 KB Output is correct
3 Correct 113 ms 45556 KB Output is correct
4 Correct 162 ms 45104 KB Output is correct
5 Correct 203 ms 45064 KB Output is correct
6 Correct 221 ms 45184 KB Output is correct
7 Correct 157 ms 45152 KB Output is correct
8 Correct 161 ms 45116 KB Output is correct
9 Correct 154 ms 45076 KB Output is correct

Subtask #4
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23892 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 11 ms 23764 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 11 ms 23764 KB Output is correct
7 Correct 11 ms 23764 KB Output is correct
8 Correct 11 ms 23764 KB Output is correct
9 Correct 11 ms 23764 KB Output is correct
10 Correct 15 ms 23764 KB Output is correct
11 Correct 400 ms 46776 KB Output is correct
12 Correct 386 ms 46560 KB Output is correct
13 Correct 360 ms 46704 KB Output is correct
14 Correct 403 ms 46624 KB Output is correct
15 Correct 400 ms 46628 KB Output is correct
16 Correct 381 ms 46120 KB Output is correct
17 Correct 389 ms 46088 KB Output is correct
18 Correct 381 ms 45916 KB Output is correct
19 Correct 394 ms 46600 KB Output is correct
20 Correct 167 ms 45100 KB Output is correct
21 Correct 111 ms 45540 KB Output is correct
22 Correct 113 ms 45556 KB Output is correct
23 Correct 162 ms 45104 KB Output is correct
24 Correct 203 ms 45064 KB Output is correct
25 Correct 221 ms 45184 KB Output is correct
26 Correct 157 ms 45152 KB Output is correct
27 Correct 161 ms 45116 KB Output is correct
28 Correct 154 ms 45076 KB Output is correct
29 Correct 1204 ms 102128 KB Output is correct
30 Correct 993 ms 105036 KB Output is correct
31 Correct 977 ms 101020 KB Output is correct
32 Correct 1187 ms 103992 KB Output is correct
33 Correct 1144 ms 104060 KB Output is correct
34 Correct 1032 ms 101656 KB Output is correct
35 Correct 1133 ms 101484 KB Output is correct
36 Correct 1075 ms 101364 KB Output is correct
37 Correct 1072 ms 102972 KB Output is correct
38 Correct 913 ms 106572 KB Output is correct
39 Correct 814 ms 106556 KB Output is correct
40 Correct 852 ms 103272 KB Output is correct
41 Correct 849 ms 102708 KB Output is correct
42 Correct 872 ms 102832 KB Output is correct
43 Correct 866 ms 104524 KB Output is correct
44 Correct 978 ms 106948 KB Output is correct
45 Correct 954 ms 106836 KB Output is correct
46 Correct 870 ms 103696 KB Output is correct
47 Correct 880 ms 103372 KB Output is correct
48 Correct 912 ms 103308 KB Output is correct
49 Correct 983 ms 105328 KB Output is correct
50 Correct 1196 ms 107112 KB Output is correct
51 Correct 985 ms 107084 KB Output is correct
52 Correct 952 ms 104632 KB Output is correct
53 Correct 943 ms 104356 KB Output is correct
54 Correct 1044 ms 104264 KB Output is correct
55 Correct 1014 ms 105916 KB Output is correct