oj.uz

Submission #897593

# Submission time Handle Problem Language Result Execution time Memory
897593 2024-01-03T13:13:55 Z penguin133 Cake 3 (JOI19_cake3) C++17
100 / 100
 2770 ms 14516 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, m;
pi A[200005];
int dp[200005];
multiset <int> ms, buf;
int L = 1, R = 0, cur = 0, ans = -1e18;

void shift(int l, int r){
	while(L < l){
		if(buf.find(A[L].se) != buf.end())buf.erase(buf.find(A[L].se));
		else ms.erase(ms.find(A[L].se)), cur -= A[L].se;
		while(ms.size() < m && !buf.empty())ms.insert(*--buf.end()), cur += *--buf.end(), buf.erase(--buf.end());
		L++;
	}
	while(L > l){
		L--;
		buf.insert(A[L].se);
		while(ms.size() < m && !buf.empty())cur += *--buf.end(), ms.insert(*--buf.end()), buf.erase(--buf.end());
		while(!ms.empty() && !buf.empty() && *ms.begin() < *--buf.end()){
			int x = *ms.begin(), y = *--buf.end();
			ms.erase(ms.begin());
			buf.erase(--buf.end());
			ms.insert(y); buf.insert(x);
			cur += y - x;
		}
	}
	while(R < r){
		R++;
		buf.insert(A[R].se);
		while(ms.size() < m && !buf.empty())cur += *--buf.end(), ms.insert(*--buf.end()), buf.erase(--buf.end());
		while(!ms.empty() && !buf.empty() && *ms.begin() < *--buf.end()){
			int x = *ms.begin(), y = *--buf.end();
			ms.erase(ms.begin());
			buf.erase(--buf.end());
			ms.insert(y); buf.insert(x);
			cur += y - x;
		}
	}
	while(R > r){
		if(buf.find(A[R].se) != buf.end())buf.erase(buf.find(A[R].se));
		else ms.erase(ms.find(A[R].se)), cur -= A[R].se;
		while(ms.size() < m && !buf.empty())cur += *--buf.end(), ms.insert(*--buf.end()), buf.erase(--buf.end());
		R--;
	}
}

void dnc(int l, int r, int optl, int optr){
	if(l > r)return;
	int mid = (l + r) >> 1;
	int mx = -1e18, pos = optl;
	for(int i = optl; i <= min(optr, mid); i++){
		shift(i, mid);
		if(ms.size() == m && mx < cur - 2 * (A[mid].fi - A[i].fi))mx = cur - 2 * (A[mid].fi - A[i].fi), pos = i;
	}
	//cout << mid << ' ' << mx << ' ' << pos << '\n';
	ans = max(ans, mx);
	dnc(l, mid - 1, optl, pos);
	dnc(mid + 1, r, pos, optr);
}

void solve(){
	cin >> n >> m;
	for(int i=1;i<=n;i++)cin >> A[i].se >> A[i].fi;
	sort(A+1, A+n+1);
	dnc(1, n, 1, n);
	cout << ans;
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

cake3.cpp: In function 'void shift(long long int, long long int)':
cake3.cpp:24:19: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   24 |   while(ms.size() < m && !buf.empty())ms.insert(*--buf.end()), cur += *--buf.end(), buf.erase(--buf.end());
      |         ~~~~~~~~~~^~~
cake3.cpp:30:19: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   30 |   while(ms.size() < m && !buf.empty())cur += *--buf.end(), ms.insert(*--buf.end()), buf.erase(--buf.end());
      |         ~~~~~~~~~~^~~
cake3.cpp:42:19: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   42 |   while(ms.size() < m && !buf.empty())cur += *--buf.end(), ms.insert(*--buf.end()), buf.erase(--buf.end());
      |         ~~~~~~~~~~^~~
cake3.cpp:54:19: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   54 |   while(ms.size() < m && !buf.empty())cur += *--buf.end(), ms.insert(*--buf.end()), buf.erase(--buf.end());
      |         ~~~~~~~~~~^~~
cake3.cpp: In function 'void dnc(long long int, long long int, long long int, long long int)':
cake3.cpp:65:16: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   65 |   if(ms.size() == m && mx < cur - 2 * (A[mid].fi - A[i].fi))mx = cur - 2 * (A[mid].fi - A[i].fi), pos = i;
      |      ~~~~~~~~~~^~~~
cake3.cpp: At global scope:
cake3.cpp:81:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   81 | main(){
      | ^~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2392 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2408 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 7 ms 2396 KB Output is correct
39 Correct 7 ms 2572 KB Output is correct
40 Correct 7 ms 2396 KB Output is correct
41 Correct 7 ms 2520 KB Output is correct
42 Correct 6 ms 2392 KB Output is correct
43 Correct 6 ms 2396 KB Output is correct
44 Correct 7 ms 2396 KB Output is correct
45 Correct 7 ms 2396 KB Output is correct
46 Correct 8 ms 2580 KB Output is correct
47 Correct 8 ms 2396 KB Output is correct
48 Correct 7 ms 2392 KB Output is correct
49 Correct 7 ms 2392 KB Output is correct
50 Correct 7 ms 2392 KB Output is correct
51 Correct 7 ms 2596 KB Output is correct
52 Correct 6 ms 2648 KB Output is correct
53 Correct 7 ms 2516 KB Output is correct
54 Correct 6 ms 2520 KB Output is correct
55 Correct 6 ms 2396 KB Output is correct
56 Correct 6 ms 2396 KB Output is correct
57 Correct 6 ms 2396 KB Output is correct
58 Correct 6 ms 2596 KB Output is correct
59 Correct 3 ms 2396 KB Output is correct
60 Correct 4 ms 2396 KB Output is correct
61 Correct 3 ms 2396 KB Output is correct
62 Correct 3 ms 2548 KB Output is correct
63 Correct 4 ms 2608 KB Output is correct
64 Correct 4 ms 2396 KB Output is correct
65 Correct 7 ms 2396 KB Output is correct
66 Correct 7 ms 2396 KB Output is correct
67 Correct 7 ms 2396 KB Output is correct
68 Correct 7 ms 2648 KB Output is correct
69 Correct 7 ms 2648 KB Output is correct
70 Correct 8 ms 2396 KB Output is correct
71 Correct 6 ms 2396 KB Output is correct
72 Correct 6 ms 2588 KB Output is correct
73 Correct 4 ms 2396 KB Output is correct
74 Correct 5 ms 2616 KB Output is correct
75 Correct 2770 ms 13500 KB Output is correct
76 Correct 2500 ms 13428 KB Output is correct
77 Correct 2531 ms 13528 KB Output is correct
78 Correct 2686 ms 13788 KB Output is correct
79 Correct 1725 ms 13744 KB Output is correct
80 Correct 1878 ms 13264 KB Output is correct
81 Correct 2408 ms 10924 KB Output is correct
82 Correct 2382 ms 10076 KB Output is correct
83 Correct 2624 ms 10936 KB Output is correct
84 Correct 2600 ms 10844 KB Output is correct
85 Correct 2422 ms 10836 KB Output is correct
86 Correct 2120 ms 11420 KB Output is correct
87 Correct 2078 ms 11056 KB Output is correct
88 Correct 2217 ms 10596 KB Output is correct
89 Correct 2396 ms 11440 KB Output is correct
90 Correct 2232 ms 11944 KB Output is correct
91 Correct 2130 ms 12104 KB Output is correct
92 Correct 2099 ms 12024 KB Output is correct
93 Correct 2083 ms 11880 KB Output is correct
94 Correct 2326 ms 13144 KB Output is correct
95 Correct 2252 ms 11964 KB Output is correct
96 Correct 538 ms 10192 KB Output is correct
97 Correct 574 ms 10836 KB Output is correct
98 Correct 541 ms 10324 KB Output is correct
99 Correct 566 ms 11092 KB Output is correct
100 Correct 583 ms 11292 KB Output is correct
101 Correct 554 ms 11116 KB Output is correct
102 Correct 1822 ms 9444 KB Output is correct
103 Correct 1827 ms 9704 KB Output is correct
104 Correct 1849 ms 9404 KB Output is correct
105 Correct 1862 ms 11424 KB Output is correct
106 Correct 2003 ms 11896 KB Output is correct
107 Correct 1775 ms 11544 KB Output is correct
108 Correct 2547 ms 13668 KB Output is correct
109 Correct 2591 ms 14516 KB Output is correct
110 Correct 1578 ms 11352 KB Output is correct
111 Correct 1636 ms 9336 KB Output is correct
112 Correct 761 ms 13128 KB Output is correct
113 Correct 1777 ms 14352 KB Output is correct