oj.uz

Submission #632773

# Submission time Handle Problem Language Result Execution time Memory
632773 2022-08-20T18:20:26 Z dutinmeow Cake 3 (JOI19_cake3) C++17
100 / 100
 811 ms 119228 KB 
#include <bits/stdc++.h>
using namespace std;
 
namespace std {
 
template<class Fun>
class y_combinator_result {
	Fun fun_;
public:
	template<class T>
	explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}
 
	template<class ...Args>
	decltype(auto) operator()(Args &&...args) {
		return fun_(std::ref(*this), std::forward<Args>(args)...);
	}
};
 
template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
	return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}
 
} // namespace std
 
class wavelet_tree {
	int n;
	vector<long long> vmap;
	vector<vector<int>> tree;
	vector<vector<long long>> psum;
 
	template<typename I>
	void build(I begin, I end, int t, int vl, int vr) {
		if (vl == vr) {
			int nn = end - begin + 1;
			psum[t].reserve(nn);
			psum[t].push_back(0);
			for (auto it = begin; it != end; it++)
				psum[t].push_back(psum[t].back() + vmap[*it]);
			return;
		}
		int vm = (vl + vr) / 2, nn = end - begin + 1;
		tree[t].reserve(nn);
		psum[t].reserve(nn);
		tree[t].push_back(0);
		psum[t].push_back(0);
		for (auto it = begin; it != end; it++) {
			tree[t].push_back(tree[t].back() + (*it <= vm));
			psum[t].push_back(psum[t].back() + vmap[*it]);
		}
		auto pivot = stable_partition(begin, end, [vm](int x) { return x <= vm; });
		build(begin, pivot, t * 2, vl, vm);
		build(pivot, end, t * 2 + 1, vm + 1, vr);
	}
 
	long long query(int l, int r, int k, int t, int vl, int vr) {
		if (vl == vr) 
			return k * vmap[vl];
		int vm = (vl + vr) / 2, lv = tree[t][r] - tree[t][l - 1];
		if (k <= lv){
			return query(tree[t][l - 1] + 1, tree[t][r], k, t * 2, vl, vm);
		} else {
			return psum[t * 2][tree[t][r]] - psum[t * 2][tree[t][l - 1]] +\
				query(l - tree[t][l - 1], r - tree[t][r], k - lv, t * 2 + 1, vm + 1, vr);
		}
	}
 
 
public:
	wavelet_tree(vector<long long> vec) { init(vec.begin(), vec.end()); }
 
	template<typename I>
	void init(I begin, I end) {
		map<long long, int> m;
		for (auto it = begin; it != end; it++)
			m[*it] = 0;
		n = 0;
		vmap.resize(m.size());
		for (auto &[k, v] : m) 
			vmap[v = n++] = k;
		for (auto it = begin; it != end; it++)
			*it = m[*it];
		tree.resize(4 * n);
		psum.resize(4 * n);
		build(begin, end, 1, 0, n);
	}
 
	// returns sum of k smallest elements in range [l, r] 
	long long query(int l, int r, int k) { 
		assert(k <= r - l + 1);
		return query(l + 1, r + 1, k, 1, 0, n); 
	}
};
 
int main() {
	int N, M;
	cin >> N >> M;
	vector<pair<long long, long long>> A(N);
	for (auto &[v, c] : A) {
		cin >> v >> c;
		v = -v;
	}
	sort(A.begin(), A.end(), [](auto a, auto b) {
		return a.second < b.second;
	});

	vector<long long> V(N), C(N);
	for (int i = 0; i < N; i++) {
		tie(V[i], C[i]) = A[i];
	}
 
	wavelet_tree wt(V);
	vector<int> rpos(N - M + 1);
 
	y_combinator([&](auto self, int pl, int pr, int ql, int qr) -> void {
		if (pr < pl) {
			return;
		}
		if (ql == qr) {
			for (int i = pl; i <= pr; i++)
				rpos[i] = ql;
			return;
		}
		int pm = (pl + pr) / 2, qm = -1;
		long long val = LLONG_MIN;
		for (int i = ql; i <= qr; i++) {
			if (i - pm + 1 < M) {
				continue;
			}
			long long cur = -wt.query(pm, i, M) - 2 * (C[i] - C[pm]);
			if (val < cur) {
				val = cur;
				qm = i;
			}
		}
		rpos[pm] = qm;
		self(pl, pm - 1, ql, qm);
		self(pm + 1, pr, qm, qr);
	})(0, N - M, M - 1, N - 1);
 
	long long ans = LLONG_MIN;
	for (int l = 0; l < N - M + 1; l++) {
		int r = rpos[l];
		long long val = -wt.query(l, r, M) - 2 * (C[r] - C[l]);
		ans = max(ans, val);
	}
	cout << ans << '\n';
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 304 KB Output is correct
26 Correct 0 ms 296 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 300 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 300 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 304 KB Output is correct
26 Correct 0 ms 296 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 300 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 300 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 5 ms 1236 KB Output is correct
39 Correct 5 ms 1236 KB Output is correct
40 Correct 4 ms 1236 KB Output is correct
41 Correct 4 ms 1276 KB Output is correct
42 Correct 4 ms 1236 KB Output is correct
43 Correct 4 ms 1236 KB Output is correct
44 Correct 4 ms 1176 KB Output is correct
45 Correct 4 ms 1236 KB Output is correct
46 Correct 5 ms 1236 KB Output is correct
47 Correct 5 ms 1236 KB Output is correct
48 Correct 5 ms 1120 KB Output is correct
49 Correct 4 ms 1236 KB Output is correct
50 Correct 4 ms 1236 KB Output is correct
51 Correct 4 ms 1260 KB Output is correct
52 Correct 4 ms 1252 KB Output is correct
53 Correct 4 ms 1240 KB Output is correct
54 Correct 4 ms 1264 KB Output is correct
55 Correct 4 ms 1284 KB Output is correct
56 Correct 3 ms 1240 KB Output is correct
57 Correct 4 ms 1236 KB Output is correct
58 Correct 4 ms 1236 KB Output is correct
59 Correct 2 ms 440 KB Output is correct
60 Correct 2 ms 356 KB Output is correct
61 Correct 2 ms 340 KB Output is correct
62 Correct 2 ms 440 KB Output is correct
63 Correct 2 ms 468 KB Output is correct
64 Correct 2 ms 368 KB Output is correct
65 Correct 4 ms 1236 KB Output is correct
66 Correct 5 ms 1236 KB Output is correct
67 Correct 4 ms 1208 KB Output is correct
68 Correct 4 ms 1240 KB Output is correct
69 Correct 4 ms 1240 KB Output is correct
70 Correct 4 ms 1204 KB Output is correct
71 Correct 2 ms 480 KB Output is correct
72 Correct 2 ms 468 KB Output is correct
73 Correct 4 ms 1236 KB Output is correct
74 Correct 3 ms 1236 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 304 KB Output is correct
26 Correct 0 ms 296 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 300 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 300 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 5 ms 1236 KB Output is correct
39 Correct 5 ms 1236 KB Output is correct
40 Correct 4 ms 1236 KB Output is correct
41 Correct 4 ms 1276 KB Output is correct
42 Correct 4 ms 1236 KB Output is correct
43 Correct 4 ms 1236 KB Output is correct
44 Correct 4 ms 1176 KB Output is correct
45 Correct 4 ms 1236 KB Output is correct
46 Correct 5 ms 1236 KB Output is correct
47 Correct 5 ms 1236 KB Output is correct
48 Correct 5 ms 1120 KB Output is correct
49 Correct 4 ms 1236 KB Output is correct
50 Correct 4 ms 1236 KB Output is correct
51 Correct 4 ms 1260 KB Output is correct
52 Correct 4 ms 1252 KB Output is correct
53 Correct 4 ms 1240 KB Output is correct
54 Correct 4 ms 1264 KB Output is correct
55 Correct 4 ms 1284 KB Output is correct
56 Correct 3 ms 1240 KB Output is correct
57 Correct 4 ms 1236 KB Output is correct
58 Correct 4 ms 1236 KB Output is correct
59 Correct 2 ms 440 KB Output is correct
60 Correct 2 ms 356 KB Output is correct
61 Correct 2 ms 340 KB Output is correct
62 Correct 2 ms 440 KB Output is correct
63 Correct 2 ms 468 KB Output is correct
64 Correct 2 ms 368 KB Output is correct
65 Correct 4 ms 1236 KB Output is correct
66 Correct 5 ms 1236 KB Output is correct
67 Correct 4 ms 1208 KB Output is correct
68 Correct 4 ms 1240 KB Output is correct
69 Correct 4 ms 1240 KB Output is correct
70 Correct 4 ms 1204 KB Output is correct
71 Correct 2 ms 480 KB Output is correct
72 Correct 2 ms 468 KB Output is correct
73 Correct 4 ms 1236 KB Output is correct
74 Correct 3 ms 1236 KB Output is correct
75 Correct 810 ms 111108 KB Output is correct
76 Correct 811 ms 108048 KB Output is correct
77 Correct 712 ms 111420 KB Output is correct
78 Correct 716 ms 112956 KB Output is correct
79 Correct 535 ms 113404 KB Output is correct
80 Correct 483 ms 110080 KB Output is correct
81 Correct 401 ms 53340 KB Output is correct
82 Correct 494 ms 61528 KB Output is correct
83 Correct 432 ms 57252 KB Output is correct
84 Correct 440 ms 58564 KB Output is correct
85 Correct 429 ms 53984 KB Output is correct
86 Correct 291 ms 48304 KB Output is correct
87 Correct 298 ms 48492 KB Output is correct
88 Correct 380 ms 51076 KB Output is correct
89 Correct 371 ms 51396 KB Output is correct
90 Correct 316 ms 50952 KB Output is correct
91 Correct 301 ms 46348 KB Output is correct
92 Correct 262 ms 46364 KB Output is correct
93 Correct 290 ms 48328 KB Output is correct
94 Correct 287 ms 48556 KB Output is correct
95 Correct 296 ms 50592 KB Output is correct
96 Correct 146 ms 13792 KB Output is correct
97 Correct 155 ms 14912 KB Output is correct
98 Correct 150 ms 14612 KB Output is correct
99 Correct 136 ms 14752 KB Output is correct
100 Correct 148 ms 13860 KB Output is correct
101 Correct 134 ms 13804 KB Output is correct
102 Correct 280 ms 38832 KB Output is correct
103 Correct 270 ms 38112 KB Output is correct
104 Correct 359 ms 41260 KB Output is correct
105 Correct 288 ms 38316 KB Output is correct
106 Correct 274 ms 39120 KB Output is correct
107 Correct 235 ms 37328 KB Output is correct
108 Correct 672 ms 112292 KB Output is correct
109 Correct 678 ms 118964 KB Output is correct
110 Correct 131 ms 19204 KB Output is correct
111 Correct 140 ms 19284 KB Output is correct
112 Correct 681 ms 106024 KB Output is correct
113 Correct 520 ms 119228 KB Output is correct