oj.uz

답안 #204008

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
204008 2020-02-23T17:03:27 Z atoiz Two Antennas (JOI19_antennas) C++14
100 / 100
 853 ms 44436 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>

using namespace std;

const int INF = 1e9 + 7;

void maximize(int &x, int y)
{ x = (x < y) ? y : x; }

struct SegmentTree
{
	struct Node
	{
		int finalMax, curMax, lazyRhs;

		Node(int _finalMax = -1, int _curMax = -1, int _lazyRhs = INF):
			finalMax(_finalMax), curMax(_curMax), lazyRhs(_lazyRhs) {}

		void updateRhs(int rhs)
		{
			if (lazyRhs > rhs) {
				maximize(finalMax, curMax - (lazyRhs = rhs));
			}
		}

		void push(Node &lChild, Node &rChild)
		{
			if (lazyRhs != INF) {
				lChild.updateRhs(lazyRhs);
				rChild.updateRhs(lazyRhs);
			}
			lazyRhs = INF;
		}

		void pull(Node &lhs, Node &rhs)
		{
			finalMax = max(lhs.finalMax, rhs.finalMax);
			curMax = max(lhs.curMax, rhs.curMax);
		}
	};

	int N;
	vector<Node> nodes;

	SegmentTree(int _N): N(_N)
	{
		nodes.assign(N * 4 + 7, Node());
	}

	void updateRhs(int l, int r, int rhs, int root, int lo, int hi)
	{
		if (hi < l || r < lo) return;
		if (l <= lo && hi <= r) {
			nodes[root].updateRhs(rhs);
			return;
		}

		nodes[root].push(nodes[root << 1], nodes[root << 1 | 1]);
		int mid = (lo + hi) >> 1;
		updateRhs(l, r, rhs, root << 1, lo, mid);
		updateRhs(l, r, rhs, root << 1 | 1, mid + 1, hi);
		nodes[root].pull(nodes[root << 1], nodes[root << 1 | 1]);
	}
	void updateRhs(int l, int r, int rhs)
	{ updateRhs(l, r, rhs, 1, 1, N); }

	void assignLhs(int pos, int lhs, int root, int lo, int hi)
	{
		if (lo == hi) {
			nodes[root].lazyRhs = INF;
			nodes[root].curMax = lhs;
			return;
		}

		nodes[root].push(nodes[root << 1], nodes[root << 1 | 1]);
		int mid = (lo + hi) >> 1;
		if (pos <= mid) assignLhs(pos, lhs, root << 1, lo, mid);
		else assignLhs(pos, lhs, root << 1 | 1, mid + 1, hi);
		nodes[root].pull(nodes[root << 1], nodes[root << 1 | 1]);
	}
	void assignLhs(int pos, int lhs)
	{ assignLhs(pos, lhs, 1, 1, N); }

	int getMax(int l, int r, int root, int lo, int hi)
	{
		if (hi < l || r < lo) return -1;
		if (l <= lo && hi <= r) return nodes[root].finalMax;

		nodes[root].push(nodes[root << 1], nodes[root << 1 | 1]);
		int mid = (lo + hi) >> 1;
		return max(
			getMax(l, r, root << 1, lo, mid),
			getMax(l, r, root << 1 | 1, mid + 1, hi)
		);
	}
	int getMax(int l, int r)
	{ return getMax(l, r, 1, 1, N); }
};

const int MAXN = 200006;
int N, Q;
int H[MAXN], A[MAXN], B[MAXN], ans[MAXN];
vector<pair<int, int>> queries[MAXN];
vector<int> add[MAXN], rem[MAXN];

void solve()
{
	SegmentTree st(N);
	for (int i = 1; i <= N; ++i) {
		for (int j : add[i]) st.assignLhs(j, H[j]);
		for (int j : rem[i]) st.assignLhs(j, -1);

		st.updateRhs(i - B[i], i - A[i], H[i]);
		for (auto q : queries[i]) maximize(ans[q.second], st.getMax(q.first, i));
	}
}

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);

	cin >> N;
	for (int i = 1; i <= N; ++i) {
		cin >> H[i] >> A[i] >> B[i];

		add[min(i + A[i], N + 1)].push_back(i);
		rem[min(i + B[i] + 1, N + 1)].push_back(i);
	}

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

	fill(ans, ans + Q, -1);
	solve();
	int maxH = *max_element(H + 1, H + 1 + N);
	for (int i = 1; i <= N; ++i) H[i] = maxH + 1 - H[i];
	solve();

	for (int i = 0; i < Q; ++i) {
		cout << ans[i] << '\n';
	}
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 14456 KB Output is correct
2 Correct 14 ms 14456 KB Output is correct
3 Correct 15 ms 14456 KB Output is correct
4 Correct 15 ms 14456 KB Output is correct
5 Correct 15 ms 14456 KB Output is correct
6 Correct 15 ms 14456 KB Output is correct
7 Correct 15 ms 14584 KB Output is correct
8 Correct 16 ms 14456 KB Output is correct
9 Correct 14 ms 14456 KB Output is correct
10 Correct 15 ms 14456 KB Output is correct
11 Correct 15 ms 14456 KB Output is correct
12 Correct 14 ms 14460 KB Output is correct
13 Correct 14 ms 14456 KB Output is correct
14 Correct 14 ms 14456 KB Output is correct
15 Correct 15 ms 14456 KB Output is correct
16 Correct 15 ms 14456 KB Output is correct
17 Correct 15 ms 14456 KB Output is correct
18 Correct 14 ms 14456 KB Output is correct
19 Correct 15 ms 14456 KB Output is correct
20 Correct 14 ms 14460 KB Output is correct
21 Correct 16 ms 14456 KB Output is correct
22 Correct 15 ms 14476 KB Output is correct
23 Correct 15 ms 14456 KB Output is correct
24 Correct 14 ms 14456 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 14456 KB Output is correct
2 Correct 14 ms 14456 KB Output is correct
3 Correct 15 ms 14456 KB Output is correct
4 Correct 15 ms 14456 KB Output is correct
5 Correct 15 ms 14456 KB Output is correct
6 Correct 15 ms 14456 KB Output is correct
7 Correct 15 ms 14584 KB Output is correct
8 Correct 16 ms 14456 KB Output is correct
9 Correct 14 ms 14456 KB Output is correct
10 Correct 15 ms 14456 KB Output is correct
11 Correct 15 ms 14456 KB Output is correct
12 Correct 14 ms 14460 KB Output is correct
13 Correct 14 ms 14456 KB Output is correct
14 Correct 14 ms 14456 KB Output is correct
15 Correct 15 ms 14456 KB Output is correct
16 Correct 15 ms 14456 KB Output is correct
17 Correct 15 ms 14456 KB Output is correct
18 Correct 14 ms 14456 KB Output is correct
19 Correct 15 ms 14456 KB Output is correct
20 Correct 14 ms 14460 KB Output is correct
21 Correct 16 ms 14456 KB Output is correct
22 Correct 15 ms 14476 KB Output is correct
23 Correct 15 ms 14456 KB Output is correct
24 Correct 14 ms 14456 KB Output is correct
25 Correct 102 ms 19320 KB Output is correct
26 Correct 28 ms 15096 KB Output is correct
27 Correct 159 ms 21356 KB Output is correct
28 Correct 152 ms 21372 KB Output is correct
29 Correct 105 ms 19320 KB Output is correct
30 Correct 108 ms 19192 KB Output is correct
31 Correct 110 ms 20344 KB Output is correct
32 Correct 151 ms 21368 KB Output is correct
33 Correct 132 ms 20856 KB Output is correct
34 Correct 83 ms 17912 KB Output is correct
35 Correct 148 ms 21240 KB Output is correct
36 Correct 157 ms 21368 KB Output is correct
37 Correct 95 ms 17912 KB Output is correct
38 Correct 151 ms 20344 KB Output is correct
39 Correct 35 ms 15480 KB Output is correct
40 Correct 143 ms 20344 KB Output is correct
41 Correct 114 ms 18808 KB Output is correct
42 Correct 150 ms 20480 KB Output is correct
43 Correct 57 ms 16504 KB Output is correct
44 Correct 147 ms 20344 KB Output is correct
45 Correct 39 ms 15608 KB Output is correct
46 Correct 149 ms 20516 KB Output is correct
47 Correct 49 ms 16124 KB Output is correct
48 Correct 143 ms 20472 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 408 ms 33388 KB Output is correct
2 Correct 461 ms 35560 KB Output is correct
3 Correct 294 ms 29032 KB Output is correct
4 Correct 462 ms 35588 KB Output is correct
5 Correct 205 ms 24064 KB Output is correct
6 Correct 450 ms 35508 KB Output is correct
7 Correct 392 ms 32492 KB Output is correct
8 Correct 455 ms 35572 KB Output is correct
9 Correct 62 ms 17828 KB Output is correct
10 Correct 453 ms 35540 KB Output is correct
11 Correct 259 ms 27504 KB Output is correct
12 Correct 456 ms 35564 KB Output is correct
13 Correct 266 ms 32740 KB Output is correct
14 Correct 250 ms 32964 KB Output is correct
15 Correct 244 ms 32884 KB Output is correct
16 Correct 214 ms 33208 KB Output is correct
17 Correct 270 ms 32944 KB Output is correct
18 Correct 245 ms 33332 KB Output is correct
19 Correct 263 ms 32844 KB Output is correct
20 Correct 249 ms 32684 KB Output is correct
21 Correct 248 ms 32924 KB Output is correct
22 Correct 259 ms 32752 KB Output is correct
23 Correct 256 ms 32748 KB Output is correct
24 Correct 212 ms 33008 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 14456 KB Output is correct
2 Correct 14 ms 14456 KB Output is correct
3 Correct 15 ms 14456 KB Output is correct
4 Correct 15 ms 14456 KB Output is correct
5 Correct 15 ms 14456 KB Output is correct
6 Correct 15 ms 14456 KB Output is correct
7 Correct 15 ms 14584 KB Output is correct
8 Correct 16 ms 14456 KB Output is correct
9 Correct 14 ms 14456 KB Output is correct
10 Correct 15 ms 14456 KB Output is correct
11 Correct 15 ms 14456 KB Output is correct
12 Correct 14 ms 14460 KB Output is correct
13 Correct 14 ms 14456 KB Output is correct
14 Correct 14 ms 14456 KB Output is correct
15 Correct 15 ms 14456 KB Output is correct
16 Correct 15 ms 14456 KB Output is correct
17 Correct 15 ms 14456 KB Output is correct
18 Correct 14 ms 14456 KB Output is correct
19 Correct 15 ms 14456 KB Output is correct
20 Correct 14 ms 14460 KB Output is correct
21 Correct 16 ms 14456 KB Output is correct
22 Correct 15 ms 14476 KB Output is correct
23 Correct 15 ms 14456 KB Output is correct
24 Correct 14 ms 14456 KB Output is correct
25 Correct 102 ms 19320 KB Output is correct
26 Correct 28 ms 15096 KB Output is correct
27 Correct 159 ms 21356 KB Output is correct
28 Correct 152 ms 21372 KB Output is correct
29 Correct 105 ms 19320 KB Output is correct
30 Correct 108 ms 19192 KB Output is correct
31 Correct 110 ms 20344 KB Output is correct
32 Correct 151 ms 21368 KB Output is correct
33 Correct 132 ms 20856 KB Output is correct
34 Correct 83 ms 17912 KB Output is correct
35 Correct 148 ms 21240 KB Output is correct
36 Correct 157 ms 21368 KB Output is correct
37 Correct 95 ms 17912 KB Output is correct
38 Correct 151 ms 20344 KB Output is correct
39 Correct 35 ms 15480 KB Output is correct
40 Correct 143 ms 20344 KB Output is correct
41 Correct 114 ms 18808 KB Output is correct
42 Correct 150 ms 20480 KB Output is correct
43 Correct 57 ms 16504 KB Output is correct
44 Correct 147 ms 20344 KB Output is correct
45 Correct 39 ms 15608 KB Output is correct
46 Correct 149 ms 20516 KB Output is correct
47 Correct 49 ms 16124 KB Output is correct
48 Correct 143 ms 20472 KB Output is correct
49 Correct 408 ms 33388 KB Output is correct
50 Correct 461 ms 35560 KB Output is correct
51 Correct 294 ms 29032 KB Output is correct
52 Correct 462 ms 35588 KB Output is correct
53 Correct 205 ms 24064 KB Output is correct
54 Correct 450 ms 35508 KB Output is correct
55 Correct 392 ms 32492 KB Output is correct
56 Correct 455 ms 35572 KB Output is correct
57 Correct 62 ms 17828 KB Output is correct
58 Correct 453 ms 35540 KB Output is correct
59 Correct 259 ms 27504 KB Output is correct
60 Correct 456 ms 35564 KB Output is correct
61 Correct 266 ms 32740 KB Output is correct
62 Correct 250 ms 32964 KB Output is correct
63 Correct 244 ms 32884 KB Output is correct
64 Correct 214 ms 33208 KB Output is correct
65 Correct 270 ms 32944 KB Output is correct
66 Correct 245 ms 33332 KB Output is correct
67 Correct 263 ms 32844 KB Output is correct
68 Correct 249 ms 32684 KB Output is correct
69 Correct 248 ms 32924 KB Output is correct
70 Correct 259 ms 32752 KB Output is correct
71 Correct 256 ms 32748 KB Output is correct
72 Correct 212 ms 33008 KB Output is correct
73 Correct 718 ms 40168 KB Output is correct
74 Correct 528 ms 36148 KB Output is correct
75 Correct 636 ms 37664 KB Output is correct
76 Correct 834 ms 44436 KB Output is correct
77 Correct 425 ms 30076 KB Output is correct
78 Correct 707 ms 41552 KB Output is correct
79 Correct 758 ms 41364 KB Output is correct
80 Correct 822 ms 44344 KB Output is correct
81 Correct 294 ms 25128 KB Output is correct
82 Correct 668 ms 39988 KB Output is correct
83 Correct 594 ms 35952 KB Output is correct
84 Correct 853 ms 44368 KB Output is correct
85 Correct 449 ms 37564 KB Output is correct
86 Correct 557 ms 40484 KB Output is correct
87 Correct 285 ms 33980 KB Output is correct
88 Correct 518 ms 41016 KB Output is correct
89 Correct 511 ms 38728 KB Output is correct
90 Correct 568 ms 41056 KB Output is correct
91 Correct 357 ms 35356 KB Output is correct
92 Correct 562 ms 40444 KB Output is correct
93 Correct 301 ms 34084 KB Output is correct
94 Correct 561 ms 40808 KB Output is correct
95 Correct 338 ms 35004 KB Output is correct
96 Correct 514 ms 40672 KB Output is correct