oj.uz

Submission #106183

# Submission time Handle Problem Language Result Execution time Memory
106183 2019-04-17T07:20:35 Z mzhao Cake 3 (JOI19_cake3) C++11
100 / 100
 3238 ms 31964 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#define D(x...) printf(x)
#else
#define D(x...)
#endif

#define MN 200100
#define x first
#define y second

using ll = long long;

ll N, M, pos[MN], ans = -1e17;
pair<ll, ll> A[MN], ord[MN];
pair<ll, ll> t[4*MN]; // (cnt, sum)

struct State {
	ll l, h; 		// where the endpoint can be [l, h)
	ll ansl, ansh; // where the optimal point can be [ansl, ansh)
};
vector<State> level[20];

void update(ll n, ll a, ll b, ll x, ll v) {
	if (a == b-1) {
		if (v > 0) t[n].x++;
		else t[n].x--;
		t[n].y += v;
	} else {
		int m = (a+b)/2;
		if (x < m) update(2*n, a, m, x, v);
		else update(2*n+1, m, b, x, v);
		t[n].x = t[2*n].x+t[2*n+1].x;
		t[n].y = t[2*n].y+t[2*n+1].y;
	}
}

ll query(ll n, ll a, ll b, ll x) {
	if (a == b-1) return t[n].y;
	int m = (a+b)/2;
	if (t[2*n].x >= x) return query(2*n, a, m, x);
	return t[2*n].y+query(2*n+1, m, b, x-t[2*n].x);
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> N >> M;
	for (int i = 0; i < N; i++) cin >> A[i].y >> A[i].x;
	sort(A, A+N); reverse(A, A+N);
	for (int i = 0; i < N; i++) ord[i] = {A[i].y, i};
	sort(ord, ord+N); reverse(ord, ord+N);
	for (int i = 0; i < N; i++) pos[ord[i].y] = i;
	level[0].push_back({0, N, 0, N});
	for (int i = 0; level[i].size(); i++) {
		D("LEVEL %d ===================\n", i);
		int curl = 0, curr = 0;
		for (State j : level[i]) {
			D("state = %lld %lld %lld %lld\n", j.l, j.h, j.ansl, j.ansh);
			int m = (j.l+j.h)/2;
			assert(curr <= m);
			while (curr <= m) {
				D("push in %d   %d %d\n", curr, pos[curr], A[curr].y);
				update(1, 0, N, pos[curr], A[curr].y);
				curr++;
			}
			assert(curl <= j.ansl);
			while (curl < j.ansl) {
				D("pop out %d   %d %d\n", curl, pos[curl], -A[curl].y);
				update(1, 0, N, pos[curl], -A[curl].y);
				curl++;
				assert(curl <= curr);
			}
			ll curbest = -1e17, curpos = -1;
			assert(curl < j.ansh);
			while (curr-curl >= M) {
				ll cur = query(1, 0, N, M)-2*A[curl].x;
				D("try %d   %d\n", curl, cur);
				if (cur > curbest) {
					curbest = cur;
					curpos = curl;
				}
				if (curl == j.ansh-1) break;
				update(1, 0, N, pos[curl], -A[curl].y);
				curl++;
			}
			D("curl = %d   curr = %d\n", curl, curr);
			if (j.h < M) continue;
			if (j.l < j.h-1) {
				if (curpos != -1) level[i+1].push_back({j.l, m, j.ansl, curpos+1});
				if (curpos == -1) curpos = j.ansl;
				level[i+1].push_back({m, j.h, curpos, j.ansh});
			}
			if (curpos != -1) ans = max(ans, curbest+2*A[m].x);
		}
		while (curl < curr) {
			update(1, 0, N, pos[curl], -A[curl].y);
			curl++;
		}
	}
	cout << ans << "\n";
}

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 3 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 2 ms 256 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 3 ms 384 KB Output is correct
36 Correct 3 ms 384 KB Output is correct
37 Correct 3 ms 384 KB Output is correct
38 Correct 10 ms 684 KB Output is correct
39 Correct 10 ms 640 KB Output is correct
40 Correct 8 ms 640 KB Output is correct
41 Correct 8 ms 640 KB Output is correct
42 Correct 8 ms 640 KB Output is correct
43 Correct 10 ms 640 KB Output is correct
44 Correct 12 ms 640 KB Output is correct
45 Correct 9 ms 640 KB Output is correct
46 Correct 10 ms 768 KB Output is correct
47 Correct 9 ms 640 KB Output is correct
48 Correct 10 ms 640 KB Output is correct
49 Correct 9 ms 640 KB Output is correct
50 Correct 9 ms 768 KB Output is correct
51 Correct 9 ms 640 KB Output is correct
52 Correct 11 ms 540 KB Output is correct
53 Correct 10 ms 640 KB Output is correct
54 Correct 8 ms 640 KB Output is correct
55 Correct 7 ms 640 KB Output is correct
56 Correct 7 ms 640 KB Output is correct
57 Correct 8 ms 640 KB Output is correct
58 Correct 7 ms 512 KB Output is correct
59 Correct 9 ms 640 KB Output is correct
60 Correct 7 ms 640 KB Output is correct
61 Correct 7 ms 640 KB Output is correct
62 Correct 7 ms 640 KB Output is correct
63 Correct 7 ms 640 KB Output is correct
64 Correct 7 ms 640 KB Output is correct
65 Correct 8 ms 640 KB Output is correct
66 Correct 10 ms 640 KB Output is correct
67 Correct 9 ms 640 KB Output is correct
68 Correct 10 ms 640 KB Output is correct
69 Correct 7 ms 640 KB Output is correct
70 Correct 7 ms 640 KB Output is correct
71 Correct 7 ms 640 KB Output is correct
72 Correct 7 ms 640 KB Output is correct
73 Correct 7 ms 640 KB Output is correct
74 Correct 8 ms 512 KB Output is correct
75 Correct 2588 ms 31176 KB Output is correct
76 Correct 2495 ms 31964 KB Output is correct
77 Correct 2698 ms 28004 KB Output is correct
78 Correct 2500 ms 30844 KB Output is correct
79 Correct 2337 ms 19840 KB Output is correct
80 Correct 2533 ms 20568 KB Output is correct
81 Correct 2855 ms 30120 KB Output is correct
82 Correct 2942 ms 31676 KB Output is correct
83 Correct 3238 ms 31244 KB Output is correct
84 Correct 3167 ms 31492 KB Output is correct
85 Correct 2910 ms 30328 KB Output is correct
86 Correct 2278 ms 25256 KB Output is correct
87 Correct 2140 ms 25368 KB Output is correct
88 Correct 2256 ms 27172 KB Output is correct
89 Correct 2530 ms 27348 KB Output is correct
90 Correct 2489 ms 26096 KB Output is correct
91 Correct 2371 ms 22892 KB Output is correct
92 Correct 2171 ms 22992 KB Output is correct
93 Correct 2378 ms 24920 KB Output is correct
94 Correct 2609 ms 22636 KB Output is correct
95 Correct 2774 ms 25868 KB Output is correct
96 Correct 1012 ms 30296 KB Output is correct
97 Correct 1130 ms 30892 KB Output is correct
98 Correct 1100 ms 31108 KB Output is correct
99 Correct 1145 ms 30348 KB Output is correct
100 Correct 988 ms 25896 KB Output is correct
101 Correct 919 ms 26848 KB Output is correct
102 Correct 1685 ms 31188 KB Output is correct
103 Correct 1755 ms 30648 KB Output is correct
104 Correct 1608 ms 31772 KB Output is correct
105 Correct 1845 ms 29852 KB Output is correct
106 Correct 1748 ms 29948 KB Output is correct
107 Correct 1904 ms 26152 KB Output is correct
108 Correct 2491 ms 27880 KB Output is correct
109 Correct 2385 ms 26276 KB Output is correct
110 Correct 1558 ms 25332 KB Output is correct
111 Correct 1672 ms 30692 KB Output is correct
112 Correct 1191 ms 27552 KB Output is correct
113 Correct 2795 ms 20344 KB Output is correct