oj.uz

Submission #526825

# Submission time Handle Problem Language Result Execution time Memory
526825 2022-02-16T08:24:31 Z fhvirus Two Antennas (JOI19_antennas) C++17
100 / 100
 826 ms 43680 KB 
// Knapsack DP is harder than FFT.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll; typedef pair<int,int> pii;
#define ff first
#define ss second
#define pb emplace_back
#define AI(x) begin(x),end(x)
#ifdef OWO
#define debug(args...) SDF(#args, args)
#define OIU(args...) ostream& operator<<(ostream&O,args)
#define LKJ(S,B,E,F) template<class...T>OIU(S<T...>s){O<<B;int c=0;for(auto i:s)O<<(c++?", ":"")<<F;return O<<E;}
LKJ(vector,'[',']',i)LKJ(deque,'[',']',i)LKJ(set,'{','}',i)LKJ(multiset,'{','}',i)LKJ(unordered_set,'{','}',i)LKJ(map,'{','}',i.ff<<':'<<i.ss)LKJ(unordered_map,'{','}',i.ff<<':'<<i.ss)
template<class...T>void SDF(const char* s,T...a){int c=sizeof...(T);if(!c){cerr<<"\033[1;32mvoid\033[0m\n";return;}(cerr<<"\033[1;32m("<<s<<") = (",...,(cerr<<a<<(--c?", ":")\033[0m\n")));}
template<class T,size_t N>OIU(array<T,N>a){return O<<vector<T>(AI(a));}template<class...T>OIU(pair<T...>p){return O<<'('<<p.ff<<','<<p.ss<<')';}template<class...T>OIU(tuple<T...>t){return O<<'(',apply([&O](T...s){int c=0;(...,(O<<(c++?", ":"")<<s));},t),O<<')';}
#else
#define debug(...) ((void)0)
#endif

const int INF = 1e9 + 7;

struct SGT {
	int n; vector<int> min_height, tag, max_dif;
	SGT(int _n): n(_n), min_height(n * 4 + 4, INF),
		tag(n * 4 + 4, -INF), max_dif(n * 4 + 4, -1) {}
	void upd(int i, int v) {
		tag[i] = max(tag[i], v);
		max_dif[i] = max(max_dif[i], tag[i] - min_height[i]);
	}
	void push(int i) {
		if (tag[i] == -INF) return;
		upd(i * 2, tag[i]);
		upd(i * 2 + 1, tag[i]);
		tag[i] = -INF;
	}
	void pull(int i) {
		min_height[i] = min(min_height[i * 2], min_height[i * 2 + 1]);
		max_dif[i] = max(max_dif[i * 2], max_dif[i * 2 + 1]);
	}
	void set_height(int i, int l, int r, int p, int v) {
		if (l == r) {
			min_height[i] = v;
			tag[i] = -INF;
			//max_dif[i] = max(max_dif[i], tag[i] - min_height[i]);
			return;
		}
		push(i);
		int m = (l + r) / 2;
		if (p <= m) set_height(i * 2, l, m, p, v);
		else set_height(i * 2 + 1, m + 1, r, p, v);
		pull(i);
		return;
	}
	void chmax(int i, int l, int r, int ql, int qr, int v) {
		if (ql <= l and r <= qr) {
			upd(i, v);
			return;
		}
		push(i);
		int m = (l + r) / 2;
		if (ql <= m) chmax(i * 2, l, m, ql, qr, v);
		if (m < qr) chmax(i * 2 + 1, m + 1, r, ql, qr, v);
		pull(i);
		return;
	}
	int query(int i, int l, int r, int ql, int qr) {
		if (ql <= l and r <= qr)
			return max_dif[i];
		push(i);
		int m = (l + r) / 2, ans = -1;
		if (ql <= m) ans = max(ans, query(i * 2, l, m, ql, qr));
		if (m < qr) ans = max(ans, query(i * 2 + 1, m + 1, r, ql, qr));
		return ans;
	}
	void set_height(int p, int v) { set_height(1, 1, n, p, v); }
	void chmax(int ql, int qr, int v) { chmax(1, 1, n, ql, qr, v); }
	int query(int ql, int qr) { return query(1, 1, n, ql, qr); }
	void de(int i, int l, int r) {
		if (l == r) {
			debug(i, l, r, min_height[i], tag[i], max_dif[i]);
			return;
		}
		push(i);
		int m = (l + r) / 2;
		de(i * 2, l, m);
		de(i * 2 + 1, m + 1, r);
	}
	void de() {
		cerr << "--------------------" << endl;
		de(1, 1, n);
		cerr << "--------------------" << endl;
	}
};

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

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

	for (int i = 1; i <= N; ++i)
		for (int j = 1; j <= N; ++j)
			if (H[i] - H[j] == 806460109)
				debug(i, j, H[i], H[j]);

	int Q; cin >> Q;
	vector<int> L(Q + 1), R(Q + 1);
	for (int i = 1; i <= Q; ++i)
		cin >> L[i] >> R[i];

	vector<int> ans(Q + 1, -1);
	auto solve = [&]() -> void {
		vector<vector<int>> in(N + 1);
		vector<vector<int>> ou(N + 2);
		for (int i = 1; i <= N; ++i) {
			int lb = min(N + 1, i + A[i]);
			int rb = min(N, i + B[i]);
			if (lb < N + 1) {
				in[lb].pb(i);
				ou[rb + 1].pb(i);
			}
		}

		debug(H);
		debug(A);
		debug(B);
		debug(in);
		debug(ou);

		vector<vector<pii>> qs(N + 1);
		for (int i = 1; i <= Q; ++i)
			qs[R[i]].pb(L[i], i);

		SGT sgt(N);
		for (int i = 1; i <= N; ++i) {
			for (int &j: in[i])
				sgt.set_height(j, H[j]);
			for (int &j: ou[i])
				sgt.set_height(j, INF);

			int lb = max(1, i - B[i]);
			int rb = max(0, i - A[i]);
			debug(i, lb, rb, H[i]);
			if (rb > 0)
				sgt.chmax(lb, rb, H[i]);

			for (auto &[ql, id]: qs[i])
				ans[id] = max(ans[id], sgt.query(ql, i));

			//sgt.de();
		}
		debug(ans);
	};

	solve();
	reverse(begin(H) + 1, end(H));
	reverse(begin(A) + 1, end(A));
	reverse(begin(B) + 1, end(B));
	for (int i = 1; i <= Q; ++i) {
		L[i] = N - L[i] + 1;
		R[i] = N - R[i] + 1;
		swap(L[i], R[i]);
	}
	solve();

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

	return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 300 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 316 KB Output is correct
23 Correct 1 ms 308 KB Output is correct
24 Correct 1 ms 336 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 300 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 316 KB Output is correct
23 Correct 1 ms 308 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 84 ms 5216 KB Output is correct
26 Correct 11 ms 1212 KB Output is correct
27 Correct 116 ms 7420 KB Output is correct
28 Correct 117 ms 8644 KB Output is correct
29 Correct 72 ms 5464 KB Output is correct
30 Correct 81 ms 6436 KB Output is correct
31 Correct 83 ms 6568 KB Output is correct
32 Correct 113 ms 8828 KB Output is correct
33 Correct 104 ms 7104 KB Output is correct
34 Correct 66 ms 4592 KB Output is correct
35 Correct 107 ms 7632 KB Output is correct
36 Correct 111 ms 7896 KB Output is correct
37 Correct 63 ms 4920 KB Output is correct
38 Correct 109 ms 7244 KB Output is correct
39 Correct 18 ms 1724 KB Output is correct
40 Correct 106 ms 7224 KB Output is correct
41 Correct 83 ms 5852 KB Output is correct
42 Correct 111 ms 7268 KB Output is correct
43 Correct 37 ms 3160 KB Output is correct
44 Correct 125 ms 7268 KB Output is correct
45 Correct 23 ms 2012 KB Output is correct
46 Correct 107 ms 7232 KB Output is correct
47 Correct 29 ms 2652 KB Output is correct
48 Correct 112 ms 7240 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 324 ms 30904 KB Output is correct
2 Correct 403 ms 34560 KB Output is correct
3 Correct 276 ms 24244 KB Output is correct
4 Correct 409 ms 34444 KB Output is correct
5 Correct 150 ms 15960 KB Output is correct
6 Correct 372 ms 34448 KB Output is correct
7 Correct 339 ms 29896 KB Output is correct
8 Correct 402 ms 34480 KB Output is correct
9 Correct 52 ms 5664 KB Output is correct
10 Correct 384 ms 34428 KB Output is correct
11 Correct 244 ms 21620 KB Output is correct
12 Correct 426 ms 34488 KB Output is correct
13 Correct 275 ms 33360 KB Output is correct
14 Correct 267 ms 32984 KB Output is correct
15 Correct 241 ms 32096 KB Output is correct
16 Correct 214 ms 32352 KB Output is correct
17 Correct 255 ms 33680 KB Output is correct
18 Correct 269 ms 32464 KB Output is correct
19 Correct 257 ms 32636 KB Output is correct
20 Correct 240 ms 32648 KB Output is correct
21 Correct 248 ms 33304 KB Output is correct
22 Correct 274 ms 32852 KB Output is correct
23 Correct 303 ms 33024 KB Output is correct
24 Correct 216 ms 31980 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 300 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 316 KB Output is correct
23 Correct 1 ms 308 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 84 ms 5216 KB Output is correct
26 Correct 11 ms 1212 KB Output is correct
27 Correct 116 ms 7420 KB Output is correct
28 Correct 117 ms 8644 KB Output is correct
29 Correct 72 ms 5464 KB Output is correct
30 Correct 81 ms 6436 KB Output is correct
31 Correct 83 ms 6568 KB Output is correct
32 Correct 113 ms 8828 KB Output is correct
33 Correct 104 ms 7104 KB Output is correct
34 Correct 66 ms 4592 KB Output is correct
35 Correct 107 ms 7632 KB Output is correct
36 Correct 111 ms 7896 KB Output is correct
37 Correct 63 ms 4920 KB Output is correct
38 Correct 109 ms 7244 KB Output is correct
39 Correct 18 ms 1724 KB Output is correct
40 Correct 106 ms 7224 KB Output is correct
41 Correct 83 ms 5852 KB Output is correct
42 Correct 111 ms 7268 KB Output is correct
43 Correct 37 ms 3160 KB Output is correct
44 Correct 125 ms 7268 KB Output is correct
45 Correct 23 ms 2012 KB Output is correct
46 Correct 107 ms 7232 KB Output is correct
47 Correct 29 ms 2652 KB Output is correct
48 Correct 112 ms 7240 KB Output is correct
49 Correct 324 ms 30904 KB Output is correct
50 Correct 403 ms 34560 KB Output is correct
51 Correct 276 ms 24244 KB Output is correct
52 Correct 409 ms 34444 KB Output is correct
53 Correct 150 ms 15960 KB Output is correct
54 Correct 372 ms 34448 KB Output is correct
55 Correct 339 ms 29896 KB Output is correct
56 Correct 402 ms 34480 KB Output is correct
57 Correct 52 ms 5664 KB Output is correct
58 Correct 384 ms 34428 KB Output is correct
59 Correct 244 ms 21620 KB Output is correct
60 Correct 426 ms 34488 KB Output is correct
61 Correct 275 ms 33360 KB Output is correct
62 Correct 267 ms 32984 KB Output is correct
63 Correct 241 ms 32096 KB Output is correct
64 Correct 214 ms 32352 KB Output is correct
65 Correct 255 ms 33680 KB Output is correct
66 Correct 269 ms 32464 KB Output is correct
67 Correct 257 ms 32636 KB Output is correct
68 Correct 240 ms 32648 KB Output is correct
69 Correct 248 ms 33304 KB Output is correct
70 Correct 274 ms 32852 KB Output is correct
71 Correct 303 ms 33024 KB Output is correct
72 Correct 216 ms 31980 KB Output is correct
73 Correct 587 ms 38052 KB Output is correct
74 Correct 456 ms 35296 KB Output is correct
75 Correct 541 ms 32992 KB Output is correct
76 Correct 712 ms 43644 KB Output is correct
77 Correct 364 ms 22180 KB Output is correct
78 Correct 608 ms 40908 KB Output is correct
79 Correct 731 ms 38940 KB Output is correct
80 Correct 826 ms 43680 KB Output is correct
81 Correct 260 ms 12904 KB Output is correct
82 Correct 543 ms 39220 KB Output is correct
83 Correct 503 ms 30116 KB Output is correct
84 Correct 725 ms 43668 KB Output is correct
85 Correct 447 ms 39076 KB Output is correct
86 Correct 530 ms 42264 KB Output is correct
87 Correct 274 ms 33520 KB Output is correct
88 Correct 494 ms 41096 KB Output is correct
89 Correct 512 ms 40580 KB Output is correct
90 Correct 580 ms 41704 KB Output is correct
91 Correct 329 ms 36076 KB Output is correct
92 Correct 496 ms 42000 KB Output is correct
93 Correct 259 ms 35100 KB Output is correct
94 Correct 538 ms 42148 KB Output is correct
95 Correct 352 ms 35556 KB Output is correct
96 Correct 477 ms 41088 KB Output is correct