oj.uz

Submission #318728

# Submission time Handle Problem Language Result Execution time Memory
318728 2020-11-03T03:33:07 Z aZvezda Triple Jump (JOI19_jumps) C++14
100 / 100
 1704 ms 117060 KB 
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
#define out(x) "{" << (#x) << ": " << x << "} "

const int MAX_N = 5e5 + 10;
int arr[MAX_N], n;
vector<pair<int, int> > cand, toAdd[MAX_N], queries[MAX_N];
int ans[MAX_N];

struct Node {
	int val, valFull, lazy;
	Node() {val = valFull = lazy = -mod;}
	Node operator +(const Node &other) const {
		Node ret;
		ret.val = max(val, other.val);
		ret.valFull = max(valFull, other.valFull);
		return ret;
	}
};

struct SegTree {
	Node tree[4 * MAX_N];
	void push(int curr, int l, int r) {
		chkmax(tree[curr].valFull, tree[curr].val + tree[curr].lazy);
		if(l != r) {
			chkmax(tree[curr * 2].lazy, tree[curr].lazy);
			chkmax(tree[curr * 2 + 1].lazy, tree[curr].lazy);
		}
		tree[curr].lazy = -mod;
	}
	void addToRoot(int x) {
		chkmax(tree[1].lazy, x);
	}
	int ans(int curr, int l, int r, int ql, int qr) {
		push(curr, l, r);
		if(ql <= l && r <= qr) {
			return tree[curr].valFull;
		} else if(ql > r || qr < l) {
			return 0;
		}
		int m = (l + r) / 2ll;
		return max(ans(curr * 2, l, m, ql, qr), ans(curr * 2 + 1, m + 1, r, ql, qr));
	}
	void upd(int curr, int l, int r, int ind, int val) {
		push(curr, l, r);
		if(l == r && l == ind) {
			chkmax(tree[curr].val, val);
			return;
		} else if(r < ind || l > ind) {
			return;
		}
		int m = (l + r) / 2ll;
		upd(curr * 2, l, m, ind, val);
		upd(curr * 2 + 1, m + 1, r, ind, val);
		tree[curr] = tree[curr * 2] + tree[curr * 2 + 1];
	}
};

SegTree seg;

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	cin >> n;
	for(int i = 0; i < n; i ++) {
		cin >> arr[i];
	}
	stack<int> st;
	for(int i = 0; i < n; i ++) {
		while(!st.empty() && arr[st.top()] < arr[i]) {
			st.pop();
		}
		if(!st.empty()) {
			cand.push_back({st.top(), i});
		}
		st.push(i);
	}
	while(!st.empty()) {st.pop();}
	for(int i = n - 1; i >= 0; i --) {
		while(!st.empty() && arr[st.top()] < arr[i]) {
			st.pop();
		}
		if(!st.empty()) {
			cand.push_back({i, st.top()});
		}
		st.push(i);
	}
	for(int i = 0; i < n - 1; i ++) {
		cand.push_back({i, i + 1});
	}
	for(auto it : cand) {
		if(it.second * 2 - it.first < n) {
			toAdd[it.second * 2 - it.first].push_back({arr[it.first] + arr[it.second], it.first});		
		}
	}
	
	int q;
	cin >> q;
	for(int i = 0; i < q; i ++) {
		int l, r;
		cin >> l >> r;
		queries[r - 1].push_back({l - 1, i});
	}

	for(int i = 0; i < n; i ++) {
		for(auto it : toAdd[i]) {
			seg.upd(1, 0, n - 1, it.second, it.first);
		}
		seg.addToRoot(arr[i]);
		for(auto it : queries[i]) {
			ans[it.second] = seg.ans(1, 0, n - 1, it.first, i);
		}
	}
	
	for(int i = 0; i < q; i ++) {
		cout << ans[i] << endl;
	}
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 47316 KB Output is correct
2 Correct 32 ms 47340 KB Output is correct
3 Correct 33 ms 47492 KB Output is correct
4 Correct 32 ms 47340 KB Output is correct
5 Correct 34 ms 47328 KB Output is correct
6 Correct 33 ms 47340 KB Output is correct
7 Correct 33 ms 47332 KB Output is correct
8 Correct 32 ms 47324 KB Output is correct
9 Correct 32 ms 47340 KB Output is correct
10 Correct 33 ms 47316 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 47316 KB Output is correct
2 Correct 32 ms 47340 KB Output is correct
3 Correct 33 ms 47492 KB Output is correct
4 Correct 32 ms 47340 KB Output is correct
5 Correct 34 ms 47328 KB Output is correct
6 Correct 33 ms 47340 KB Output is correct
7 Correct 33 ms 47332 KB Output is correct
8 Correct 32 ms 47324 KB Output is correct
9 Correct 32 ms 47340 KB Output is correct
10 Correct 33 ms 47316 KB Output is correct
11 Correct 385 ms 66276 KB Output is correct
12 Correct 369 ms 66116 KB Output is correct
13 Correct 379 ms 66124 KB Output is correct
14 Correct 381 ms 66392 KB Output is correct
15 Correct 387 ms 66320 KB Output is correct
16 Correct 381 ms 65748 KB Output is correct
17 Correct 392 ms 65720 KB Output is correct
18 Correct 378 ms 65620 KB Output is correct
19 Correct 378 ms 66148 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 325 ms 64324 KB Output is correct
2 Correct 205 ms 60188 KB Output is correct
3 Correct 212 ms 59416 KB Output is correct
4 Correct 311 ms 64308 KB Output is correct
5 Correct 317 ms 64280 KB Output is correct
6 Correct 312 ms 63868 KB Output is correct
7 Correct 305 ms 63540 KB Output is correct
8 Correct 305 ms 63556 KB Output is correct
9 Correct 315 ms 63884 KB Output is correct

Subtask #4
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 47316 KB Output is correct
2 Correct 32 ms 47340 KB Output is correct
3 Correct 33 ms 47492 KB Output is correct
4 Correct 32 ms 47340 KB Output is correct
5 Correct 34 ms 47328 KB Output is correct
6 Correct 33 ms 47340 KB Output is correct
7 Correct 33 ms 47332 KB Output is correct
8 Correct 32 ms 47324 KB Output is correct
9 Correct 32 ms 47340 KB Output is correct
10 Correct 33 ms 47316 KB Output is correct
11 Correct 385 ms 66276 KB Output is correct
12 Correct 369 ms 66116 KB Output is correct
13 Correct 379 ms 66124 KB Output is correct
14 Correct 381 ms 66392 KB Output is correct
15 Correct 387 ms 66320 KB Output is correct
16 Correct 381 ms 65748 KB Output is correct
17 Correct 392 ms 65720 KB Output is correct
18 Correct 378 ms 65620 KB Output is correct
19 Correct 378 ms 66148 KB Output is correct
20 Correct 325 ms 64324 KB Output is correct
21 Correct 205 ms 60188 KB Output is correct
22 Correct 212 ms 59416 KB Output is correct
23 Correct 311 ms 64308 KB Output is correct
24 Correct 317 ms 64280 KB Output is correct
25 Correct 312 ms 63868 KB Output is correct
26 Correct 305 ms 63540 KB Output is correct
27 Correct 305 ms 63556 KB Output is correct
28 Correct 315 ms 63884 KB Output is correct
29 Correct 1636 ms 111408 KB Output is correct
30 Correct 1265 ms 102740 KB Output is correct
31 Correct 1337 ms 100616 KB Output is correct
32 Correct 1704 ms 111340 KB Output is correct
33 Correct 1704 ms 111408 KB Output is correct
34 Correct 1649 ms 109152 KB Output is correct
35 Correct 1652 ms 108680 KB Output is correct
36 Correct 1621 ms 108696 KB Output is correct
37 Correct 1681 ms 110188 KB Output is correct
38 Correct 1195 ms 117060 KB Output is correct
39 Correct 1221 ms 117016 KB Output is correct
40 Correct 1304 ms 113672 KB Output is correct
41 Correct 1174 ms 113224 KB Output is correct
42 Correct 1171 ms 113236 KB Output is correct
43 Correct 1183 ms 114880 KB Output is correct
44 Correct 1248 ms 116396 KB Output is correct
45 Correct 1245 ms 116436 KB Output is correct
46 Correct 1234 ms 113472 KB Output is correct
47 Correct 1230 ms 112832 KB Output is correct
48 Correct 1263 ms 112956 KB Output is correct
49 Correct 1240 ms 114988 KB Output is correct
50 Correct 1347 ms 114724 KB Output is correct
51 Correct 1361 ms 114708 KB Output is correct
52 Correct 1337 ms 112064 KB Output is correct
53 Correct 1323 ms 111892 KB Output is correct
54 Correct 1339 ms 111736 KB Output is correct
55 Correct 1346 ms 113524 KB Output is correct