oj.uz

Submission #242524

# Submission time Handle Problem Language Result Execution time Memory
242524 2020-06-28T03:52:29 Z dantoh000 Triple Jump (JOI19_jumps) C++14
100 / 100
 1293 ms 125048 KB 
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
typedef tuple<int,int,int> iii;
int n,q;
int a[500005];
int ans[500005];
vector<ii> good[500005];
vector<ii> query[500005];
struct node{
    int s,e,m,ab,c,abc;
    node *l, *r;
    node (int _s, int _e) : s(_s), e(_e){
        m = (s+e)/2;
        ab = c = abc = 0;
        if (s != e){
            l = new node(s,m);
            r = new node(m+1,e);
            ab = max(l->ab,r->ab);
            c = max(l->c,r->c);
            abc = max(l->ab+r->c,max(l->abc,r->abc));
        }
        else{
            c = a[s];
        }
    }
    void up(int x, int nv){
        if (s == e){
            ab = max(ab,nv);
            abc = ab+c;
            return;
        }
        if (x > m) r->up(x,nv);
        else l->up(x,nv);
        ab = max(l->ab,r->ab);
        c = max(l->c,r->c);
        abc = max(l->ab+r->c,max(l->abc,r->abc));
    }
    iii query(int qs, int qe){
        //printf("segment tree <%d,%d>\n",qs,qe);
        if (qs == s && qe == e){
            return iii(ab,c,abc);
        }
        else if (qs > m) return r->query(qs,qe);
        else if (qe <= m) return l->query(qs,qe);
        else{
            iii L = l->query(qs,m);
            iii R = r->query(m+1,qe);
            int AB = max(get<0>(L),get<0>(R));
            int C = max(get<1>(L),get<1>(R));
            int ABC = max(get<0>(L)+get<1>(R),max(get<2>(L),get<2>(R)));
            return {AB,C,ABC};
        }
    }
} *root;
stack<ii> s;
int main(){
    scanf("%d",&n);
    for (int i = 1; i <= n; i++){
        scanf("%d",&a[i]);
    }
    for (int i = 1; i <= n; i++){
        while (s.size() && s.top().second <= a[i]){
            int A = s.top().first;
            int C = i-A+i;
            int V = a[A] + a[i];
            //printf("stack %d %d\n",A,i);
            if (C <= n) good[A].push_back({C,V});
            s.pop();
        }
        if (s.size()){
            int A = s.top().first;
            int C = i-A+i;
            int V = a[A] + a[i];
            //printf("stack %d %d\n",A,i);
            if (C <= n) good[A].push_back({C,V});
        }
        s.push({i,a[i]});
    }
    scanf("%d",&q);
    for (int i = 0; i < q; i++){
        int l,r;
        scanf("%d%d",&l,&r);
        query[l].push_back({r,i});
    }
    root = new node(1,n);
    for (int i = n; i >= 1; i--){
        for (auto x : good[i]){
            //printf("%d: updating %d with %d\n",i,x.first,x.second);
            root->up(x.first,x.second);
        }
        for (auto x : query[i]){
            //printf("%d: query %d <%d,%d>\n",i,x.second,i,x.first);
            ans[x.second] = get<2>(root->query(i,x.first));
        }
    }
    for (int i = 0; i < q; i++){
        printf("%d\n",ans[i]);
    }

}

Compilation message

jumps.cpp: In function 'int main()':
jumps.cpp:58:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
jumps.cpp:60:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&a[i]);
         ~~~~~^~~~~~~~~~~~
jumps.cpp:80:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&q);
     ~~~~~^~~~~~~~~
jumps.cpp:83:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&l,&r);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23808 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct
3 Correct 18 ms 23808 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 19 ms 23808 KB Output is correct
6 Correct 20 ms 23784 KB Output is correct
7 Correct 18 ms 23808 KB Output is correct
8 Correct 19 ms 23808 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 19 ms 23808 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23808 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct
3 Correct 18 ms 23808 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 19 ms 23808 KB Output is correct
6 Correct 20 ms 23784 KB Output is correct
7 Correct 18 ms 23808 KB Output is correct
8 Correct 19 ms 23808 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 19 ms 23808 KB Output is correct
11 Correct 317 ms 42092 KB Output is correct
12 Correct 321 ms 41976 KB Output is correct
13 Correct 323 ms 42104 KB Output is correct
14 Correct 310 ms 42028 KB Output is correct
15 Correct 333 ms 42104 KB Output is correct
16 Correct 405 ms 41592 KB Output is correct
17 Correct 310 ms 41592 KB Output is correct
18 Correct 314 ms 41392 KB Output is correct
19 Correct 311 ms 41976 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 50808 KB Output is correct
2 Correct 110 ms 49656 KB Output is correct
3 Correct 117 ms 51320 KB Output is correct
4 Correct 163 ms 50808 KB Output is correct
5 Correct 165 ms 50808 KB Output is correct
6 Correct 159 ms 50808 KB Output is correct
7 Correct 170 ms 50912 KB Output is correct
8 Correct 156 ms 50808 KB Output is correct
9 Correct 166 ms 50936 KB Output is correct

Subtask #4
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23808 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct
3 Correct 18 ms 23808 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 19 ms 23808 KB Output is correct
6 Correct 20 ms 23784 KB Output is correct
7 Correct 18 ms 23808 KB Output is correct
8 Correct 19 ms 23808 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 19 ms 23808 KB Output is correct
11 Correct 317 ms 42092 KB Output is correct
12 Correct 321 ms 41976 KB Output is correct
13 Correct 323 ms 42104 KB Output is correct
14 Correct 310 ms 42028 KB Output is correct
15 Correct 333 ms 42104 KB Output is correct
16 Correct 405 ms 41592 KB Output is correct
17 Correct 310 ms 41592 KB Output is correct
18 Correct 314 ms 41392 KB Output is correct
19 Correct 311 ms 41976 KB Output is correct
20 Correct 163 ms 50808 KB Output is correct
21 Correct 110 ms 49656 KB Output is correct
22 Correct 117 ms 51320 KB Output is correct
23 Correct 163 ms 50808 KB Output is correct
24 Correct 165 ms 50808 KB Output is correct
25 Correct 159 ms 50808 KB Output is correct
26 Correct 170 ms 50912 KB Output is correct
27 Correct 156 ms 50808 KB Output is correct
28 Correct 166 ms 50936 KB Output is correct
29 Correct 1210 ms 119416 KB Output is correct
30 Correct 1045 ms 116308 KB Output is correct
31 Correct 1079 ms 120288 KB Output is correct
32 Correct 1200 ms 119416 KB Output is correct
33 Correct 1162 ms 119544 KB Output is correct
34 Correct 1166 ms 117268 KB Output is correct
35 Correct 1123 ms 116720 KB Output is correct
36 Correct 1155 ms 116856 KB Output is correct
37 Correct 1293 ms 118272 KB Output is correct
38 Correct 699 ms 124952 KB Output is correct
39 Correct 714 ms 125048 KB Output is correct
40 Correct 683 ms 121848 KB Output is correct
41 Correct 694 ms 121264 KB Output is correct
42 Correct 695 ms 121232 KB Output is correct
43 Correct 717 ms 123088 KB Output is correct
44 Correct 762 ms 124280 KB Output is correct
45 Correct 757 ms 124384 KB Output is correct
46 Correct 741 ms 121208 KB Output is correct
47 Correct 761 ms 120964 KB Output is correct
48 Correct 742 ms 120952 KB Output is correct
49 Correct 749 ms 122936 KB Output is correct
50 Correct 853 ms 122488 KB Output is correct
51 Correct 852 ms 122616 KB Output is correct
52 Correct 829 ms 120000 KB Output is correct
53 Correct 823 ms 119624 KB Output is correct
54 Correct 830 ms 119928 KB Output is correct
55 Correct 879 ms 121556 KB Output is correct