답안 #532815

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
532815	2022-03-04T02:31:48 Z	8e7	Two Antennas (JOI19_antennas)	C++17	100 / 100	866 ms	46656 KB

antennas

//Challenge: Accepted
#include <bits/stdc++.h>
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 200005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);

const ll inf = 1<<30;
struct beats{
	ll seg[4*maxn], tag[4*maxn], mi[4*maxn];
	void push(int cur, int l, int r) {
		if (tag[cur] == -inf) return;
		seg[cur] = max(seg[cur], tag[cur] - mi[cur]);
		if (r - l > 1) {
			tag[cur*2] = max(tag[cur*2], tag[cur]);
			tag[cur*2+1] = max(tag[cur*2+1], tag[cur]);
		}
		tag[cur] = -inf;
	}
	void pull(int cur, int l, int r) {
		int m = (l + r) / 2;
		if (r - l > 1) {
			push(cur*2, l, m);	
			push(cur*2+1, m, r);
			seg[cur] = max(seg[cur], max(seg[cur*2], seg[cur*2+1]));
			mi[cur] = min(mi[cur*2], mi[cur*2+1]);
		}
	}
	void init(int cur, int l, int r) {
		if (r <= l) return;
		tag[cur] = -inf;
		seg[cur] = -inf;
		if (r - l == 1) {
			mi[cur] = inf;
			return;
		}
		int m = (l + r) / 2;
		init(cur*2, l, m), init(cur*2+1, m, r);
		pull(cur, l, r);
	}
	void modify(int cur, int l, int r, int ind, ll val) {
		if (r <= l) return;
		push(cur, l, r);
		if (r - l == 1) {
			mi[cur] = val;
			return;
		}
		int m = (l + r) / 2;
		if (ind < m) modify(cur*2, l, m, ind, val);
		else modify(cur*2+1, m, r, ind, val);
		pull(cur, l, r);
	}
	void chmax(int cur, int l, int r, int ql, int qr, ll val) {
		if (r <= l || ql >= r || qr <= l) return;
		if (ql <= l && qr >= r) {
			tag[cur] = max(tag[cur], val);
			return;
		}
		int m = (l + r) / 2;
		chmax(cur*2, l, m, ql, qr, val);
		chmax(cur*2+1, m, r, ql, qr, val);
		pull(cur, l, r);
	}
	ll query(int cur, int l, int r, int ql, int qr) {
		if (r <= l || ql >= r || qr <= l) return -inf;
		push(cur, l, r);
		if (ql <= l && qr >= r) {
			pull(cur, l, r);	
			//debug(l, r, seg[cur]);
			return seg[cur];
		}
		int m = (l + r) / 2;
		return max(query(cur*2, l, m, ql, qr), query(cur*2+1, m, r, ql, qr));
	}
} tr;

ll h[maxn], ans[maxn];
int a[maxn], b[maxn];
vector<pii> que[maxn], ev[maxn];
void solve(int n) {
	tr.init(1, 0, n);
	for (int i = 0;i < n;i++) ev[i].clear();
	for (int i = 0;i < n;i++) {
		//debug(i);
		for (auto [id, ch]:ev[i]) {
			//debug("mod", id, ch);
			if (ch == 1) tr.modify(1, 0, n, id, h[id]);
			else tr.modify(1, 0, n, id, inf);	
		}
		int l = max(0, i - b[i]), r = max(-1, i - a[i]);
		//debug("chmax", l, r, h[i]);
		tr.chmax(1, 0, n, l, r+1, h[i]);
		for (auto [lef, id]:que[i]) {
			//debug("que", id, tr.query(1, 0, n, lef, i+1));
			ans[id] = max(ans[id], tr.query(1, 0, n, lef, i+1));
		}

		l = min(n, i+a[i]), r = min(n, i + b[i] + 1);
		ev[l].push_back({i, 1}), ev[r].push_back({i, -1});
	}
}
int main() {
	io
	int n;
	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++) {
		ans[i] = -1;
		int l, r;
		cin >> l >> r;
		r--, l--;
		que[r].push_back({l, i});
	}
	solve(n);
	for (int i = 0;i < n;i++) h[i] = -h[i];
	solve(n);
	for (int i = 0;i < q;i++) cout << ans[i] << "\n";
}

Subtask #1

2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	9676 KB	Output is correct
2	Correct	6 ms	9704 KB	Output is correct
3	Correct	6 ms	9724 KB	Output is correct
4	Correct	6 ms	9704 KB	Output is correct
5	Correct	5 ms	9804 KB	Output is correct
6	Correct	6 ms	9724 KB	Output is correct
7	Correct	7 ms	9720 KB	Output is correct
8	Correct	6 ms	9804 KB	Output is correct
9	Correct	6 ms	9784 KB	Output is correct
10	Correct	7 ms	9804 KB	Output is correct
11	Correct	6 ms	9676 KB	Output is correct
12	Correct	7 ms	9832 KB	Output is correct
13	Correct	6 ms	9804 KB	Output is correct
14	Correct	5 ms	9676 KB	Output is correct
15	Correct	5 ms	9720 KB	Output is correct
16	Correct	6 ms	9804 KB	Output is correct
17	Correct	5 ms	9804 KB	Output is correct
18	Correct	5 ms	9720 KB	Output is correct
19	Correct	6 ms	9784 KB	Output is correct
20	Correct	6 ms	9676 KB	Output is correct
21	Correct	6 ms	9676 KB	Output is correct
22	Correct	6 ms	9804 KB	Output is correct
23	Correct	8 ms	9676 KB	Output is correct
24	Correct	8 ms	9792 KB	Output is correct

Subtask #2

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	9676 KB	Output is correct
2	Correct	6 ms	9704 KB	Output is correct
3	Correct	6 ms	9724 KB	Output is correct
4	Correct	6 ms	9704 KB	Output is correct
5	Correct	5 ms	9804 KB	Output is correct
6	Correct	6 ms	9724 KB	Output is correct
7	Correct	7 ms	9720 KB	Output is correct
8	Correct	6 ms	9804 KB	Output is correct
9	Correct	6 ms	9784 KB	Output is correct
10	Correct	7 ms	9804 KB	Output is correct
11	Correct	6 ms	9676 KB	Output is correct
12	Correct	7 ms	9832 KB	Output is correct
13	Correct	6 ms	9804 KB	Output is correct
14	Correct	5 ms	9676 KB	Output is correct
15	Correct	5 ms	9720 KB	Output is correct
16	Correct	6 ms	9804 KB	Output is correct
17	Correct	5 ms	9804 KB	Output is correct
18	Correct	5 ms	9720 KB	Output is correct
19	Correct	6 ms	9784 KB	Output is correct
20	Correct	6 ms	9676 KB	Output is correct
21	Correct	6 ms	9676 KB	Output is correct
22	Correct	6 ms	9804 KB	Output is correct
23	Correct	8 ms	9676 KB	Output is correct
24	Correct	8 ms	9792 KB	Output is correct
25	Correct	88 ms	15172 KB	Output is correct
26	Correct	18 ms	10560 KB	Output is correct
27	Correct	152 ms	17456 KB	Output is correct
28	Correct	138 ms	17584 KB	Output is correct
29	Correct	119 ms	15152 KB	Output is correct
30	Correct	96 ms	15100 KB	Output is correct
31	Correct	101 ms	16424 KB	Output is correct
32	Correct	148 ms	17516 KB	Output is correct
33	Correct	168 ms	16964 KB	Output is correct
34	Correct	68 ms	13524 KB	Output is correct
35	Correct	172 ms	17456 KB	Output is correct
36	Correct	132 ms	17536 KB	Output is correct
37	Correct	80 ms	13756 KB	Output is correct
38	Correct	173 ms	16508 KB	Output is correct
39	Correct	24 ms	10836 KB	Output is correct
40	Correct	136 ms	16580 KB	Output is correct
41	Correct	104 ms	14788 KB	Output is correct
42	Correct	124 ms	16544 KB	Output is correct
43	Correct	46 ms	12120 KB	Output is correct
44	Correct	146 ms	16616 KB	Output is correct
45	Correct	28 ms	11004 KB	Output is correct
46	Correct	130 ms	16620 KB	Output is correct
47	Correct	56 ms	11632 KB	Output is correct
48	Correct	138 ms	16600 KB	Output is correct

Subtask #3

22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	441 ms	35880 KB	Output is correct
2	Correct	386 ms	36908 KB	Output is correct
3	Correct	252 ms	33604 KB	Output is correct
4	Correct	455 ms	37040 KB	Output is correct
5	Correct	150 ms	22720 KB	Output is correct
6	Correct	437 ms	36964 KB	Output is correct
7	Correct	323 ms	35504 KB	Output is correct
8	Correct	405 ms	36880 KB	Output is correct
9	Correct	44 ms	13940 KB	Output is correct
10	Correct	397 ms	36980 KB	Output is correct
11	Correct	220 ms	26704 KB	Output is correct
12	Correct	404 ms	36904 KB	Output is correct
13	Correct	229 ms	35824 KB	Output is correct
14	Correct	207 ms	35576 KB	Output is correct
15	Correct	205 ms	35572 KB	Output is correct
16	Correct	172 ms	36156 KB	Output is correct
17	Correct	249 ms	36088 KB	Output is correct
18	Correct	193 ms	36108 KB	Output is correct
19	Correct	225 ms	35664 KB	Output is correct
20	Correct	195 ms	35564 KB	Output is correct
21	Correct	234 ms	34964 KB	Output is correct
22	Correct	196 ms	35372 KB	Output is correct
23	Correct	237 ms	35748 KB	Output is correct
24	Correct	179 ms	35812 KB	Output is correct

Subtask #4

65.0 / 65.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	9676 KB	Output is correct
2	Correct	6 ms	9704 KB	Output is correct
3	Correct	6 ms	9724 KB	Output is correct
4	Correct	6 ms	9704 KB	Output is correct
5	Correct	5 ms	9804 KB	Output is correct
6	Correct	6 ms	9724 KB	Output is correct
7	Correct	7 ms	9720 KB	Output is correct
8	Correct	6 ms	9804 KB	Output is correct
9	Correct	6 ms	9784 KB	Output is correct
10	Correct	7 ms	9804 KB	Output is correct
11	Correct	6 ms	9676 KB	Output is correct
12	Correct	7 ms	9832 KB	Output is correct
13	Correct	6 ms	9804 KB	Output is correct
14	Correct	5 ms	9676 KB	Output is correct
15	Correct	5 ms	9720 KB	Output is correct
16	Correct	6 ms	9804 KB	Output is correct
17	Correct	5 ms	9804 KB	Output is correct
18	Correct	5 ms	9720 KB	Output is correct
19	Correct	6 ms	9784 KB	Output is correct
20	Correct	6 ms	9676 KB	Output is correct
21	Correct	6 ms	9676 KB	Output is correct
22	Correct	6 ms	9804 KB	Output is correct
23	Correct	8 ms	9676 KB	Output is correct
24	Correct	8 ms	9792 KB	Output is correct
25	Correct	88 ms	15172 KB	Output is correct
26	Correct	18 ms	10560 KB	Output is correct
27	Correct	152 ms	17456 KB	Output is correct
28	Correct	138 ms	17584 KB	Output is correct
29	Correct	119 ms	15152 KB	Output is correct
30	Correct	96 ms	15100 KB	Output is correct
31	Correct	101 ms	16424 KB	Output is correct
32	Correct	148 ms	17516 KB	Output is correct
33	Correct	168 ms	16964 KB	Output is correct
34	Correct	68 ms	13524 KB	Output is correct
35	Correct	172 ms	17456 KB	Output is correct
36	Correct	132 ms	17536 KB	Output is correct
37	Correct	80 ms	13756 KB	Output is correct
38	Correct	173 ms	16508 KB	Output is correct
39	Correct	24 ms	10836 KB	Output is correct
40	Correct	136 ms	16580 KB	Output is correct
41	Correct	104 ms	14788 KB	Output is correct
42	Correct	124 ms	16544 KB	Output is correct
43	Correct	46 ms	12120 KB	Output is correct
44	Correct	146 ms	16616 KB	Output is correct
45	Correct	28 ms	11004 KB	Output is correct
46	Correct	130 ms	16620 KB	Output is correct
47	Correct	56 ms	11632 KB	Output is correct
48	Correct	138 ms	16600 KB	Output is correct
49	Correct	441 ms	35880 KB	Output is correct
50	Correct	386 ms	36908 KB	Output is correct
51	Correct	252 ms	33604 KB	Output is correct
52	Correct	455 ms	37040 KB	Output is correct
53	Correct	150 ms	22720 KB	Output is correct
54	Correct	437 ms	36964 KB	Output is correct
55	Correct	323 ms	35504 KB	Output is correct
56	Correct	405 ms	36880 KB	Output is correct
57	Correct	44 ms	13940 KB	Output is correct
58	Correct	397 ms	36980 KB	Output is correct
59	Correct	220 ms	26704 KB	Output is correct
60	Correct	404 ms	36904 KB	Output is correct
61	Correct	229 ms	35824 KB	Output is correct
62	Correct	207 ms	35576 KB	Output is correct
63	Correct	205 ms	35572 KB	Output is correct
64	Correct	172 ms	36156 KB	Output is correct
65	Correct	249 ms	36088 KB	Output is correct
66	Correct	193 ms	36108 KB	Output is correct
67	Correct	225 ms	35664 KB	Output is correct
68	Correct	195 ms	35564 KB	Output is correct
69	Correct	234 ms	34964 KB	Output is correct
70	Correct	196 ms	35372 KB	Output is correct
71	Correct	237 ms	35748 KB	Output is correct
72	Correct	179 ms	35812 KB	Output is correct
73	Correct	659 ms	42796 KB	Output is correct
74	Correct	464 ms	37716 KB	Output is correct
75	Correct	606 ms	41788 KB	Output is correct
76	Correct	866 ms	46604 KB	Output is correct
77	Correct	466 ms	29352 KB	Output is correct
78	Correct	677 ms	43632 KB	Output is correct
79	Correct	737 ms	44588 KB	Output is correct
80	Correct	802 ms	46656 KB	Output is correct
81	Correct	267 ms	21676 KB	Output is correct
82	Correct	613 ms	41944 KB	Output is correct
83	Correct	559 ms	34408 KB	Output is correct
84	Correct	790 ms	46632 KB	Output is correct
85	Correct	417 ms	40840 KB	Output is correct
86	Correct	526 ms	43868 KB	Output is correct
87	Correct	276 ms	36936 KB	Output is correct
88	Correct	529 ms	44020 KB	Output is correct
89	Correct	487 ms	42112 KB	Output is correct
90	Correct	536 ms	44012 KB	Output is correct
91	Correct	398 ms	38648 KB	Output is correct
92	Correct	515 ms	43708 KB	Output is correct
93	Correct	274 ms	36740 KB	Output is correct
94	Correct	590 ms	43888 KB	Output is correct
95	Correct	284 ms	38088 KB	Output is correct
96	Correct	516 ms	43664 KB	Output is correct