oj.uz

Submission #532014

# Submission time Handle Problem Language Result Execution time Memory
532014 2022-03-02T03:32:26 Z 8e7 Two Antennas (JOI19_antennas) C++17
13 / 100
 681 ms 97916 KB 
//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 2005
#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 mi[4*maxn], smi[4*maxn], ma[4*maxn], tag[4*maxn], arr[4*maxn], seg[4*maxn];
	//Arr: single point array, ma: second array, seg = max(ma[i] - arr[i]), mi, smi, tag are to maintain ma
	void push(int cur, int l, int r) {
	}
	void pull(int cur, int l, int r) {

	}
	void init(int cur, int l, int r) {
		if (r <= l) return;
		tag[cur] = 0;
		if (r - l == 1) {
			mi[cur] = -inf + 1, smi[cur] = -inf;
			arr[cur] = inf;
			seg[cur] = mi[cur] - arr[cur];
			return;
		}
		int m = (l + r) / 2;
		init(cur*2, l, m), init(cur*2+1, m, r);
		pull(cur, l, r);
	}
		
};
*/
struct segtree{
	ll seg[4*maxn];
	void init(int cur, int l, int r){
		if (r <= l) return;
		seg[cur] = inf;
		if (r - l == 1) return;
		int m = (l + r) / 2;
		init(cur*2, l, m), init(cur*2+1, m, r);
	}
	void modify(int cur, int l, int r, int ind, ll val) {
		if (r <= l) return;
		if (r - l == 1) {
			seg[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);
		seg[cur] = min(seg[cur*2], seg[cur*2+1]);
	}
	ll query(int cur, int l, int r, int ql, int qr) {
		if (r <= l || ql >= r || qr <= l) return inf;
		if (ql <= l && qr >= r) return seg[cur];
		int m = (l + r) / 2;
		return min(query(cur*2, l, m, ql, qr),query(cur*2+1, m, r, ql, qr));
	}
} tr;
ll h[maxn], ans[maxn][maxn];
int a[maxn], b[maxn];
vector<pii> que[maxn], ev[maxn];
void solve(int n, int st) {
	tr.init(1, 0, n);
	for (int i = st;i < n;i++) ev[i].clear();
	for (int i = st;i < n;i++) {
		for (auto [id, ch]:ev[i]) {
			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]);

		ans[st][i] = max(ans[st][i], h[i] - tr.query(1, 0, n, l, r+1));	
		if (i > st) ans[st][i] = max(ans[st][i], ans[st][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];
	}
	for (int i = 0;i < n;i++) {
		for (int j = 0;j < n;j++) ans[i][j] = -1;
		solve(n, i);
	}
	for (int i = 0;i < n;i++) h[i] = -h[i];
	for (int i = 0;i < n;i++) solve(n, i);
	int q;
	cin >> q;
	for (int i = 0;i < q;i++) {
		int l, r;
		cin >> l >> r;
		r--, l--;
		cout << ans[l][r] << "\n";
		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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1356 KB Output is correct
2 Correct 10 ms 4508 KB Output is correct
3 Correct 6 ms 2844 KB Output is correct
4 Correct 9 ms 4504 KB Output is correct
5 Correct 7 ms 3108 KB Output is correct
6 Correct 10 ms 4508 KB Output is correct
7 Correct 8 ms 3240 KB Output is correct
8 Correct 13 ms 4552 KB Output is correct
9 Correct 3 ms 1368 KB Output is correct
10 Correct 11 ms 4508 KB Output is correct
11 Correct 1 ms 716 KB Output is correct
12 Correct 10 ms 4552 KB Output is correct
13 Correct 9 ms 3016 KB Output is correct
14 Correct 8 ms 3016 KB Output is correct
15 Correct 6 ms 3048 KB Output is correct
16 Correct 7 ms 3108 KB Output is correct
17 Correct 7 ms 3108 KB Output is correct
18 Correct 7 ms 3016 KB Output is correct
19 Correct 7 ms 3036 KB Output is correct
20 Correct 8 ms 3104 KB Output is correct
21 Correct 7 ms 3144 KB Output is correct
22 Correct 6 ms 3108 KB Output is correct
23 Correct 5 ms 3100 KB Output is correct
24 Correct 6 ms 3016 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1356 KB Output is correct
2 Correct 10 ms 4508 KB Output is correct
3 Correct 6 ms 2844 KB Output is correct
4 Correct 9 ms 4504 KB Output is correct
5 Correct 7 ms 3108 KB Output is correct
6 Correct 10 ms 4508 KB Output is correct
7 Correct 8 ms 3240 KB Output is correct
8 Correct 13 ms 4552 KB Output is correct
9 Correct 3 ms 1368 KB Output is correct
10 Correct 11 ms 4508 KB Output is correct
11 Correct 1 ms 716 KB Output is correct
12 Correct 10 ms 4552 KB Output is correct
13 Correct 9 ms 3016 KB Output is correct
14 Correct 8 ms 3016 KB Output is correct
15 Correct 6 ms 3048 KB Output is correct
16 Correct 7 ms 3108 KB Output is correct
17 Correct 7 ms 3108 KB Output is correct
18 Correct 7 ms 3016 KB Output is correct
19 Correct 7 ms 3036 KB Output is correct
20 Correct 8 ms 3104 KB Output is correct
21 Correct 7 ms 3144 KB Output is correct
22 Correct 6 ms 3108 KB Output is correct
23 Correct 5 ms 3100 KB Output is correct
24 Correct 6 ms 3016 KB Output is correct
25 Correct 134 ms 26400 KB Output is correct
26 Correct 612 ms 97784 KB Output is correct
27 Correct 455 ms 65072 KB Output is correct
28 Correct 674 ms 97784 KB Output is correct
29 Correct 154 ms 28096 KB Output is correct
30 Correct 644 ms 97816 KB Output is correct
31 Correct 49 ms 8128 KB Output is correct
32 Correct 681 ms 97916 KB Output is correct
33 Correct 258 ms 49792 KB Output is correct
34 Correct 628 ms 97784 KB Output is correct
35 Correct 362 ms 56420 KB Output is correct
36 Correct 661 ms 97864 KB Output is correct
37 Correct 415 ms 97020 KB Output is correct
38 Correct 377 ms 96964 KB Output is correct
39 Correct 463 ms 97164 KB Output is correct
40 Correct 545 ms 97072 KB Output is correct
41 Correct 520 ms 96972 KB Output is correct
42 Correct 517 ms 96976 KB Output is correct
43 Correct 497 ms 97040 KB Output is correct
44 Correct 535 ms 97204 KB Output is correct
45 Correct 386 ms 97188 KB Output is correct
46 Correct 494 ms 97012 KB Output is correct
47 Correct 438 ms 97044 KB Output is correct
48 Correct 489 ms 97028 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 844 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1356 KB Output is correct
2 Correct 10 ms 4508 KB Output is correct
3 Correct 6 ms 2844 KB Output is correct
4 Correct 9 ms 4504 KB Output is correct
5 Correct 7 ms 3108 KB Output is correct
6 Correct 10 ms 4508 KB Output is correct
7 Correct 8 ms 3240 KB Output is correct
8 Correct 13 ms 4552 KB Output is correct
9 Correct 3 ms 1368 KB Output is correct
10 Correct 11 ms 4508 KB Output is correct
11 Correct 1 ms 716 KB Output is correct
12 Correct 10 ms 4552 KB Output is correct
13 Correct 9 ms 3016 KB Output is correct
14 Correct 8 ms 3016 KB Output is correct
15 Correct 6 ms 3048 KB Output is correct
16 Correct 7 ms 3108 KB Output is correct
17 Correct 7 ms 3108 KB Output is correct
18 Correct 7 ms 3016 KB Output is correct
19 Correct 7 ms 3036 KB Output is correct
20 Correct 8 ms 3104 KB Output is correct
21 Correct 7 ms 3144 KB Output is correct
22 Correct 6 ms 3108 KB Output is correct
23 Correct 5 ms 3100 KB Output is correct
24 Correct 6 ms 3016 KB Output is correct
25 Correct 134 ms 26400 KB Output is correct
26 Correct 612 ms 97784 KB Output is correct
27 Correct 455 ms 65072 KB Output is correct
28 Correct 674 ms 97784 KB Output is correct
29 Correct 154 ms 28096 KB Output is correct
30 Correct 644 ms 97816 KB Output is correct
31 Correct 49 ms 8128 KB Output is correct
32 Correct 681 ms 97916 KB Output is correct
33 Correct 258 ms 49792 KB Output is correct
34 Correct 628 ms 97784 KB Output is correct
35 Correct 362 ms 56420 KB Output is correct
36 Correct 661 ms 97864 KB Output is correct
37 Correct 415 ms 97020 KB Output is correct
38 Correct 377 ms 96964 KB Output is correct
39 Correct 463 ms 97164 KB Output is correct
40 Correct 545 ms 97072 KB Output is correct
41 Correct 520 ms 96972 KB Output is correct
42 Correct 517 ms 96976 KB Output is correct
43 Correct 497 ms 97040 KB Output is correct
44 Correct 535 ms 97204 KB Output is correct
45 Correct 386 ms 97188 KB Output is correct
46 Correct 494 ms 97012 KB Output is correct
47 Correct 438 ms 97044 KB Output is correct
48 Correct 489 ms 97028 KB Output is correct
49 Runtime error 6 ms 844 KB Execution killed with signal 11
50 Halted 0 ms 0 KB -