oj.uz

Submission #514597

# Submission time Handle Problem Language Result Execution time Memory
514597 2022-01-18T09:51:57 Z fatemetmhr Cake 3 (JOI19_cake3) C++17
100 / 100
 3780 ms 17404 KB 
//  ~Be name khoda~  //

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

#define pb       push_back
#define mp       make_pair
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second
#define cl       clear
#define endll    '\n'

const int maxn  =  1e6   + 10;
const int maxn5 =  2e5   + 10;
const int maxnt =  1.2e6 + 10;
const int maxn3 =  1e3   + 10;
const int mod   =  1e9   +  7;
const ll  inf   =  2e18;

int n, m, curl, curr;
int v[maxn5], c[maxn5];
int per[maxn5], tc[maxn5];
int tv[maxn5];
ll cost = 0, out;
//vector <int> av;

multiset <int> mx, mn;

inline bool cmp(int i, int j){return c[i] < c[j];}

inline void add(int id){
	//cout << "adding " << id << endl;
	//cout << "______________ " << (*mx.begin()) << endl;
	if(mx.size() < m - 2){
		mx.insert(v[id]);
		cost += v[id];
		//cout << "to mx" << endl;
		return;
	}
	if((*mx.begin()) < v[id]){
		mn.insert((*mx.begin()) * -1);
		//cout << "por " << (*mx.begin()) << endl;
		cost -= (*mx.begin());
		mx.erase(mx.begin());
		mx.insert(v[id]);
		cost += v[id];
		//cout << "to mx with erasing!" << endl;
		return;
	}
	mn.insert(-v[id]);
	//cout << "to mn " << id << endl;
	return;
}

inline void remo(int id){
	//cout << "removing " << id << endl;

	if((*mx.begin()) <= v[id]){
		//cout << "form mx << endl" << endl;
			//cout << "noo " << v[id] << ' ' << id << ' ' << curl << ' ' << curr << endl;
		mx.erase(mx.find(v[id]));
		cost -= v[id];
		if(!mn.empty()){
			mx.insert((*mn.begin()) * -1);
			cost -= (*mn.begin());
			//cout << "wow " << (*mn.begin()) << endl;
			mn.erase(mn.begin());
		}
	}
	else{
		//cout << "from mn " << endl;
			//cout << "em no " << ' ' << curl << ' ' << curr << ' ' << id << endl;
		//cout << "so right " << id << endl;
		mn.erase(mn.find(-v[id]));
	}
	return;
}

inline void calc(int l, int r){
	/*
	av.clear();
	for(int i = l; i <= r; i++)
		av.pb(v[i]);
	sort(all(av));
	cost = av.back() + av[av.size() - 2];
	return;
	*/

	while(curr < r){
		curr++;
		add(curr);
	}
	while(curl > l){
		curl--;
		add(curl);
	}
	while(curr > r){
		remo(curr);
		curr--;
	}
	while(curl < l){
		remo(curl);
		curl++;
	}
	return;
}

inline void solve(int l, int r, int opl, int opr){
	if(l >= r)
		return;
	int mid = (l + r) >> 1;
	int opt = -1;
	ll ans = -1 * inf;
	//cout << l << ' ' << r << ' ' << opl << ' ' << opr << endl;
	for(int i = opl; i < min(mid - m + 2, opr); i++){
		calc(i + 1, mid - 1);
		//cout << i << ' ' << mid << ' ' << cost << endl;
		ll val = 2 * c[i] + cost - 2 * c[mid] + v[i] + v[mid];
		if(ans <= val){
			ans = val;
			opt = i;
		}
	}
	out = max(out, ans);
	if(r - l == 1)
		return;
	solve(l, mid, opl, opt + 1);
	solve(mid + 1, r, opt, opr);
	return;
}

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	
	cin >> n >> m;
	for(int i = 0; i < n; i++){
		cin >> v[i] >> c[i];
		per[i] = i;
	}
	sort(per, per + n, cmp);
	for(int i = 0; i < n; i++){
		tv[i] = v[per[i]];
		tc[i] = c[per[i]];
	}
	for(int i = 0; i < n;i ++){
		v[i] = tv[i];
		c[i] = tc[i];
	}
	out = -1 * inf;
	curl = m - 1;
	curr = m - 1;
	mx.insert(v[m - 1]);
	cost = v[m - 1];
	solve(m - 1, n, 0, n);
	cout << out << endl;
}

Compilation message

cake3.cpp: In function 'void add(int)':
cake3.cpp:38:15: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   38 |  if(mx.size() < m - 2){
      |     ~~~~~~~~~~^~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 316 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 324 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 320 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 316 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 6 ms 456 KB Output is correct
39 Correct 7 ms 508 KB Output is correct
40 Correct 5 ms 460 KB Output is correct
41 Correct 5 ms 460 KB Output is correct
42 Correct 4 ms 460 KB Output is correct
43 Correct 4 ms 460 KB Output is correct
44 Correct 6 ms 460 KB Output is correct
45 Correct 9 ms 372 KB Output is correct
46 Correct 7 ms 460 KB Output is correct
47 Correct 7 ms 468 KB Output is correct
48 Correct 7 ms 460 KB Output is correct
49 Correct 7 ms 460 KB Output is correct
50 Correct 8 ms 460 KB Output is correct
51 Correct 5 ms 460 KB Output is correct
52 Correct 5 ms 460 KB Output is correct
53 Correct 5 ms 376 KB Output is correct
54 Correct 3 ms 460 KB Output is correct
55 Correct 3 ms 460 KB Output is correct
56 Correct 3 ms 460 KB Output is correct
57 Correct 4 ms 460 KB Output is correct
58 Correct 3 ms 460 KB Output is correct
59 Correct 5 ms 456 KB Output is correct
60 Correct 5 ms 376 KB Output is correct
61 Correct 3 ms 460 KB Output is correct
62 Correct 3 ms 460 KB Output is correct
63 Correct 4 ms 460 KB Output is correct
64 Correct 3 ms 460 KB Output is correct
65 Correct 8 ms 460 KB Output is correct
66 Correct 8 ms 460 KB Output is correct
67 Correct 6 ms 460 KB Output is correct
68 Correct 6 ms 460 KB Output is correct
69 Correct 7 ms 472 KB Output is correct
70 Correct 7 ms 460 KB Output is correct
71 Correct 7 ms 448 KB Output is correct
72 Correct 4 ms 460 KB Output is correct
73 Correct 6 ms 460 KB Output is correct
74 Correct 2 ms 460 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 316 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 324 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 320 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 316 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 6 ms 456 KB Output is correct
39 Correct 7 ms 508 KB Output is correct
40 Correct 5 ms 460 KB Output is correct
41 Correct 5 ms 460 KB Output is correct
42 Correct 4 ms 460 KB Output is correct
43 Correct 4 ms 460 KB Output is correct
44 Correct 6 ms 460 KB Output is correct
45 Correct 9 ms 372 KB Output is correct
46 Correct 7 ms 460 KB Output is correct
47 Correct 7 ms 468 KB Output is correct
48 Correct 7 ms 460 KB Output is correct
49 Correct 7 ms 460 KB Output is correct
50 Correct 8 ms 460 KB Output is correct
51 Correct 5 ms 460 KB Output is correct
52 Correct 5 ms 460 KB Output is correct
53 Correct 5 ms 376 KB Output is correct
54 Correct 3 ms 460 KB Output is correct
55 Correct 3 ms 460 KB Output is correct
56 Correct 3 ms 460 KB Output is correct
57 Correct 4 ms 460 KB Output is correct
58 Correct 3 ms 460 KB Output is correct
59 Correct 5 ms 456 KB Output is correct
60 Correct 5 ms 376 KB Output is correct
61 Correct 3 ms 460 KB Output is correct
62 Correct 3 ms 460 KB Output is correct
63 Correct 4 ms 460 KB Output is correct
64 Correct 3 ms 460 KB Output is correct
65 Correct 8 ms 460 KB Output is correct
66 Correct 8 ms 460 KB Output is correct
67 Correct 6 ms 460 KB Output is correct
68 Correct 6 ms 460 KB Output is correct
69 Correct 7 ms 472 KB Output is correct
70 Correct 7 ms 460 KB Output is correct
71 Correct 7 ms 448 KB Output is correct
72 Correct 4 ms 460 KB Output is correct
73 Correct 6 ms 460 KB Output is correct
74 Correct 2 ms 460 KB Output is correct
75 Correct 3289 ms 16288 KB Output is correct
76 Correct 3780 ms 15884 KB Output is correct
77 Correct 3099 ms 16336 KB Output is correct
78 Correct 3312 ms 16592 KB Output is correct
79 Correct 145 ms 16568 KB Output is correct
80 Correct 446 ms 16196 KB Output is correct
81 Correct 2973 ms 12992 KB Output is correct
82 Correct 3058 ms 12464 KB Output is correct
83 Correct 2846 ms 13276 KB Output is correct
84 Correct 3574 ms 13112 KB Output is correct
85 Correct 3154 ms 13040 KB Output is correct
86 Correct 1354 ms 13476 KB Output is correct
87 Correct 1636 ms 13160 KB Output is correct
88 Correct 2269 ms 12560 KB Output is correct
89 Correct 2407 ms 13496 KB Output is correct
90 Correct 1498 ms 14576 KB Output is correct
91 Correct 869 ms 14092 KB Output is correct
92 Correct 973 ms 13900 KB Output is correct
93 Correct 1145 ms 14256 KB Output is correct
94 Correct 696 ms 15516 KB Output is correct
95 Correct 1225 ms 14664 KB Output is correct
96 Correct 489 ms 12548 KB Output is correct
97 Correct 520 ms 13552 KB Output is correct
98 Correct 545 ms 13188 KB Output is correct
99 Correct 519 ms 13564 KB Output is correct
100 Correct 402 ms 13244 KB Output is correct
101 Correct 420 ms 13132 KB Output is correct
102 Correct 1889 ms 12160 KB Output is correct
103 Correct 1625 ms 12164 KB Output is correct
104 Correct 2017 ms 12416 KB Output is correct
105 Correct 1604 ms 13428 KB Output is correct
106 Correct 1640 ms 13832 KB Output is correct
107 Correct 1495 ms 13640 KB Output is correct
108 Correct 2295 ms 16388 KB Output is correct
109 Correct 1901 ms 17396 KB Output is correct
110 Correct 876 ms 12800 KB Output is correct
111 Correct 1290 ms 11828 KB Output is correct
112 Correct 2850 ms 14420 KB Output is correct
113 Correct 138 ms 17404 KB Output is correct