oj.uz

Submission #120911

# Submission time Handle Problem Language Result Execution time Memory
120911 2019-06-25T17:46:48 Z youngyojun Cake 3 (JOI19_cake3) C++11
100 / 100
 1173 ms 15180 KB 
#include <bits/stdc++.h>
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define sorv(V) sort(allv(V))
#define upmax(a,b) (a)=max((a),(b))
#define INFLL (0x3f3f3f3f3f3f3f3fll)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;

const bool debug = 0;

const int MAXN = 200055;

struct SEG {
	ll ds[MAXN*4];
	int dc[MAXN*4];

	void push(int i, int s, int e, int x, ll r) {
		ds[i] += r; dc[i]++;
		if(s == e) return;
		int m = (s+e) >> 1;
		if(x <= m) push(i<<1, s, m, x, r);
		else push(i<<1|1, m+1, e, x, r);
	}
	void pop(int i, int s, int e, int x, ll r) {
		ds[i] -= r; dc[i]--;
		if(s == e) return;
		int m = (s+e) >> 1;
		if(x <= m) pop(i<<1, s, m, x, r);
		else pop(i<<1|1, m+1, e, x, r);
	}
	ll get(int i, int s, int e, int c) {
		if(!c) return 0;
		if(dc[i] == c) return ds[i];
		int m = (s+e) >> 1;
		if(c <= dc[i<<1]) return get(i<<1, s, m, c);
		else return get(i<<1, s, m, dc[i<<1]) + get(i<<1|1, m+1, e, c - dc[i<<1]);
	}
} seg;

int PQs, PQe;

ll A[MAXN], B[MAXN];
int AO[MAXN], ARO[MAXN];

ll Ans = -INFLL;
int N, M;

void f(int s, int e) {
	for(; s < PQs;) {
		PQs--;
		seg.push(1, 1, N, ARO[PQs], A[PQs]);
	}
	for(; PQe < e;) {
		PQe++;
		seg.push(1, 1, N, ARO[PQe], A[PQe]);
	}
	for(; PQs < s;) {
		seg.pop(1, 1, N, ARO[PQs], A[PQs]);
		PQs++;
	}
	for(; e < PQe;) {
		seg.pop(1, 1, N, ARO[PQe], A[PQe]);
		PQe--;
	}
}

void f(int s, int e, int p, int q) {
	if(s > e || p > q) return;
	int m = (s+e) >> 1;
	ll hc = -INFLL; int hi = -1;
	for(int i = max(m+M+1, p); i <= q; i++) {
		f(m+1, i-1);
		ll ret = seg.get(1, 1, N, M) + A[m] + B[m] + A[i] - B[i];
		if(ret <= hc) continue;
		hc = ret; hi = i;
	}
	if(debug) {
		printf("F %d %d %d %d / %d %lld %d\n", s, e, p, q, m, hc, hi);
	}
	upmax(Ans, hc);
	f(s, m-1, p, hi);
	f(m+1, e, hi, q);
}

int main() {
	ios::sync_with_stdio(false);

	cin >> N >> M; M -= 2;
	{
		vector<pll> V;
		for(int i = 0, a, b; i < N; i++) {
			cin >> a >> b;
			V.eb(b << 1, a);
		}
		sorv(V);
		for(int i = 1; i <= N; i++)
			tie(B[i], A[i]) = V[i-1];
	}
	iota(AO, AO+N+1, 0);
	sort(AO+1, AO+N+1, [&](int a, int b) {
		return A[a] > A[b];
	});
	for(int i = 1; i <= N; i++) ARO[AO[i]] = i;

	PQs = PQe = 1;
	seg.push(1, 1, N, ARO[1], A[1]);

	if(debug) {
		for(int i = 1; i <= N; i++)
			printf("%d ; %d %lld %lld\n", i, ARO[i], A[i], B[i]);
	}

	f(1, N-M-1, 1, N);

	cout << Ans << endl;
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 356 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 356 KB Output is correct
13 Correct 2 ms 356 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 2 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 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 356 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
31 Correct 2 ms 384 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 2 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 2 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 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 356 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 356 KB Output is correct
13 Correct 2 ms 356 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 2 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 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 356 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
31 Correct 2 ms 384 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 2 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 6 ms 512 KB Output is correct
39 Correct 5 ms 512 KB Output is correct
40 Correct 5 ms 512 KB Output is correct
41 Correct 5 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 4 ms 512 KB Output is correct
44 Correct 5 ms 512 KB Output is correct
45 Correct 6 ms 512 KB Output is correct
46 Correct 6 ms 512 KB Output is correct
47 Correct 6 ms 512 KB Output is correct
48 Correct 6 ms 632 KB Output is correct
49 Correct 4 ms 556 KB Output is correct
50 Correct 5 ms 512 KB Output is correct
51 Correct 5 ms 512 KB Output is correct
52 Correct 4 ms 512 KB Output is correct
53 Correct 5 ms 484 KB Output is correct
54 Correct 4 ms 512 KB Output is correct
55 Correct 4 ms 512 KB Output is correct
56 Correct 3 ms 476 KB Output is correct
57 Correct 4 ms 512 KB Output is correct
58 Correct 3 ms 512 KB Output is correct
59 Correct 4 ms 512 KB Output is correct
60 Correct 5 ms 512 KB Output is correct
61 Correct 4 ms 512 KB Output is correct
62 Correct 4 ms 512 KB Output is correct
63 Correct 5 ms 512 KB Output is correct
64 Correct 4 ms 512 KB Output is correct
65 Correct 5 ms 512 KB Output is correct
66 Correct 5 ms 512 KB Output is correct
67 Correct 5 ms 512 KB Output is correct
68 Correct 5 ms 524 KB Output is correct
69 Correct 4 ms 512 KB Output is correct
70 Correct 5 ms 512 KB Output is correct
71 Correct 5 ms 512 KB Output is correct
72 Correct 4 ms 512 KB Output is correct
73 Correct 4 ms 512 KB Output is correct
74 Correct 3 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 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 356 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 356 KB Output is correct
13 Correct 2 ms 356 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 2 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 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 356 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
31 Correct 2 ms 384 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 2 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 6 ms 512 KB Output is correct
39 Correct 5 ms 512 KB Output is correct
40 Correct 5 ms 512 KB Output is correct
41 Correct 5 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 4 ms 512 KB Output is correct
44 Correct 5 ms 512 KB Output is correct
45 Correct 6 ms 512 KB Output is correct
46 Correct 6 ms 512 KB Output is correct
47 Correct 6 ms 512 KB Output is correct
48 Correct 6 ms 632 KB Output is correct
49 Correct 4 ms 556 KB Output is correct
50 Correct 5 ms 512 KB Output is correct
51 Correct 5 ms 512 KB Output is correct
52 Correct 4 ms 512 KB Output is correct
53 Correct 5 ms 484 KB Output is correct
54 Correct 4 ms 512 KB Output is correct
55 Correct 4 ms 512 KB Output is correct
56 Correct 3 ms 476 KB Output is correct
57 Correct 4 ms 512 KB Output is correct
58 Correct 3 ms 512 KB Output is correct
59 Correct 4 ms 512 KB Output is correct
60 Correct 5 ms 512 KB Output is correct
61 Correct 4 ms 512 KB Output is correct
62 Correct 4 ms 512 KB Output is correct
63 Correct 5 ms 512 KB Output is correct
64 Correct 4 ms 512 KB Output is correct
65 Correct 5 ms 512 KB Output is correct
66 Correct 5 ms 512 KB Output is correct
67 Correct 5 ms 512 KB Output is correct
68 Correct 5 ms 524 KB Output is correct
69 Correct 4 ms 512 KB Output is correct
70 Correct 5 ms 512 KB Output is correct
71 Correct 5 ms 512 KB Output is correct
72 Correct 4 ms 512 KB Output is correct
73 Correct 4 ms 512 KB Output is correct
74 Correct 3 ms 512 KB Output is correct
75 Correct 998 ms 14700 KB Output is correct
76 Correct 1148 ms 14424 KB Output is correct
77 Correct 893 ms 14656 KB Output is correct
78 Correct 967 ms 14776 KB Output is correct
79 Correct 131 ms 14676 KB Output is correct
80 Correct 188 ms 14596 KB Output is correct
81 Correct 860 ms 13940 KB Output is correct
82 Correct 1173 ms 14068 KB Output is correct
83 Correct 1058 ms 14292 KB Output is correct
84 Correct 1105 ms 14268 KB Output is correct
85 Correct 993 ms 13996 KB Output is correct
86 Correct 564 ms 13716 KB Output is correct
87 Correct 703 ms 13624 KB Output is correct
88 Correct 821 ms 13612 KB Output is correct
89 Correct 751 ms 13984 KB Output is correct
90 Correct 557 ms 14300 KB Output is correct
91 Correct 356 ms 13712 KB Output is correct
92 Correct 380 ms 13648 KB Output is correct
93 Correct 471 ms 13996 KB Output is correct
94 Correct 330 ms 14124 KB Output is correct
95 Correct 580 ms 14292 KB Output is correct
96 Correct 415 ms 13712 KB Output is correct
97 Correct 443 ms 14236 KB Output is correct
98 Correct 491 ms 14180 KB Output is correct
99 Correct 402 ms 14152 KB Output is correct
100 Correct 328 ms 13812 KB Output is correct
101 Correct 344 ms 13752 KB Output is correct
102 Correct 794 ms 13680 KB Output is correct
103 Correct 742 ms 13720 KB Output is correct
104 Correct 865 ms 13948 KB Output is correct
105 Correct 692 ms 13960 KB Output is correct
106 Correct 679 ms 14200 KB Output is correct
107 Correct 579 ms 13944 KB Output is correct
108 Correct 789 ms 14556 KB Output is correct
109 Correct 613 ms 15048 KB Output is correct
110 Correct 452 ms 13152 KB Output is correct
111 Correct 650 ms 13272 KB Output is correct
112 Correct 514 ms 13096 KB Output is correct
113 Correct 122 ms 15180 KB Output is correct