oj.uz

답안 #620506

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
620506 2022-08-03T06:37:48 Z flappybird 3단 점프 (JOI19_jumps) C++14
100 / 100
 2552 ms 112320 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 505050
#define MAXS 20
#define INF 1e9
#define bb ' '
#define ln '\n'
#define Ln '\n'
#ifdef _MSC_VER
#  include <intrin.h>
#  define __builtin_popcount __popcnt
#endif
#define MOD 1000000007
struct segtree {
	int s;
	vector<int> tree, lazy, l, r;
	void init(int x = 1) {
		if (x >= s) {
			l[x] = r[x] = x - s + 1;
			return;
		}
		init(x * 2);
		init(x * 2 + 1);
		tree[x] = max(tree[x + 1], tree[x * 2 + 1]);
		l[x] = l[x * 2];
		r[x] = r[x * 2 + 1];
	}
	segtree() {}
	segtree(int N) {
		s = 1 << (int)ceil(log2(N));
		tree = lazy = l = r = vector<int>(2 * s + 1);
	}
	inline void prop(int x) {
		if (x >= s) return;
		for (auto c : { 2 * x, 2 * x + 1 }) {
			tree[c] += lazy[x];
			lazy[c] += lazy[x];
		}
		lazy[x] = 0;
	}
	inline void update(int low, int high, int x, int loc = 1) {
		prop(loc);
		if (low == l[loc] && high == r[loc]) {
			tree[loc] += x;
			lazy[loc] += x;
		}
		else {
			if (high <= r[loc * 2]) update(low, high, x, loc * 2);
			else if (low >= l[loc * 2 + 1]) update(low, high, x, loc * 2 + 1);
			else update(low, r[loc * 2], x, loc * 2), update(l[loc * 2 + 1], high, x, loc * 2 + 1);
			tree[loc] = max(tree[loc * 2], tree[loc * 2 + 1]);
		}
	}
	inline int query(int low, int high, int loc = 1) {
		prop(loc);
		if (low == l[loc] && high == r[loc]) return tree[loc];
		if (high <= r[loc * 2]) return query(low, high, loc * 2);
		if (low >= l[loc * 2 + 1]) return query(low, high, loc * 2 + 1);
		return max(query(low, r[loc * 2], loc * 2), query(l[loc * 2 + 1], high, loc * 2 + 1));
	}
};
int A[MAX];
pii query[MAX];
vector<int> st[MAX], qst[MAX];
int ans[MAX];
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int N;
	cin >> N;
	int i;
	stack<int> s;
	segtree seg(N);
	for (i = 1; i <= N; i++) cin >> A[i], seg.tree[i + seg.s - 1] = A[i];
	seg.init();
	for (i = 1; i <= N; i++) {
		while (s.size()) {
			st[s.top()].push_back(i);
			if (A[s.top()] > A[i]) break;
			else s.pop();
		}
		s.push(i);
	}
	int Q;
	cin >> Q;
	int a, b;
	for (i = 1; i <= Q; i++) {
		cin >> a >> b;
		query[i] = pii(a, b);
		qst[a].push_back(i);
	}
	set<pii> vpi;
	vpi.emplace(0, 0);
	vpi.emplace(N + 1, INF);
	for (i = N; i >= 1; i--) {
		for (auto v : st[i]) {
			int e = 2 * v - i;
			if (e > N) continue;
			int X = A[i] + A[v];
			auto it = vpi.upper_bound(pii(e, INF));
			it--;
			if (it->second > X) continue;
			if (it->first == e) {
				auto pv = prev(it);
				int xx = it->second;
				int r = next(it)->first;
				seg.update(e, r - 1, pv->second - xx);
				vpi.erase(it);
				it = pv;
			}
			int p = it->second;
			auto it2 = next(it);
			vector<pii> er;
			for (; it2 != vpi.end(); it2++) {
				if (it2->second > X) break;
				auto it3 = next(it2);
				seg.update(it2->first, it3->first - 1, p - it2->second);
				er.push_back(*it2);
			}
			for (auto v : er) vpi.erase(v);
			it2 = next(it);
			seg.update(e, it2->first - 1, X - it->second);
			vpi.emplace(e, X);
		}
		for (auto q : qst[i]) ans[q] = seg.query(query[q].first, query[q].second);
	}
	for (i = 1; i <= Q; i++) cout << ans[i] << ln;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 24060 KB Output is correct
2 Correct 13 ms 24020 KB Output is correct
3 Correct 13 ms 24020 KB Output is correct
4 Correct 13 ms 24056 KB Output is correct
5 Correct 13 ms 24020 KB Output is correct
6 Correct 15 ms 24024 KB Output is correct
7 Correct 17 ms 24020 KB Output is correct
8 Correct 14 ms 24020 KB Output is correct
9 Correct 16 ms 24068 KB Output is correct
10 Correct 13 ms 24020 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 24060 KB Output is correct
2 Correct 13 ms 24020 KB Output is correct
3 Correct 13 ms 24020 KB Output is correct
4 Correct 13 ms 24056 KB Output is correct
5 Correct 13 ms 24020 KB Output is correct
6 Correct 15 ms 24024 KB Output is correct
7 Correct 17 ms 24020 KB Output is correct
8 Correct 14 ms 24020 KB Output is correct
9 Correct 16 ms 24068 KB Output is correct
10 Correct 13 ms 24020 KB Output is correct
11 Correct 579 ms 43584 KB Output is correct
12 Correct 574 ms 43464 KB Output is correct
13 Correct 559 ms 43504 KB Output is correct
14 Correct 574 ms 43588 KB Output is correct
15 Correct 567 ms 43592 KB Output is correct
16 Correct 561 ms 42948 KB Output is correct
17 Correct 546 ms 42816 KB Output is correct
18 Correct 530 ms 42804 KB Output is correct
19 Correct 550 ms 43436 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 482 ms 40448 KB Output is correct
2 Correct 236 ms 49532 KB Output is correct
3 Correct 576 ms 41056 KB Output is correct
4 Correct 519 ms 40452 KB Output is correct
5 Correct 490 ms 40448 KB Output is correct
6 Correct 497 ms 40496 KB Output is correct
7 Correct 497 ms 40452 KB Output is correct
8 Correct 514 ms 40452 KB Output is correct
9 Correct 485 ms 40448 KB Output is correct

Subtask #4
54.0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 24060 KB Output is correct
2 Correct 13 ms 24020 KB Output is correct
3 Correct 13 ms 24020 KB Output is correct
4 Correct 13 ms 24056 KB Output is correct
5 Correct 13 ms 24020 KB Output is correct
6 Correct 15 ms 24024 KB Output is correct
7 Correct 17 ms 24020 KB Output is correct
8 Correct 14 ms 24020 KB Output is correct
9 Correct 16 ms 24068 KB Output is correct
10 Correct 13 ms 24020 KB Output is correct
11 Correct 579 ms 43584 KB Output is correct
12 Correct 574 ms 43464 KB Output is correct
13 Correct 559 ms 43504 KB Output is correct
14 Correct 574 ms 43588 KB Output is correct
15 Correct 567 ms 43592 KB Output is correct
16 Correct 561 ms 42948 KB Output is correct
17 Correct 546 ms 42816 KB Output is correct
18 Correct 530 ms 42804 KB Output is correct
19 Correct 550 ms 43436 KB Output is correct
20 Correct 482 ms 40448 KB Output is correct
21 Correct 236 ms 49532 KB Output is correct
22 Correct 576 ms 41056 KB Output is correct
23 Correct 519 ms 40452 KB Output is correct
24 Correct 490 ms 40448 KB Output is correct
25 Correct 497 ms 40496 KB Output is correct
26 Correct 497 ms 40452 KB Output is correct
27 Correct 514 ms 40452 KB Output is correct
28 Correct 485 ms 40448 KB Output is correct
29 Correct 2423 ms 89436 KB Output is correct
30 Correct 1805 ms 112320 KB Output is correct
31 Correct 2552 ms 90816 KB Output is correct
32 Correct 2370 ms 89440 KB Output is correct
33 Correct 2340 ms 89444 KB Output is correct
34 Correct 2405 ms 87168 KB Output is correct
35 Correct 2426 ms 86796 KB Output is correct
36 Correct 2448 ms 86848 KB Output is correct
37 Correct 2349 ms 88272 KB Output is correct
38 Correct 2287 ms 96036 KB Output is correct
39 Correct 2255 ms 96084 KB Output is correct
40 Correct 2134 ms 92772 KB Output is correct
41 Correct 1998 ms 92252 KB Output is correct
42 Correct 1995 ms 92184 KB Output is correct
43 Correct 1909 ms 93988 KB Output is correct
44 Correct 2177 ms 95392 KB Output is correct
45 Correct 1988 ms 95484 KB Output is correct
46 Correct 2073 ms 92264 KB Output is correct
47 Correct 2125 ms 91844 KB Output is correct
48 Correct 2011 ms 91984 KB Output is correct
49 Correct 2071 ms 94140 KB Output is correct
50 Correct 2085 ms 93108 KB Output is correct
51 Correct 2135 ms 93244 KB Output is correct
52 Correct 2180 ms 90768 KB Output is correct
53 Correct 2256 ms 90304 KB Output is correct
54 Correct 2117 ms 90380 KB Output is correct
55 Correct 2130 ms 92208 KB Output is correct