oj.uz

Submission #104829

# Submission time Handle Problem Language Result Execution time Memory
104829 2019-04-09T10:28:01 Z Just_Solve_The_Problem Cake 3 (JOI19_cake3) C++11
100 / 100
 1382 ms 248732 KB 
#include <bits/stdc++.h>

#define fr first
#define sc second
#define ll long long
#define ok puts("ok");

using namespace std;

const int N = (int)2e5 + 7;

pair < ll, ll > ar[N];
int n, m;
ll pref[N], suf[N];
ll ans;
int siz = 1;
int root[N];

struct node {
	int l, r;
	ll sum;
	int cnt;
	node() {
		l = r = 0;
		sum = 0;
		cnt = 0;
	}
};
node tree[N * 50];

void build(int v = 1, int l = 1, int r = n) {
	if (l == r) {
		return ;
	}
	int mid = (l + r) >> 1;
	tree[v].l = ++siz;
	tree[v].r = ++siz;
	build(tree[v].l, l, mid);
	build(tree[v].r, mid + 1, r);
}

void upd(int ov, int nv, int pos, int val, int l = 1, int r = n) {
	if (l == r) {
		tree[nv].sum += val;
		tree[nv].cnt++;
		return ;
	}
	int mid = (l + r) >> 1;
	if (pos <= mid) {
		tree[nv].l = ++siz;
		tree[nv].r = tree[ov].r;
		upd(tree[ov].l, tree[nv].l, pos, val, l, mid);
	} else {
		tree[nv].l = tree[ov].l;
		tree[nv].r = ++siz;
		upd(tree[ov].r, tree[nv].r, pos, val, mid + 1, r);
	}
	tree[nv].sum = tree[tree[nv].l].sum + tree[tree[nv].r].sum;
	tree[nv].cnt = tree[tree[nv].l].cnt + tree[tree[nv].r].cnt;
}

ll getsum(int lv, int rv, int l = 1, int r = n, int keep = m - 2) {
	if (keep == 0) return 0;
	if (keep >= tree[rv].cnt - tree[lv].cnt) {
		return tree[rv].sum - tree[lv].sum;
	} 
	int mid = (l + r) >> 1;
	return getsum(tree[lv].l, tree[rv].l, l, mid, max(keep - (tree[tree[rv].r].cnt - tree[tree[lv].r].cnt), 0)) + getsum(tree[lv].r, tree[rv].r, mid + 1, r, keep);
}

ll get(ll l, ll r) {
	return getsum(root[l - 1], root[r]);
}

void make(int l, int r, int optl, int optr) {
	if (l > r) return ;
	int mid = (l + r) >> 1;
	int opt = min(max(mid + m - 1, optl), optr);
	ll res = -1e18;
	for (int i = max(mid + m - 1, optl); i <= optr; i++) {
		ll cost = get(mid + 1, i - 1) + ar[mid].fr + ar[i].fr - 2 * (ar[i].sc - ar[mid].sc);
		// cout << mid << ' ' << i << ' ' << cost << endl;
		if (cost > res) {
			res = cost;
			opt = i;
		}
	}
	// cout << "### " << mid << ' ' << res << ' ' << opt << endl;
	if (res > ans) {
		ans = res;
	}
	make(l, mid - 1, optl, opt);
	make(mid + 1, r, opt, optr);
}

void solve() {
	build();
	root[0] = 1;
	vector < pair < int, int > > vx;
	int asd[N];
	for (int i = 1; i <= n; i++) {
		vx.push_back({ar[i].fr, i});
	}
	sort(vx.begin(), vx.end());
	for (int i = 1; i <= n; i++) {
		asd[vx[i - 1].sc] = i; 
	}
	for (int i = 1; i <= n; i++) {
		root[i] = ++siz;
		upd(root[i - 1], root[i], asd[i], ar[i].fr);
	}
	make(1, n, 1, n);
}

main() {
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++) {
		scanf("%lld %lld", &ar[i].sc, &ar[i].fr);
	}
	sort(ar + 1, ar + n + 1);
	pref[0] = -1e18;
	for (int i = 1; i <= n; i++) {
		swap(ar[i].fr, ar[i].sc);
		pref[i] = max(pref[i - 1], ar[i].fr + 2 * ar[i].sc);
	}
	suf[n + 1] = -1e18;
	for (int i = n; i >= 1; i--) {
		suf[i] = max(suf[i + 1], ar[i].fr - 2 * ar[i].sc);
	}
	ans = -1e18;
	solve();
	cout << ans;
}

Compilation message

cake3.cpp:115:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
cake3.cpp: In function 'int main()':
cake3.cpp:116:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~
cake3.cpp:118:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld", &ar[i].sc, &ar[i].fr);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 184 ms 235184 KB Output is correct
2 Correct 177 ms 235256 KB Output is correct
3 Correct 186 ms 235128 KB Output is correct
4 Correct 211 ms 235204 KB Output is correct
5 Correct 191 ms 235256 KB Output is correct
6 Correct 200 ms 235128 KB Output is correct
7 Correct 199 ms 235256 KB Output is correct
8 Correct 206 ms 235384 KB Output is correct
9 Correct 216 ms 235256 KB Output is correct
10 Correct 199 ms 235256 KB Output is correct
11 Correct 203 ms 235240 KB Output is correct
12 Correct 220 ms 235256 KB Output is correct
13 Correct 201 ms 235260 KB Output is correct
14 Correct 195 ms 235264 KB Output is correct
15 Correct 175 ms 235212 KB Output is correct
16 Correct 251 ms 235128 KB Output is correct
17 Correct 195 ms 235116 KB Output is correct
18 Correct 197 ms 235128 KB Output is correct
19 Correct 196 ms 235124 KB Output is correct
20 Correct 197 ms 235256 KB Output is correct
21 Correct 205 ms 235228 KB Output is correct
22 Correct 193 ms 235172 KB Output is correct
23 Correct 214 ms 235172 KB Output is correct
24 Correct 178 ms 235304 KB Output is correct
25 Correct 188 ms 235256 KB Output is correct
26 Correct 194 ms 235224 KB Output is correct
27 Correct 220 ms 235264 KB Output is correct
28 Correct 196 ms 235224 KB Output is correct
29 Correct 179 ms 235448 KB Output is correct
30 Correct 192 ms 235252 KB Output is correct
31 Correct 208 ms 235280 KB Output is correct
32 Correct 206 ms 235264 KB Output is correct
33 Correct 208 ms 235204 KB Output is correct
34 Correct 195 ms 235276 KB Output is correct
35 Correct 197 ms 235260 KB Output is correct
36 Correct 207 ms 235268 KB Output is correct
37 Correct 197 ms 235296 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 184 ms 235184 KB Output is correct
2 Correct 177 ms 235256 KB Output is correct
3 Correct 186 ms 235128 KB Output is correct
4 Correct 211 ms 235204 KB Output is correct
5 Correct 191 ms 235256 KB Output is correct
6 Correct 200 ms 235128 KB Output is correct
7 Correct 199 ms 235256 KB Output is correct
8 Correct 206 ms 235384 KB Output is correct
9 Correct 216 ms 235256 KB Output is correct
10 Correct 199 ms 235256 KB Output is correct
11 Correct 203 ms 235240 KB Output is correct
12 Correct 220 ms 235256 KB Output is correct
13 Correct 201 ms 235260 KB Output is correct
14 Correct 195 ms 235264 KB Output is correct
15 Correct 175 ms 235212 KB Output is correct
16 Correct 251 ms 235128 KB Output is correct
17 Correct 195 ms 235116 KB Output is correct
18 Correct 197 ms 235128 KB Output is correct
19 Correct 196 ms 235124 KB Output is correct
20 Correct 197 ms 235256 KB Output is correct
21 Correct 205 ms 235228 KB Output is correct
22 Correct 193 ms 235172 KB Output is correct
23 Correct 214 ms 235172 KB Output is correct
24 Correct 178 ms 235304 KB Output is correct
25 Correct 188 ms 235256 KB Output is correct
26 Correct 194 ms 235224 KB Output is correct
27 Correct 220 ms 235264 KB Output is correct
28 Correct 196 ms 235224 KB Output is correct
29 Correct 179 ms 235448 KB Output is correct
30 Correct 192 ms 235252 KB Output is correct
31 Correct 208 ms 235280 KB Output is correct
32 Correct 206 ms 235264 KB Output is correct
33 Correct 208 ms 235204 KB Output is correct
34 Correct 195 ms 235276 KB Output is correct
35 Correct 197 ms 235260 KB Output is correct
36 Correct 207 ms 235268 KB Output is correct
37 Correct 197 ms 235296 KB Output is correct
38 Correct 225 ms 235308 KB Output is correct
39 Correct 220 ms 235332 KB Output is correct
40 Correct 215 ms 235384 KB Output is correct
41 Correct 180 ms 235388 KB Output is correct
42 Correct 189 ms 235324 KB Output is correct
43 Correct 176 ms 235256 KB Output is correct
44 Correct 206 ms 235384 KB Output is correct
45 Correct 205 ms 235256 KB Output is correct
46 Correct 202 ms 235344 KB Output is correct
47 Correct 221 ms 235524 KB Output is correct
48 Correct 184 ms 235256 KB Output is correct
49 Correct 176 ms 235256 KB Output is correct
50 Correct 179 ms 235484 KB Output is correct
51 Correct 208 ms 235424 KB Output is correct
52 Correct 186 ms 235384 KB Output is correct
53 Correct 179 ms 235256 KB Output is correct
54 Correct 182 ms 235284 KB Output is correct
55 Correct 177 ms 235256 KB Output is correct
56 Correct 184 ms 235392 KB Output is correct
57 Correct 174 ms 235384 KB Output is correct
58 Correct 187 ms 235256 KB Output is correct
59 Correct 190 ms 235416 KB Output is correct
60 Correct 201 ms 235256 KB Output is correct
61 Correct 197 ms 235256 KB Output is correct
62 Correct 221 ms 235256 KB Output is correct
63 Correct 184 ms 235384 KB Output is correct
64 Correct 184 ms 235280 KB Output is correct
65 Correct 197 ms 235384 KB Output is correct
66 Correct 211 ms 235384 KB Output is correct
67 Correct 181 ms 235388 KB Output is correct
68 Correct 179 ms 235356 KB Output is correct
69 Correct 207 ms 235356 KB Output is correct
70 Correct 180 ms 235376 KB Output is correct
71 Correct 205 ms 235384 KB Output is correct
72 Correct 190 ms 235256 KB Output is correct
73 Correct 196 ms 235256 KB Output is correct
74 Correct 216 ms 235464 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 184 ms 235184 KB Output is correct
2 Correct 177 ms 235256 KB Output is correct
3 Correct 186 ms 235128 KB Output is correct
4 Correct 211 ms 235204 KB Output is correct
5 Correct 191 ms 235256 KB Output is correct
6 Correct 200 ms 235128 KB Output is correct
7 Correct 199 ms 235256 KB Output is correct
8 Correct 206 ms 235384 KB Output is correct
9 Correct 216 ms 235256 KB Output is correct
10 Correct 199 ms 235256 KB Output is correct
11 Correct 203 ms 235240 KB Output is correct
12 Correct 220 ms 235256 KB Output is correct
13 Correct 201 ms 235260 KB Output is correct
14 Correct 195 ms 235264 KB Output is correct
15 Correct 175 ms 235212 KB Output is correct
16 Correct 251 ms 235128 KB Output is correct
17 Correct 195 ms 235116 KB Output is correct
18 Correct 197 ms 235128 KB Output is correct
19 Correct 196 ms 235124 KB Output is correct
20 Correct 197 ms 235256 KB Output is correct
21 Correct 205 ms 235228 KB Output is correct
22 Correct 193 ms 235172 KB Output is correct
23 Correct 214 ms 235172 KB Output is correct
24 Correct 178 ms 235304 KB Output is correct
25 Correct 188 ms 235256 KB Output is correct
26 Correct 194 ms 235224 KB Output is correct
27 Correct 220 ms 235264 KB Output is correct
28 Correct 196 ms 235224 KB Output is correct
29 Correct 179 ms 235448 KB Output is correct
30 Correct 192 ms 235252 KB Output is correct
31 Correct 208 ms 235280 KB Output is correct
32 Correct 206 ms 235264 KB Output is correct
33 Correct 208 ms 235204 KB Output is correct
34 Correct 195 ms 235276 KB Output is correct
35 Correct 197 ms 235260 KB Output is correct
36 Correct 207 ms 235268 KB Output is correct
37 Correct 197 ms 235296 KB Output is correct
38 Correct 225 ms 235308 KB Output is correct
39 Correct 220 ms 235332 KB Output is correct
40 Correct 215 ms 235384 KB Output is correct
41 Correct 180 ms 235388 KB Output is correct
42 Correct 189 ms 235324 KB Output is correct
43 Correct 176 ms 235256 KB Output is correct
44 Correct 206 ms 235384 KB Output is correct
45 Correct 205 ms 235256 KB Output is correct
46 Correct 202 ms 235344 KB Output is correct
47 Correct 221 ms 235524 KB Output is correct
48 Correct 184 ms 235256 KB Output is correct
49 Correct 176 ms 235256 KB Output is correct
50 Correct 179 ms 235484 KB Output is correct
51 Correct 208 ms 235424 KB Output is correct
52 Correct 186 ms 235384 KB Output is correct
53 Correct 179 ms 235256 KB Output is correct
54 Correct 182 ms 235284 KB Output is correct
55 Correct 177 ms 235256 KB Output is correct
56 Correct 184 ms 235392 KB Output is correct
57 Correct 174 ms 235384 KB Output is correct
58 Correct 187 ms 235256 KB Output is correct
59 Correct 190 ms 235416 KB Output is correct
60 Correct 201 ms 235256 KB Output is correct
61 Correct 197 ms 235256 KB Output is correct
62 Correct 221 ms 235256 KB Output is correct
63 Correct 184 ms 235384 KB Output is correct
64 Correct 184 ms 235280 KB Output is correct
65 Correct 197 ms 235384 KB Output is correct
66 Correct 211 ms 235384 KB Output is correct
67 Correct 181 ms 235388 KB Output is correct
68 Correct 179 ms 235356 KB Output is correct
69 Correct 207 ms 235356 KB Output is correct
70 Correct 180 ms 235376 KB Output is correct
71 Correct 205 ms 235384 KB Output is correct
72 Correct 190 ms 235256 KB Output is correct
73 Correct 196 ms 235256 KB Output is correct
74 Correct 216 ms 235464 KB Output is correct
75 Correct 1217 ms 246248 KB Output is correct
76 Correct 1382 ms 247396 KB Output is correct
77 Correct 1193 ms 247764 KB Output is correct
78 Correct 1106 ms 248036 KB Output is correct
79 Correct 442 ms 248044 KB Output is correct
80 Correct 602 ms 247608 KB Output is correct
81 Correct 1030 ms 247008 KB Output is correct
82 Correct 1146 ms 247396 KB Output is correct
83 Correct 1236 ms 247724 KB Output is correct
84 Correct 1190 ms 247620 KB Output is correct
85 Correct 928 ms 247140 KB Output is correct
86 Correct 649 ms 246808 KB Output is correct
87 Correct 695 ms 246612 KB Output is correct
88 Correct 1039 ms 246628 KB Output is correct
89 Correct 1107 ms 247120 KB Output is correct
90 Correct 731 ms 247652 KB Output is correct
91 Correct 601 ms 246720 KB Output is correct
92 Correct 577 ms 246580 KB Output is correct
93 Correct 681 ms 247116 KB Output is correct
94 Correct 617 ms 247728 KB Output is correct
95 Correct 750 ms 247700 KB Output is correct
96 Correct 607 ms 246708 KB Output is correct
97 Correct 607 ms 247784 KB Output is correct
98 Correct 636 ms 247496 KB Output is correct
99 Correct 553 ms 247404 KB Output is correct
100 Correct 557 ms 246856 KB Output is correct
101 Correct 517 ms 246760 KB Output is correct
102 Correct 1223 ms 246740 KB Output is correct
103 Correct 1204 ms 246784 KB Output is correct
104 Correct 1203 ms 247392 KB Output is correct
105 Correct 1027 ms 247268 KB Output is correct
106 Correct 1071 ms 247608 KB Output is correct
107 Correct 785 ms 247128 KB Output is correct
108 Correct 1218 ms 247652 KB Output is correct
109 Correct 980 ms 248476 KB Output is correct
110 Correct 519 ms 246328 KB Output is correct
111 Correct 606 ms 246500 KB Output is correct
112 Correct 1020 ms 245988 KB Output is correct
113 Correct 541 ms 248732 KB Output is correct