oj.uz

Submission #260753

# Submission time Handle Problem Language Result Execution time Memory
260753 2020-08-10T20:32:19 Z limabeans Triple Jump (JOI19_jumps) C++17
100 / 100
 1215 ms 99192 KB 
#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





const int inf = 1e9;

struct node {
    int ab,c,abc;
    node() {
	ab=c=abc=-inf;
    }
    node(int _ab, int _c, int _abc) : ab(_ab), c(_c), abc(_abc) {}
};

struct segtree {
    node merge(node x, node y) {
	return { max(x.ab,y.ab), max(x.c,y.c), max({x.abc,y.abc,x.ab+y.c}) };
	return x;
    }
    int n;
    vector<node> t;
    void init(int n) {
	n += 10;
	this->n = n;
	t.resize(n*4);
    }

    void upd(int v, int tl, int tr, int i, int val, int stat) {
	if (tl == tr) {
	    if (stat==0) {
		t[v].ab=max(t[v].ab, val);
	    } else {
		t[v].c=max(t[v].c, val);
	    }
	    t[v].abc = max(t[v].abc, t[v].ab + t[v].c);
	} else {
	    int tm = (tl+tr)/2;
	    if (i<=tm) {
		upd(2*v,tl,tm,i,val,stat);
	    } else {
		upd(2*v+1,tm+1,tr,i,val,stat);
	    }
	    t[v] = merge(t[2*v], t[2*v+1]);
	}
    }

    node qry(int v, int tl, int tr, int l, int r) {
	if (l>tr || r<tl) {
	    return node();
	}
	if (l <= tl && tr <= r) {
	    return t[v];
	}
	int tm = (tl+tr)/2;
	return merge(qry(2*v,tl,tm,l,r), qry(2*v+1,tm+1,tr,l,r));
    }
};

const int maxn = 5e5+10;



int n;
int A[maxn];
vector<int> B[maxn];

int q;
int ans[maxn];
vector<pair<int,int>> Q[maxn]; //(r,i)
segtree tree;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);
    cin>>n;
    tree.init(n+10);
    
    for (int i=1; i<=n; i++) {
	cin>>A[i];
	tree.upd(1,1,n,i,A[i],1);
    }
    

    cin>>q;
    for (int i=0; i<q; i++) {
	int l,r;
	cin>>l>>r;
	Q[l].push_back({r,i});
    }

    stack<int> stk;
    for (int i=1; i<=n; i++) {
	while (!stk.empty() && A[stk.top()] <= A[i]) {
	    B[stk.top()].push_back(i);
	    stk.pop();
	}
	if (!stk.empty()) {
	    B[stk.top()].push_back(i);
	}
	stk.push(i);
    }

    for (int a=n; a>=1; a--) {
	for (int b: B[a]) {
	    int c = b+(b-a);
	    if (c <= n) {
		tree.upd(1,1,n,c,A[a]+A[b],0);
	    }
	}
	for (auto qq: Q[a]) {
	    int idx = qq.second;
	    int r = qq.first;

	    ans[idx] = tree.qry(1,1,n,a,r).abc;
	}
    }

    for (int i=0; i<q; i++) {
	cout<<ans[i]<<"\n";
    }
    
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23808 KB Output is correct
2 Correct 16 ms 23808 KB Output is correct
3 Correct 16 ms 23808 KB Output is correct
4 Correct 16 ms 23808 KB Output is correct
5 Correct 16 ms 23808 KB Output is correct
6 Correct 16 ms 23808 KB Output is correct
7 Correct 16 ms 23808 KB Output is correct
8 Correct 20 ms 23808 KB Output is correct
9 Correct 18 ms 23808 KB Output is correct
10 Correct 17 ms 23808 KB Output is correct
11 Correct 407 ms 37496 KB Output is correct
12 Correct 367 ms 37372 KB Output is correct
13 Correct 392 ms 37368 KB Output is correct
14 Correct 416 ms 37496 KB Output is correct
15 Correct 355 ms 37496 KB Output is correct
16 Correct 369 ms 36856 KB Output is correct
17 Correct 362 ms 36856 KB Output is correct
18 Correct 366 ms 36728 KB Output is correct
19 Correct 364 ms 37368 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 42232 KB Output is correct
2 Correct 127 ms 41976 KB Output is correct
3 Correct 128 ms 42872 KB Output is correct
4 Correct 170 ms 42232 KB Output is correct
5 Correct 174 ms 42232 KB Output is correct
6 Correct 161 ms 41592 KB Output is correct
7 Correct 165 ms 41592 KB Output is correct
8 Correct 161 ms 41464 KB Output is correct
9 Correct 170 ms 42104 KB Output is correct

Subtask #4
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23808 KB Output is correct
2 Correct 16 ms 23808 KB Output is correct
3 Correct 16 ms 23808 KB Output is correct
4 Correct 16 ms 23808 KB Output is correct
5 Correct 16 ms 23808 KB Output is correct
6 Correct 16 ms 23808 KB Output is correct
7 Correct 16 ms 23808 KB Output is correct
8 Correct 20 ms 23808 KB Output is correct
9 Correct 18 ms 23808 KB Output is correct
10 Correct 17 ms 23808 KB Output is correct
11 Correct 407 ms 37496 KB Output is correct
12 Correct 367 ms 37372 KB Output is correct
13 Correct 392 ms 37368 KB Output is correct
14 Correct 416 ms 37496 KB Output is correct
15 Correct 355 ms 37496 KB Output is correct
16 Correct 369 ms 36856 KB Output is correct
17 Correct 362 ms 36856 KB Output is correct
18 Correct 366 ms 36728 KB Output is correct
19 Correct 364 ms 37368 KB Output is correct
20 Correct 169 ms 42232 KB Output is correct
21 Correct 127 ms 41976 KB Output is correct
22 Correct 128 ms 42872 KB Output is correct
23 Correct 170 ms 42232 KB Output is correct
24 Correct 174 ms 42232 KB Output is correct
25 Correct 161 ms 41592 KB Output is correct
26 Correct 165 ms 41592 KB Output is correct
27 Correct 161 ms 41464 KB Output is correct
28 Correct 170 ms 42104 KB Output is correct
29 Correct 1215 ms 93384 KB Output is correct
30 Correct 1097 ms 92996 KB Output is correct
31 Correct 1032 ms 94828 KB Output is correct
32 Correct 1122 ms 93468 KB Output is correct
33 Correct 1121 ms 93560 KB Output is correct
34 Correct 1112 ms 91128 KB Output is correct
35 Correct 1118 ms 90744 KB Output is correct
36 Correct 1171 ms 90872 KB Output is correct
37 Correct 1155 ms 92280 KB Output is correct
38 Correct 851 ms 99192 KB Output is correct
39 Correct 860 ms 99064 KB Output is correct
40 Correct 828 ms 95868 KB Output is correct
41 Correct 827 ms 95352 KB Output is correct
42 Correct 820 ms 95352 KB Output is correct
43 Correct 843 ms 97088 KB Output is correct
44 Correct 901 ms 98536 KB Output is correct
45 Correct 893 ms 98588 KB Output is correct
46 Correct 875 ms 95316 KB Output is correct
47 Correct 879 ms 94904 KB Output is correct
48 Correct 881 ms 94968 KB Output is correct
49 Correct 877 ms 97016 KB Output is correct
50 Correct 968 ms 96504 KB Output is correct
51 Correct 959 ms 96480 KB Output is correct
52 Correct 930 ms 93944 KB Output is correct
53 Correct 934 ms 93560 KB Output is correct
54 Correct 953 ms 93560 KB Output is correct
55 Correct 960 ms 95224 KB Output is correct