oj.uz

Submission #897591

# Submission time Handle Problem Language Result Execution time Memory
897591 2024-01-03T13:11:07 Z penguin133 Cake 3 (JOI19_cake3) C++17
100 / 100
 2272 ms 15116 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
//#define int long long
typedef long long ll;
#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];
multiset <int> ms, buf;
int L = 1, R = 0, x, y;
ll cur = 0, ans = -1e18;

inline void shift(const int l, const 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()){
			x = *--buf.end();
			ms.insert(x), cur += x, 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()){
			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()){
			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()){
			x = *--buf.end();
			ms.insert(x), cur += x, buf.erase(--buf.end());
		}
		R--;
	}
}

void dnc(int l, int r, int optl, int optr){
	if(l > r)return;
	int mid = (l + r) >> 1;
	ll mx = -1e18; int pos = optl;
	for(int i = optl; i <= min(optr, mid); i++){
		shift(i, mid);
		if(ms.size() < m)break;
		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(int, int)':
cake3.cpp:29:19: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |   while(ms.size() < m && !buf.empty()){
      |         ~~~~~~~~~~^~~
cake3.cpp:38:19: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   38 |   while(ms.size() < m && !buf.empty())cur += *--buf.end(), ms.insert(*--buf.end()), buf.erase(--buf.end());
      |         ~~~~~~~~~~^~~
cake3.cpp:50:19: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   50 |   while(ms.size() < m && !buf.empty())cur += *--buf.end(), ms.insert(*--buf.end()), buf.erase(--buf.end());
      |         ~~~~~~~~~~^~~
cake3.cpp:62:19: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   62 |   while(ms.size() < m && !buf.empty()){
      |         ~~~~~~~~~~^~~
cake3.cpp: In function 'void dnc(int, int, int, int)':
cake3.cpp:76:16: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   76 |   if(ms.size() < m)break;
      |      ~~~~~~~~~~^~~
cake3.cpp:77:16: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   77 |   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:93:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   93 | main(){
      | ^~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 464 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 460 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 468 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 6 ms 600 KB Output is correct
39 Correct 7 ms 604 KB Output is correct
40 Correct 5 ms 356 KB Output is correct
41 Correct 6 ms 604 KB Output is correct
42 Correct 4 ms 604 KB Output is correct
43 Correct 5 ms 348 KB Output is correct
44 Correct 6 ms 348 KB Output is correct
45 Correct 9 ms 504 KB Output is correct
46 Correct 8 ms 344 KB Output is correct
47 Correct 7 ms 344 KB Output is correct
48 Correct 6 ms 348 KB Output is correct
49 Correct 5 ms 584 KB Output is correct
50 Correct 6 ms 580 KB Output is correct
51 Correct 5 ms 348 KB Output is correct
52 Correct 5 ms 348 KB Output is correct
53 Correct 5 ms 348 KB Output is correct
54 Correct 4 ms 348 KB Output is correct
55 Correct 4 ms 700 KB Output is correct
56 Correct 3 ms 344 KB Output is correct
57 Correct 3 ms 348 KB Output is correct
58 Correct 3 ms 348 KB Output is correct
59 Correct 2 ms 348 KB Output is correct
60 Correct 3 ms 348 KB Output is correct
61 Correct 2 ms 348 KB Output is correct
62 Correct 2 ms 348 KB Output is correct
63 Correct 4 ms 604 KB Output is correct
64 Correct 2 ms 560 KB Output is correct
65 Correct 6 ms 348 KB Output is correct
66 Correct 6 ms 348 KB Output is correct
67 Correct 6 ms 580 KB Output is correct
68 Correct 6 ms 348 KB Output is correct
69 Correct 6 ms 480 KB Output is correct
70 Correct 5 ms 580 KB Output is correct
71 Correct 5 ms 348 KB Output is correct
72 Correct 3 ms 472 KB Output is correct
73 Correct 5 ms 348 KB Output is correct
74 Correct 2 ms 604 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 464 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 460 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 468 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 6 ms 600 KB Output is correct
39 Correct 7 ms 604 KB Output is correct
40 Correct 5 ms 356 KB Output is correct
41 Correct 6 ms 604 KB Output is correct
42 Correct 4 ms 604 KB Output is correct
43 Correct 5 ms 348 KB Output is correct
44 Correct 6 ms 348 KB Output is correct
45 Correct 9 ms 504 KB Output is correct
46 Correct 8 ms 344 KB Output is correct
47 Correct 7 ms 344 KB Output is correct
48 Correct 6 ms 348 KB Output is correct
49 Correct 5 ms 584 KB Output is correct
50 Correct 6 ms 580 KB Output is correct
51 Correct 5 ms 348 KB Output is correct
52 Correct 5 ms 348 KB Output is correct
53 Correct 5 ms 348 KB Output is correct
54 Correct 4 ms 348 KB Output is correct
55 Correct 4 ms 700 KB Output is correct
56 Correct 3 ms 344 KB Output is correct
57 Correct 3 ms 348 KB Output is correct
58 Correct 3 ms 348 KB Output is correct
59 Correct 2 ms 348 KB Output is correct
60 Correct 3 ms 348 KB Output is correct
61 Correct 2 ms 348 KB Output is correct
62 Correct 2 ms 348 KB Output is correct
63 Correct 4 ms 604 KB Output is correct
64 Correct 2 ms 560 KB Output is correct
65 Correct 6 ms 348 KB Output is correct
66 Correct 6 ms 348 KB Output is correct
67 Correct 6 ms 580 KB Output is correct
68 Correct 6 ms 348 KB Output is correct
69 Correct 6 ms 480 KB Output is correct
70 Correct 5 ms 580 KB Output is correct
71 Correct 5 ms 348 KB Output is correct
72 Correct 3 ms 472 KB Output is correct
73 Correct 5 ms 348 KB Output is correct
74 Correct 2 ms 604 KB Output is correct
75 Correct 2249 ms 14256 KB Output is correct
76 Correct 2272 ms 13880 KB Output is correct
77 Correct 2032 ms 14248 KB Output is correct
78 Correct 2025 ms 14736 KB Output is correct
79 Correct 384 ms 14348 KB Output is correct
80 Correct 506 ms 14140 KB Output is correct
81 Correct 1986 ms 10988 KB Output is correct
82 Correct 2111 ms 10108 KB Output is correct
83 Correct 2216 ms 11148 KB Output is correct
84 Correct 2205 ms 10908 KB Output is correct
85 Correct 1937 ms 10872 KB Output is correct
86 Correct 1032 ms 11344 KB Output is correct
87 Correct 1174 ms 10964 KB Output is correct
88 Correct 1782 ms 10604 KB Output is correct
89 Correct 1692 ms 11600 KB Output is correct
90 Correct 1241 ms 11960 KB Output is correct
91 Correct 781 ms 11860 KB Output is correct
92 Correct 860 ms 11692 KB Output is correct
93 Correct 1004 ms 11860 KB Output is correct
94 Correct 756 ms 13076 KB Output is correct
95 Correct 1151 ms 11968 KB Output is correct
96 Correct 291 ms 9880 KB Output is correct
97 Correct 314 ms 10712 KB Output is correct
98 Correct 332 ms 10404 KB Output is correct
99 Correct 295 ms 10960 KB Output is correct
100 Correct 288 ms 11212 KB Output is correct
101 Correct 274 ms 10924 KB Output is correct
102 Correct 1560 ms 9324 KB Output is correct
103 Correct 1511 ms 9560 KB Output is correct
104 Correct 1687 ms 9452 KB Output is correct
105 Correct 1463 ms 11108 KB Output is correct
106 Correct 1442 ms 11844 KB Output is correct
107 Correct 1304 ms 11452 KB Output is correct
108 Correct 1981 ms 14352 KB Output is correct
109 Correct 1620 ms 15060 KB Output is correct
110 Correct 792 ms 10796 KB Output is correct
111 Correct 1052 ms 8676 KB Output is correct
112 Correct 526 ms 12428 KB Output is correct
113 Correct 406 ms 15116 KB Output is correct