Submission #530315

# Submission time Handle Problem Language Result Execution time Memory
530315 2022-02-25T03:50:12 Z fhvirus Cake 3 (JOI19_cake3) C++17
100 / 100
2249 ms 17076 KB
#include<bits/stdc++.h>
using namespace std;

struct Lisan: vector<int> {
	void done() { sort(begin(), end()); erase(unique(begin(), end()), end()); }
	const int operator () (const int& v) const { return lower_bound(begin(), end(), v) - begin(); }
};
struct DS {
	int N, M, lp, rp;
	vector<int> val;
	Lisan lisan;
	vector<int64_t> sum;
	vector<int> cnt;
	DS (int _M): M(_M), val(1, 0) {}
	void add(const int& v) { lisan.emplace_back(v); val.emplace_back(v); }
	void build() {
		lisan.done();
		N = lisan.size();
		lp = 1; rp = 0;
		sum.assign(N * 4, 0ll);
		cnt.assign(N * 4, 0);
	}
	void modify(int i, int l, int r, int p, int v) {
		if (l + 1 == r) {
			sum[i] += lisan[p] * v;
			cnt[i] += v;
			return;
		}
		int m = (l + r) / 2;
		if (p < m) modify(i * 2, l, m, p, v);
		else modify(i * 2 + 1, m, r, p, v);
		sum[i] = sum[i * 2] + sum[i * 2 + 1];
		cnt[i] = cnt[i * 2] + cnt[i * 2 + 1];
		return;
	}
	int64_t query(int i, int l, int r, int k) {
		if (l + 1 == r)
			return (int64_t) lisan[l] * k;
		if (cnt[i] == k)
			return sum[i];
		int m = (l + r) / 2;
		if (cnt[i * 2 + 1] >= k)
			return query(i * 2 + 1, m, r, k);
		return sum[i * 2 + 1] + query(i * 2, l, m, k - cnt[i * 2 + 1]);
	}
	void clean() {
		for (int i = lp; i <= rp; ++i)
			modify(1, 0, N, lisan(val[i]), -1);
		lp = 1; rp = 0;
	}
	int64_t query(int l, int r) {
		if (l < lp) clean();
		while (rp < r) modify(1, 0, N, lisan(val[++rp]),  1);
		while (lp < l) modify(1, 0, N, lisan(val[lp++]), -1);
		return query(1, 0, N, M);
	}
};

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

	int N, M; cin >> N >> M;
	vector<pair<int, int>> cakes(N + 1);
	for (int i = 1; i <= N; ++i)
		cin >> cakes[i].second >> cakes[i].first;

	sort(begin(cakes) + 1, end(cakes));

	DS ds(M);
	for (int i = 1; i <= N; ++i)
		ds.add(cakes[i].second);
	ds.build();

	int64_t ans = LLONG_MIN;

	queue<tuple<int, int, int, int>> q;
	q.emplace(1, N - M + 1, M, N);
	while (!q.empty()) {
		auto [l, r, sl, sr] = q.front(); q.pop();
		r = min(r, sr - M + 1);
		if (l > r) continue;
		int m = (l + r) / 2;
		int bests = -1;
		int64_t bestv = LLONG_MIN;
		for (int i = max(sl, m + M - 1); i <= sr; ++i) {
			int64_t val = ds.query(m, i) - 2ll * (cakes[i].first - cakes[m].first);
			if (val > bestv) {
				bests = i;
				bestv = val;
			}
		}
		ans = max(ans, bestv);
		if (l <= m - 1) q.emplace(l, m - 1, sl, bests);
		if (m + 1 <= r) q.emplace(m + 1, r, bests, sr);
	}

	cout << ans << '\n';

	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 320 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 320 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 8 ms 432 KB Output is correct
39 Correct 9 ms 332 KB Output is correct
40 Correct 7 ms 332 KB Output is correct
41 Correct 6 ms 332 KB Output is correct
42 Correct 6 ms 436 KB Output is correct
43 Correct 6 ms 432 KB Output is correct
44 Correct 7 ms 332 KB Output is correct
45 Correct 8 ms 448 KB Output is correct
46 Correct 8 ms 332 KB Output is correct
47 Correct 8 ms 332 KB Output is correct
48 Correct 8 ms 332 KB Output is correct
49 Correct 8 ms 332 KB Output is correct
50 Correct 8 ms 332 KB Output is correct
51 Correct 10 ms 332 KB Output is correct
52 Correct 7 ms 332 KB Output is correct
53 Correct 8 ms 332 KB Output is correct
54 Correct 9 ms 332 KB Output is correct
55 Correct 6 ms 332 KB Output is correct
56 Correct 6 ms 332 KB Output is correct
57 Correct 6 ms 332 KB Output is correct
58 Correct 6 ms 440 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 6 ms 332 KB Output is correct
66 Correct 7 ms 332 KB Output is correct
67 Correct 6 ms 332 KB Output is correct
68 Correct 7 ms 332 KB Output is correct
69 Correct 6 ms 432 KB Output is correct
70 Correct 6 ms 432 KB Output is correct
71 Correct 2 ms 332 KB Output is correct
72 Correct 2 ms 332 KB Output is correct
73 Correct 6 ms 332 KB Output is correct
74 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 320 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 8 ms 432 KB Output is correct
39 Correct 9 ms 332 KB Output is correct
40 Correct 7 ms 332 KB Output is correct
41 Correct 6 ms 332 KB Output is correct
42 Correct 6 ms 436 KB Output is correct
43 Correct 6 ms 432 KB Output is correct
44 Correct 7 ms 332 KB Output is correct
45 Correct 8 ms 448 KB Output is correct
46 Correct 8 ms 332 KB Output is correct
47 Correct 8 ms 332 KB Output is correct
48 Correct 8 ms 332 KB Output is correct
49 Correct 8 ms 332 KB Output is correct
50 Correct 8 ms 332 KB Output is correct
51 Correct 10 ms 332 KB Output is correct
52 Correct 7 ms 332 KB Output is correct
53 Correct 8 ms 332 KB Output is correct
54 Correct 9 ms 332 KB Output is correct
55 Correct 6 ms 332 KB Output is correct
56 Correct 6 ms 332 KB Output is correct
57 Correct 6 ms 332 KB Output is correct
58 Correct 6 ms 440 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 6 ms 332 KB Output is correct
66 Correct 7 ms 332 KB Output is correct
67 Correct 6 ms 332 KB Output is correct
68 Correct 7 ms 332 KB Output is correct
69 Correct 6 ms 432 KB Output is correct
70 Correct 6 ms 432 KB Output is correct
71 Correct 2 ms 332 KB Output is correct
72 Correct 2 ms 332 KB Output is correct
73 Correct 6 ms 332 KB Output is correct
74 Correct 1 ms 332 KB Output is correct
75 Correct 2241 ms 12924 KB Output is correct
76 Correct 2249 ms 16156 KB Output is correct
77 Correct 2189 ms 16164 KB Output is correct
78 Correct 2214 ms 16596 KB Output is correct
79 Correct 1106 ms 16124 KB Output is correct
80 Correct 1700 ms 15688 KB Output is correct
81 Correct 1546 ms 8212 KB Output is correct
82 Correct 1819 ms 9388 KB Output is correct
83 Correct 1747 ms 9084 KB Output is correct
84 Correct 1768 ms 9116 KB Output is correct
85 Correct 1561 ms 8388 KB Output is correct
86 Correct 1379 ms 7380 KB Output is correct
87 Correct 1350 ms 7476 KB Output is correct
88 Correct 1462 ms 7828 KB Output is correct
89 Correct 1487 ms 7856 KB Output is correct
90 Correct 1458 ms 7888 KB Output is correct
91 Correct 1219 ms 6964 KB Output is correct
92 Correct 1202 ms 7012 KB Output is correct
93 Correct 1340 ms 7476 KB Output is correct
94 Correct 1286 ms 7452 KB Output is correct
95 Correct 1453 ms 7700 KB Output is correct
96 Correct 78 ms 6724 KB Output is correct
97 Correct 100 ms 7336 KB Output is correct
98 Correct 92 ms 7256 KB Output is correct
99 Correct 82 ms 7068 KB Output is correct
100 Correct 76 ms 6556 KB Output is correct
101 Correct 79 ms 6580 KB Output is correct
102 Correct 729 ms 7252 KB Output is correct
103 Correct 682 ms 6988 KB Output is correct
104 Correct 764 ms 7452 KB Output is correct
105 Correct 666 ms 6920 KB Output is correct
106 Correct 667 ms 7112 KB Output is correct
107 Correct 621 ms 6700 KB Output is correct
108 Correct 2145 ms 16196 KB Output is correct
109 Correct 2245 ms 17076 KB Output is correct
110 Correct 224 ms 5976 KB Output is correct
111 Correct 240 ms 6592 KB Output is correct
112 Correct 949 ms 14580 KB Output is correct
113 Correct 133 ms 16932 KB Output is correct