oj.uz

Submission #362678

# Submission time Handle Problem Language Result Execution time Memory
362678 2021-02-04T04:45:34 Z hoaphat1 Cake 3 (JOI19_cake3) C++17
100 / 100
 1499 ms 38500 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
int main() {
	#define qwer "test"
	if (fopen(qwer".inp","r")) freopen(qwer".inp","r",stdin),freopen(qwer".out","w",stdout);
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<pair<int, int>> a(n);
  for (int i = 0; i < n; i++) cin >> a[i].second >> a[i].first;
  sort(a.begin(), a.end());
  /*
  	k1 k2 ... km -> v - 2 * (c km - c k1)
  	i >= i-1
  */
  long long ans = -1e18;
  long long now = 0;
  int L = 0, R = -1;
  vector<int> kt(n, 0);
  priority_queue<pair<int, int>, vector<pair<int,int>> , greater<pair<int, int>>> pq;
  priority_queue<pair<int, int>> smaller;
  int sz = 0;
  auto add = [&](int id) {
  	int v = a[id].second;
  	pq.emplace(v, id);
  	now += v;
  	kt[id] = 1;
  	++sz;
  	while (sz > m - 2) {
  		auto x = pq.top();
  		pq.pop();
  		if (kt[x.second] != 1) continue;
  		kt[x.second] = 2;
  		now -= x.first;
  		smaller.push(x);
  		--sz;
		}
	};
	auto del = [&](int id) {
		int v = a[id].second;
		if (kt[id] == 2) {
			kt[id] = 0;
			return ;
		}
		kt[id] = 0;
		now -= v;
		sz--;
		while (sz < m - 2 && !smaller.empty()) {
			auto x = smaller.top(); smaller.pop();
			if (kt[x.second] != 2) continue;
			kt[x.second] = 1;
			now += x.first;
			pq.push(x);
			++sz;
		}
	};
  auto moveL = [&](int l) {
  	while (L < l) del(L++);
  	while (L > l) add(--L);
	};
	auto moveR = [&](int r) {
		while (R < r) add(++R);
		while (R > r) del(R--);
	};
  function<void(int, int, int, int)> solve = [&](int l, int r, int L, int R) {
  	if (l > r) return ;
  	int mid = l + r >> 1;
  	int pos = -1;
  	moveR(mid - 1);
  	long long val = 0;
  	for (int i = min(mid-1, R); i >= L; i--) {
  		moveL(i + 1);
  	///	cout << i + 1 <<" " << mid - 1 <<" " << now << endl;
  		if (sz == m - 2) {
  			if (val < now + a[i].second + 2 * a[i].first) {
  				val = now + a[i].second + 2 * a[i].first;
  				pos = i;
				}
			}
		}
		ans = max(ans, val + a[mid].second - 2 * a[mid].first);
		solve(mid + 1, r, pos, R);
		solve(l, mid - 1, L, pos);
	};
  solve(m-1, n-1, 0, n-1);
  cout << ans;
}

Compilation message

cake3.cpp: In lambda function:
cake3.cpp:70:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   70 |    int mid = l + r >> 1;
      |              ~~^~~
cake3.cpp: In function 'int main()':
cake3.cpp:7:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
    7 |  if (fopen(qwer".inp","r")) freopen(qwer".inp","r",stdin),freopen(qwer".out","w",stdout);
      |                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
cake3.cpp:7:66: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
    7 |  if (fopen(qwer".inp","r")) freopen(qwer".inp","r",stdin),freopen(qwer".out","w",stdout);
      |                                                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 376 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 376 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 7 ms 492 KB Output is correct
39 Correct 7 ms 664 KB Output is correct
40 Correct 5 ms 640 KB Output is correct
41 Correct 6 ms 640 KB Output is correct
42 Correct 4 ms 620 KB Output is correct
43 Correct 5 ms 620 KB Output is correct
44 Correct 6 ms 620 KB Output is correct
45 Correct 7 ms 620 KB Output is correct
46 Correct 7 ms 620 KB Output is correct
47 Correct 7 ms 620 KB Output is correct
48 Correct 7 ms 620 KB Output is correct
49 Correct 6 ms 748 KB Output is correct
50 Correct 6 ms 748 KB Output is correct
51 Correct 6 ms 768 KB Output is correct
52 Correct 5 ms 620 KB Output is correct
53 Correct 5 ms 620 KB Output is correct
54 Correct 4 ms 748 KB Output is correct
55 Correct 3 ms 748 KB Output is correct
56 Correct 3 ms 748 KB Output is correct
57 Correct 4 ms 748 KB Output is correct
58 Correct 4 ms 748 KB Output is correct
59 Correct 4 ms 620 KB Output is correct
60 Correct 7 ms 620 KB Output is correct
61 Correct 4 ms 620 KB Output is correct
62 Correct 3 ms 620 KB Output is correct
63 Correct 4 ms 620 KB Output is correct
64 Correct 4 ms 620 KB Output is correct
65 Correct 6 ms 620 KB Output is correct
66 Correct 6 ms 620 KB Output is correct
67 Correct 7 ms 620 KB Output is correct
68 Correct 6 ms 620 KB Output is correct
69 Correct 6 ms 620 KB Output is correct
70 Correct 6 ms 748 KB Output is correct
71 Correct 7 ms 620 KB Output is correct
72 Correct 4 ms 748 KB Output is correct
73 Correct 4 ms 620 KB Output is correct
74 Correct 1 ms 492 KB Output is correct
75 Correct 1240 ms 20400 KB Output is correct
76 Correct 1341 ms 14248 KB Output is correct
77 Correct 1147 ms 22188 KB Output is correct
78 Correct 1193 ms 22224 KB Output is correct
79 Correct 180 ms 20432 KB Output is correct
80 Correct 374 ms 36924 KB Output is correct
81 Correct 1225 ms 38332 KB Output is correct
82 Correct 1437 ms 21620 KB Output is correct
83 Correct 1402 ms 37784 KB Output is correct
84 Correct 1439 ms 38088 KB Output is correct
85 Correct 1258 ms 38488 KB Output is correct
86 Correct 815 ms 37564 KB Output is correct
87 Correct 857 ms 37692 KB Output is correct
88 Correct 1137 ms 38332 KB Output is correct
89 Correct 1174 ms 38332 KB Output is correct
90 Correct 867 ms 37872 KB Output is correct
91 Correct 577 ms 37436 KB Output is correct
92 Correct 607 ms 37612 KB Output is correct
93 Correct 715 ms 37716 KB Output is correct
94 Correct 522 ms 37308 KB Output is correct
95 Correct 846 ms 37820 KB Output is correct
96 Correct 546 ms 21968 KB Output is correct
97 Correct 583 ms 22096 KB Output is correct
98 Correct 593 ms 21200 KB Output is correct
99 Correct 544 ms 22096 KB Output is correct
100 Correct 482 ms 38352 KB Output is correct
101 Correct 498 ms 21848 KB Output is correct
102 Correct 1300 ms 21544 KB Output is correct
103 Correct 1185 ms 21736 KB Output is correct
104 Correct 1499 ms 22480 KB Output is correct
105 Correct 1055 ms 38460 KB Output is correct
106 Correct 1038 ms 38460 KB Output is correct
107 Correct 943 ms 38460 KB Output is correct
108 Correct 1155 ms 22380 KB Output is correct
109 Correct 962 ms 38500 KB Output is correct
110 Correct 692 ms 38372 KB Output is correct
111 Correct 1008 ms 37804 KB Output is correct
112 Correct 517 ms 21076 KB Output is correct
113 Correct 87 ms 8164 KB Output is correct