oj.uz

답안 #476635

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
476635 2021-09-27T20:26:01 Z cheissmart Two Antennas (JOI19_antennas) C++17
100 / 100
 764 ms 36404 KB 
#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

string _reset = "\u001b[0m", _yellow = "\u001b[33m", _bold = "\u001b[1m";
void DBG() { cerr << "]" << _reset << endl; }
template<class H, class...T> void DBG(H h, T ...t) {
	cerr << to_string(h);
	if(sizeof ...(t)) cerr << ", ";
	DBG(t...);
}
#ifdef CHEISSMART
#define debug(...) cerr << _yellow << _bold << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define debug(...)
#endif

const int INF = 1e9 + 7, N = 2e5 + 7;
void cmax(int& a, int b) {
	a = max(a, b);
}

int h[N], a[N], b[N], l[N], r[N], ans[N];
vi G[N];

int n;

int seg_a[N];

struct node {
	int base_mx, lz_mx, sum_mx;
	node() {
		base_mx = lz_mx = sum_mx = -INF;
	}
} t[N * 4];

void pull(int v) {
	t[v].base_mx = max(t[v * 2].base_mx, t[v * 2 + 1].base_mx);
	t[v].sum_mx = max(t[v * 2].sum_mx, t[v * 2 + 1].sum_mx);
}

void apply(int v, int x) {
	cmax(t[v].sum_mx, t[v].base_mx + x);
	cmax(t[v].lz_mx, x);
}

void push(int v) {
	apply(v * 2, t[v].lz_mx);
	apply(v * 2 + 1, t[v].lz_mx);
	t[v].lz_mx = -INF;
}

void build(int v = 1, int tl = 0, int tr = n) {
	t[v] = node();
	if(tr - tl == 1) return;
	int tm = (tl + tr) / 2;
	build(v * 2, tl, tm);
	build(v * 2 + 1, tm, tr);
	pull(v);
}

void activate(int pos, bool op, int v = 1, int tl = 0, int tr = n) {
	if(tr - tl == 1) {
		assert(tl == pos);
		if(op)
			t[v].base_mx = seg_a[pos];
		else
			t[v].base_mx = -INF;
		return;
	}
	push(v);
	int tm = (tl + tr) / 2;
	if(pos < tm)
		activate(pos, op, v * 2, tl, tm);
	else
		activate(pos, op, v * 2 + 1, tm, tr);
	pull(v);
}

void upd(int l, int r, int x, int v = 1, int tl = 0, int tr = n) {
	if(l <= tl && tr <= r) {
		apply(v, x);
		return;
	}
	push(v);
	int tm = (tl + tr) / 2;
	if(l < tm)
		upd(l, r, x, v * 2, tl, tm);
	if(r > tm)
		upd(l, r, x, v * 2 + 1, tm, tr);
	pull(v);
}

int qry(int l, int r, int v = 1, int tl = 0, int tr = n) {
	if(l <= tl && tr <= r)
		return t[v].sum_mx;
	push(v);
	int tm = (tl + tr) / 2;
	int ans = -INF;
	if(l < tm)
		cmax(ans, qry(l, r, v * 2, tl, tm));
	if(r > tm)
		cmax(ans, qry(l, r, v * 2 + 1, tm, tr));
	return ans;
}

V<pair<int, bool>> ev[N];

signed main()
{
	IO_OP;
	
	cin >> n;
	for(int i = 0; i < n; i++) {
		cin >> h[i] >> a[i] >> b[i];
	}
	int q;
	cin >> q;
	for(int i = 0; i < q; i++) {
		cin >> l[i] >> r[i];
		l[i]--, r[i]--;
		ans[i] = -1;
	}

	auto solve = [&] () {
		for(int i = 0; i < q; i++) {
			assert(l[i] < r[i]);
			G[r[i]].PB(i);
		}
		for(int i = 0; i < n; i++) {
			int L = i + a[i], R = i + b[i];
			if(L < n) ev[L].EB(i, true);
			if(R + 1 < n) ev[R + 1].EB(i, false);
		}
		for(int i = 0; i < n; i++) {
			seg_a[i] = -h[i];
		}
		build();
		for(int i = 0; i < n; i++) {
			for(auto[x, y]:ev[i]) {
				activate(x, y);
			}
			int L = max(0, i - b[i]), R = i - a[i];
			if(R >= L)
				upd(L, R + 1, h[i]);
			for(int j:G[i]) {
				assert(r[j] == i);
				cmax(ans[j], qry(l[j], i));
			}
		}
		for(int i = 0; i < n; i++) {
			G[i].clear();
			ev[i].clear();
		}
	};

	solve();
	reverse(h, h + n), reverse(a, a + n), reverse(b, b + n);
	for(int i = 0; i < q; i++) {
		l[i] = n - l[i] - 1, r[i] = n - r[i] - 1;
		swap(l[i], r[i]);
	}
	solve();

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

}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 19148 KB Output is correct
2 Correct 10 ms 19128 KB Output is correct
3 Correct 10 ms 19108 KB Output is correct
4 Correct 13 ms 19148 KB Output is correct
5 Correct 10 ms 19148 KB Output is correct
6 Correct 13 ms 19068 KB Output is correct
7 Correct 13 ms 19160 KB Output is correct
8 Correct 16 ms 19080 KB Output is correct
9 Correct 13 ms 19112 KB Output is correct
10 Correct 10 ms 19048 KB Output is correct
11 Correct 11 ms 19128 KB Output is correct
12 Correct 11 ms 19148 KB Output is correct
13 Correct 10 ms 19156 KB Output is correct
14 Correct 11 ms 19148 KB Output is correct
15 Correct 14 ms 19092 KB Output is correct
16 Correct 9 ms 19148 KB Output is correct
17 Correct 12 ms 19148 KB Output is correct
18 Correct 13 ms 19148 KB Output is correct
19 Correct 9 ms 19148 KB Output is correct
20 Correct 12 ms 19092 KB Output is correct
21 Correct 10 ms 19148 KB Output is correct
22 Correct 9 ms 19036 KB Output is correct
23 Correct 10 ms 19148 KB Output is correct
24 Correct 13 ms 19064 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 19148 KB Output is correct
2 Correct 10 ms 19128 KB Output is correct
3 Correct 10 ms 19108 KB Output is correct
4 Correct 13 ms 19148 KB Output is correct
5 Correct 10 ms 19148 KB Output is correct
6 Correct 13 ms 19068 KB Output is correct
7 Correct 13 ms 19160 KB Output is correct
8 Correct 16 ms 19080 KB Output is correct
9 Correct 13 ms 19112 KB Output is correct
10 Correct 10 ms 19048 KB Output is correct
11 Correct 11 ms 19128 KB Output is correct
12 Correct 11 ms 19148 KB Output is correct
13 Correct 10 ms 19156 KB Output is correct
14 Correct 11 ms 19148 KB Output is correct
15 Correct 14 ms 19092 KB Output is correct
16 Correct 9 ms 19148 KB Output is correct
17 Correct 12 ms 19148 KB Output is correct
18 Correct 13 ms 19148 KB Output is correct
19 Correct 9 ms 19148 KB Output is correct
20 Correct 12 ms 19092 KB Output is correct
21 Correct 10 ms 19148 KB Output is correct
22 Correct 9 ms 19036 KB Output is correct
23 Correct 10 ms 19148 KB Output is correct
24 Correct 13 ms 19064 KB Output is correct
25 Correct 123 ms 23320 KB Output is correct
26 Correct 24 ms 19680 KB Output is correct
27 Correct 169 ms 24856 KB Output is correct
28 Correct 181 ms 24784 KB Output is correct
29 Correct 113 ms 23420 KB Output is correct
30 Correct 115 ms 23024 KB Output is correct
31 Correct 143 ms 24464 KB Output is correct
32 Correct 200 ms 24800 KB Output is correct
33 Correct 170 ms 24720 KB Output is correct
34 Correct 83 ms 21804 KB Output is correct
35 Correct 156 ms 25048 KB Output is correct
36 Correct 190 ms 24876 KB Output is correct
37 Correct 93 ms 21928 KB Output is correct
38 Correct 157 ms 23884 KB Output is correct
39 Correct 31 ms 19824 KB Output is correct
40 Correct 161 ms 23832 KB Output is correct
41 Correct 123 ms 22752 KB Output is correct
42 Correct 164 ms 23780 KB Output is correct
43 Correct 58 ms 20740 KB Output is correct
44 Correct 174 ms 23840 KB Output is correct
45 Correct 39 ms 20044 KB Output is correct
46 Correct 160 ms 23812 KB Output is correct
47 Correct 48 ms 20420 KB Output is correct
48 Correct 183 ms 23872 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 320 ms 26076 KB Output is correct
2 Correct 353 ms 26836 KB Output is correct
3 Correct 242 ms 24544 KB Output is correct
4 Correct 353 ms 26832 KB Output is correct
5 Correct 172 ms 22624 KB Output is correct
6 Correct 347 ms 26900 KB Output is correct
7 Correct 281 ms 25816 KB Output is correct
8 Correct 411 ms 26820 KB Output is correct
9 Correct 48 ms 20340 KB Output is correct
10 Correct 356 ms 26748 KB Output is correct
11 Correct 202 ms 23956 KB Output is correct
12 Correct 371 ms 26836 KB Output is correct
13 Correct 292 ms 27052 KB Output is correct
14 Correct 249 ms 26696 KB Output is correct
15 Correct 244 ms 25904 KB Output is correct
16 Correct 276 ms 25876 KB Output is correct
17 Correct 319 ms 27648 KB Output is correct
18 Correct 271 ms 26304 KB Output is correct
19 Correct 267 ms 26580 KB Output is correct
20 Correct 256 ms 26680 KB Output is correct
21 Correct 281 ms 26708 KB Output is correct
22 Correct 262 ms 26536 KB Output is correct
23 Correct 292 ms 26796 KB Output is correct
24 Correct 249 ms 25356 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 19148 KB Output is correct
2 Correct 10 ms 19128 KB Output is correct
3 Correct 10 ms 19108 KB Output is correct
4 Correct 13 ms 19148 KB Output is correct
5 Correct 10 ms 19148 KB Output is correct
6 Correct 13 ms 19068 KB Output is correct
7 Correct 13 ms 19160 KB Output is correct
8 Correct 16 ms 19080 KB Output is correct
9 Correct 13 ms 19112 KB Output is correct
10 Correct 10 ms 19048 KB Output is correct
11 Correct 11 ms 19128 KB Output is correct
12 Correct 11 ms 19148 KB Output is correct
13 Correct 10 ms 19156 KB Output is correct
14 Correct 11 ms 19148 KB Output is correct
15 Correct 14 ms 19092 KB Output is correct
16 Correct 9 ms 19148 KB Output is correct
17 Correct 12 ms 19148 KB Output is correct
18 Correct 13 ms 19148 KB Output is correct
19 Correct 9 ms 19148 KB Output is correct
20 Correct 12 ms 19092 KB Output is correct
21 Correct 10 ms 19148 KB Output is correct
22 Correct 9 ms 19036 KB Output is correct
23 Correct 10 ms 19148 KB Output is correct
24 Correct 13 ms 19064 KB Output is correct
25 Correct 123 ms 23320 KB Output is correct
26 Correct 24 ms 19680 KB Output is correct
27 Correct 169 ms 24856 KB Output is correct
28 Correct 181 ms 24784 KB Output is correct
29 Correct 113 ms 23420 KB Output is correct
30 Correct 115 ms 23024 KB Output is correct
31 Correct 143 ms 24464 KB Output is correct
32 Correct 200 ms 24800 KB Output is correct
33 Correct 170 ms 24720 KB Output is correct
34 Correct 83 ms 21804 KB Output is correct
35 Correct 156 ms 25048 KB Output is correct
36 Correct 190 ms 24876 KB Output is correct
37 Correct 93 ms 21928 KB Output is correct
38 Correct 157 ms 23884 KB Output is correct
39 Correct 31 ms 19824 KB Output is correct
40 Correct 161 ms 23832 KB Output is correct
41 Correct 123 ms 22752 KB Output is correct
42 Correct 164 ms 23780 KB Output is correct
43 Correct 58 ms 20740 KB Output is correct
44 Correct 174 ms 23840 KB Output is correct
45 Correct 39 ms 20044 KB Output is correct
46 Correct 160 ms 23812 KB Output is correct
47 Correct 48 ms 20420 KB Output is correct
48 Correct 183 ms 23872 KB Output is correct
49 Correct 320 ms 26076 KB Output is correct
50 Correct 353 ms 26836 KB Output is correct
51 Correct 242 ms 24544 KB Output is correct
52 Correct 353 ms 26832 KB Output is correct
53 Correct 172 ms 22624 KB Output is correct
54 Correct 347 ms 26900 KB Output is correct
55 Correct 281 ms 25816 KB Output is correct
56 Correct 411 ms 26820 KB Output is correct
57 Correct 48 ms 20340 KB Output is correct
58 Correct 356 ms 26748 KB Output is correct
59 Correct 202 ms 23956 KB Output is correct
60 Correct 371 ms 26836 KB Output is correct
61 Correct 292 ms 27052 KB Output is correct
62 Correct 249 ms 26696 KB Output is correct
63 Correct 244 ms 25904 KB Output is correct
64 Correct 276 ms 25876 KB Output is correct
65 Correct 319 ms 27648 KB Output is correct
66 Correct 271 ms 26304 KB Output is correct
67 Correct 267 ms 26580 KB Output is correct
68 Correct 256 ms 26680 KB Output is correct
69 Correct 281 ms 26708 KB Output is correct
70 Correct 262 ms 26536 KB Output is correct
71 Correct 292 ms 26796 KB Output is correct
72 Correct 249 ms 25356 KB Output is correct
73 Correct 585 ms 33632 KB Output is correct
74 Correct 383 ms 27976 KB Output is correct
75 Correct 548 ms 33040 KB Output is correct
76 Correct 713 ms 36348 KB Output is correct
77 Correct 359 ms 28648 KB Output is correct
78 Correct 578 ms 34136 KB Output is correct
79 Correct 652 ms 34864 KB Output is correct
80 Correct 717 ms 36332 KB Output is correct
81 Correct 297 ms 26484 KB Output is correct
82 Correct 534 ms 32472 KB Output is correct
83 Correct 501 ms 32100 KB Output is correct
84 Correct 764 ms 36404 KB Output is correct
85 Correct 484 ms 32948 KB Output is correct
86 Correct 579 ms 35136 KB Output is correct
87 Correct 300 ms 27760 KB Output is correct
88 Correct 563 ms 34252 KB Output is correct
89 Correct 484 ms 34292 KB Output is correct
90 Correct 561 ms 34828 KB Output is correct
91 Correct 389 ms 30548 KB Output is correct
92 Correct 562 ms 35004 KB Output is correct
93 Correct 287 ms 28836 KB Output is correct
94 Correct 583 ms 35016 KB Output is correct
95 Correct 370 ms 29936 KB Output is correct
96 Correct 531 ms 33632 KB Output is correct