oj.uz

Submission #220610

# Submission time Handle Problem Language Result Execution time Memory
220610 2020-04-08T08:27:58 Z atoiz Cake 3 (JOI19_cake3) C++14
100 / 100
 474 ms 9720 KB 
/*input
8 4
112103441 501365808
659752417 137957977
86280801 257419447
902409188 565237611
965602301 689654312
104535476 646977261
945132881 114821749
198700181 915994879
*/
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>

using namespace std;

const int MAXN = 200007, LOG = __lg(MAXN) + 1;
const int64_t INF = 1e17;

int64_t bit_sum[MAXN];
int bit_cnt[MAXN];
void add(int i, int64_t x)
{
	for (; i < MAXN; i += i & (-i)) bit_sum[i] += x, ++bit_cnt[i];
}

void rem(int i, int64_t x)
{
	for (; i < MAXN; i += i & (-i)) bit_sum[i] -= x, --bit_cnt[i];
}

int64_t get(int k)
{
	int64_t ans = 0;
	for (int i = 0, j = LOG - 1; j >= 0; --j) {
		if ((i | (1 << j)) < MAXN && bit_cnt[i | (1 << j)] <= k) {
			i |= (1 << j);
			k -= bit_cnt[i];
			ans += bit_sum[i];
		}
	}
	return ans;
}

int N, M;
int64_t ans = -INF;
int sortedC[MAXN], rankC[MAXN];
pair<int, int> cakes[MAXN];

int ptr_l = 0, ptr_r = -1;
int64_t calc(int l, int r)
{
	if (l + M - 1 > r) return -INF;
	while (ptr_l < l) rem(rankC[ptr_l], cakes[ptr_l].second), ++ptr_l;
	while (ptr_l > l) --ptr_l, add(rankC[ptr_l], cakes[ptr_l].second);
	while (ptr_r > r) rem(rankC[ptr_r], cakes[ptr_r].second), --ptr_r;
	while (ptr_r < r) ++ptr_r, add(rankC[ptr_r], cakes[ptr_r].second);
	return get(M) - 2ll * (cakes[r].first - cakes[l].first);
}

void solve(int opt_l, int opt_r, int l, int r)
{
	if (l > r) return;
	if (opt_l == opt_r) {
		for (int i = l; i <= r; ++i) ans = max(ans, calc(opt_l, i));
		return;
	}

	int m = (l + r) >> 1;
	int opt_m = opt_l;
	int64_t ans_m = calc(opt_m, m);
	for (int i = opt_l + 1; i <= opt_r; ++i) {
		int64_t cur = calc(i, m);
		if (cur > ans_m) {
			ans_m = cur;
			opt_m = i;
		}
	}

	ans = max(ans, ans_m);
	solve(opt_l, opt_m, l, m - 1);
	solve(opt_m, opt_r, m + 1, r);
}

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> N >> M;
	for (int i = 0; i < N; ++i) {
		cin >> cakes[i].second >> cakes[i].first;
	}
	sort(cakes, cakes + N);

	iota(sortedC, sortedC + N, 0);
	sort(sortedC, sortedC + N, [&](int i, int j) { return cakes[i].second > cakes[j].second; });
	for (int i = 0; i < N; ++i) rankC[sortedC[i]] = i + 1;

	solve(0, N - 1, 0, N - 1);
	cout << ans << endl;
	return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 512 KB Output is correct
36 Correct 5 ms 512 KB Output is correct
37 Correct 5 ms 512 KB Output is correct
38 Correct 7 ms 512 KB Output is correct
39 Correct 7 ms 512 KB Output is correct
40 Correct 7 ms 512 KB Output is correct
41 Correct 7 ms 512 KB Output is correct
42 Correct 6 ms 512 KB Output is correct
43 Correct 6 ms 512 KB Output is correct
44 Correct 8 ms 512 KB Output is correct
45 Correct 7 ms 512 KB Output is correct
46 Correct 8 ms 512 KB Output is correct
47 Correct 7 ms 512 KB Output is correct
48 Correct 10 ms 532 KB Output is correct
49 Correct 7 ms 512 KB Output is correct
50 Correct 7 ms 512 KB Output is correct
51 Correct 7 ms 512 KB Output is correct
52 Correct 7 ms 512 KB Output is correct
53 Correct 7 ms 512 KB Output is correct
54 Correct 6 ms 512 KB Output is correct
55 Correct 6 ms 512 KB Output is correct
56 Correct 6 ms 512 KB Output is correct
57 Correct 6 ms 512 KB Output is correct
58 Correct 6 ms 512 KB Output is correct
59 Correct 6 ms 512 KB Output is correct
60 Correct 7 ms 512 KB Output is correct
61 Correct 6 ms 512 KB Output is correct
62 Correct 6 ms 512 KB Output is correct
63 Correct 6 ms 512 KB Output is correct
64 Correct 6 ms 512 KB Output is correct
65 Correct 7 ms 512 KB Output is correct
66 Correct 7 ms 512 KB Output is correct
67 Correct 7 ms 512 KB Output is correct
68 Correct 7 ms 512 KB Output is correct
69 Correct 7 ms 512 KB Output is correct
70 Correct 7 ms 512 KB Output is correct
71 Correct 6 ms 512 KB Output is correct
72 Correct 6 ms 512 KB Output is correct
73 Correct 7 ms 512 KB Output is correct
74 Correct 5 ms 512 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 512 KB Output is correct
36 Correct 5 ms 512 KB Output is correct
37 Correct 5 ms 512 KB Output is correct
38 Correct 7 ms 512 KB Output is correct
39 Correct 7 ms 512 KB Output is correct
40 Correct 7 ms 512 KB Output is correct
41 Correct 7 ms 512 KB Output is correct
42 Correct 6 ms 512 KB Output is correct
43 Correct 6 ms 512 KB Output is correct
44 Correct 8 ms 512 KB Output is correct
45 Correct 7 ms 512 KB Output is correct
46 Correct 8 ms 512 KB Output is correct
47 Correct 7 ms 512 KB Output is correct
48 Correct 10 ms 532 KB Output is correct
49 Correct 7 ms 512 KB Output is correct
50 Correct 7 ms 512 KB Output is correct
51 Correct 7 ms 512 KB Output is correct
52 Correct 7 ms 512 KB Output is correct
53 Correct 7 ms 512 KB Output is correct
54 Correct 6 ms 512 KB Output is correct
55 Correct 6 ms 512 KB Output is correct
56 Correct 6 ms 512 KB Output is correct
57 Correct 6 ms 512 KB Output is correct
58 Correct 6 ms 512 KB Output is correct
59 Correct 6 ms 512 KB Output is correct
60 Correct 7 ms 512 KB Output is correct
61 Correct 6 ms 512 KB Output is correct
62 Correct 6 ms 512 KB Output is correct
63 Correct 6 ms 512 KB Output is correct
64 Correct 6 ms 512 KB Output is correct
65 Correct 7 ms 512 KB Output is correct
66 Correct 7 ms 512 KB Output is correct
67 Correct 7 ms 512 KB Output is correct
68 Correct 7 ms 512 KB Output is correct
69 Correct 7 ms 512 KB Output is correct
70 Correct 7 ms 512 KB Output is correct
71 Correct 6 ms 512 KB Output is correct
72 Correct 6 ms 512 KB Output is correct
73 Correct 7 ms 512 KB Output is correct
74 Correct 5 ms 512 KB Output is correct
75 Correct 391 ms 9084 KB Output is correct
76 Correct 445 ms 8824 KB Output is correct
77 Correct 349 ms 9208 KB Output is correct
78 Correct 366 ms 9288 KB Output is correct
79 Correct 114 ms 9208 KB Output is correct
80 Correct 140 ms 9080 KB Output is correct
81 Correct 375 ms 8440 KB Output is correct
82 Correct 474 ms 8696 KB Output is correct
83 Correct 433 ms 8696 KB Output is correct
84 Correct 445 ms 8824 KB Output is correct
85 Correct 384 ms 8440 KB Output is correct
86 Correct 229 ms 8184 KB Output is correct
87 Correct 237 ms 8056 KB Output is correct
88 Correct 338 ms 8068 KB Output is correct
89 Correct 342 ms 8440 KB Output is correct
90 Correct 230 ms 8696 KB Output is correct
91 Correct 173 ms 8184 KB Output is correct
92 Correct 192 ms 8212 KB Output is correct
93 Correct 202 ms 8440 KB Output is correct
94 Correct 160 ms 8696 KB Output is correct
95 Correct 233 ms 8824 KB Output is correct
96 Correct 273 ms 8184 KB Output is correct
97 Correct 289 ms 8696 KB Output is correct
98 Correct 305 ms 8700 KB Output is correct
99 Correct 270 ms 8696 KB Output is correct
100 Correct 221 ms 8184 KB Output is correct
101 Correct 244 ms 8184 KB Output is correct
102 Correct 355 ms 8184 KB Output is correct
103 Correct 352 ms 8056 KB Output is correct
104 Correct 396 ms 8548 KB Output is correct
105 Correct 318 ms 8568 KB Output is correct
106 Correct 312 ms 8652 KB Output is correct
107 Correct 284 ms 8568 KB Output is correct
108 Correct 331 ms 8952 KB Output is correct
109 Correct 287 ms 9464 KB Output is correct
110 Correct 182 ms 7672 KB Output is correct
111 Correct 247 ms 7928 KB Output is correct
112 Correct 236 ms 7416 KB Output is correct
113 Correct 127 ms 9720 KB Output is correct