oj.uz

Submission #768377

# Submission time Handle Problem Language Result Execution time Memory
768377 2023-06-28T02:56:45 Z minhcool Cake 3 (JOI19_cake3) C++17
100 / 100
 1221 ms 21952 KB 
#define local
#ifndef local
#include ""
#endif
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 3e5 + 5;

const int oo = 1e18 + 7, mod = 1e9 + 7;

mt19937 rng(1);

int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	return abs(temp) + l;
}

int n, m;
ii arr[N];
int v[N], c[N];

int answer = -oo;

vector<int> diff;
int pos[N];

bool cmp(ii a, ii b){
	return a.se < b.se;
}

int lstl, lstr;

int sum[N << 2], num[N << 2];

int IT[N << 2];

void upd(int id, int l, int r, int pos, int val){
	if(l == r){
		sum[id] += diff[l] * val;
		num[id] += val;
		return;
	}
	int mid = (l + r) >> 1;
	if(pos <= mid) upd(id << 1, l, mid, pos, val);
	else upd(id << 1 | 1, mid + 1, r, pos, val);
	sum[id] = sum[id << 1] + sum[id << 1 | 1];
	num[id] = num[id << 1] + num[id << 1 | 1];
}

int tol(int id, int l, int r, int rem){
	if(l == r){
		if(rem > num[id]) return -oo;
		return rem * diff[l];
	}
	int mid = (l + r) >> 1;
	if(num[id << 1] >= rem) return tol(id << 1, l, mid, rem);
	else return sum[id << 1] + tol(id << 1 | 1, mid + 1, r, rem - num[id << 1]);
}

void mov(int le, int ri){
	while(lstl > le){
		lstl--;
		upd(1, 1, diff.size() - 1, pos[lstl], 1);
	}
	while(lstr < ri){
		lstr++;
		upd(1, 1, diff.size() - 1, pos[lstr], 1);
	}
	while(lstl < le){
		upd(1, 1, diff.size() - 1, pos[lstl], -1);
		lstl++;
	}
	while(lstr > ri){
		upd(1, 1, diff.size() - 1, pos[lstr], -1);
		lstr--;
	}
}

int get(){
	return tol(1, 1, diff.size() - 1, m - 2);
}

void dncdp(int l, int r, int optl, int optr){
	if(l > r) return;
	int temp1 = lstl, temp2 = lstr;
	if(optl == optr){
		for(int i = l; i <= r; i++){
			mov(optl + 1, i - 1);
		//	cout << optl << " " << i << "\n";
			answer = max(answer, get() + v[optl] + 2 * c[optl] + v[i] - 2 * c[i]);	
		}
		return;
	}
	int mid = (l + r) >> 1;
	ii maxi = {-oo, -oo};
	for(int i = optl; (i <= optr) && ((i + 2) <= mid); i++){
		mov(i + 1, mid - 1);
		maxi = max(maxi, {get() + v[i] + 2 * c[i] + v[mid] - 2 * c[mid], i});
	}
	//cout << maxi.se << " " << mid << "\n";
	answer = max(answer, maxi.fi);
	dncdp(l, mid - 1, optl, maxi.se);
	dncdp(mid + 1, r, maxi.se, optr);
	mov(temp1, temp2);
}

#ifdef local
void process(){
	cin >> n >> m;
	for(int i = 1; i <= n; i++) cin >> arr[i].fi >> arr[i].se;
	sort(arr + 1, arr + n + 1, cmp);
	for(int i = 1; i <= n; i++){
		v[i] = arr[i].fi;
		c[i] = arr[i].se;
	}
	diff.pb(oo);
	for(int i = 1; i <= n; i++) diff.pb(arr[i].fi);
	sort(diff.begin(), diff.end());
	diff.resize(unique(diff.begin(), diff.end()) - diff.begin());
	reverse(diff.begin(), diff.end());
	for(int i = 1; i <= n; i++){
		int le = 1, ri = diff.size() - 1;
		while(le < ri){
			int mid = (le + ri) >> 1;
			if(diff[mid] > v[i]) le = mid + 1;
			else ri = mid;
		}	
		pos[i] = le;
	}
	lstl = 1, lstr = 0;
	dncdp(m, n, 1, n - m + 1);
	cout << answer;
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	process();
}
#endif

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 5 ms 480 KB Output is correct
39 Correct 5 ms 604 KB Output is correct
40 Correct 4 ms 728 KB Output is correct
41 Correct 4 ms 596 KB Output is correct
42 Correct 3 ms 484 KB Output is correct
43 Correct 3 ms 468 KB Output is correct
44 Correct 5 ms 468 KB Output is correct
45 Correct 5 ms 596 KB Output is correct
46 Correct 6 ms 596 KB Output is correct
47 Correct 6 ms 596 KB Output is correct
48 Correct 5 ms 484 KB Output is correct
49 Correct 4 ms 524 KB Output is correct
50 Correct 5 ms 484 KB Output is correct
51 Correct 4 ms 520 KB Output is correct
52 Correct 4 ms 468 KB Output is correct
53 Correct 4 ms 484 KB Output is correct
54 Correct 3 ms 596 KB Output is correct
55 Correct 3 ms 468 KB Output is correct
56 Correct 3 ms 476 KB Output is correct
57 Correct 3 ms 468 KB Output is correct
58 Correct 3 ms 520 KB Output is correct
59 Correct 1 ms 512 KB Output is correct
60 Correct 1 ms 524 KB Output is correct
61 Correct 1 ms 468 KB Output is correct
62 Correct 1 ms 468 KB Output is correct
63 Correct 1 ms 468 KB Output is correct
64 Correct 1 ms 480 KB Output is correct
65 Correct 4 ms 596 KB Output is correct
66 Correct 4 ms 468 KB Output is correct
67 Correct 5 ms 468 KB Output is correct
68 Correct 4 ms 596 KB Output is correct
69 Correct 4 ms 488 KB Output is correct
70 Correct 4 ms 468 KB Output is correct
71 Correct 2 ms 468 KB Output is correct
72 Correct 2 ms 468 KB Output is correct
73 Correct 5 ms 480 KB Output is correct
74 Correct 1 ms 480 KB Output is correct
75 Correct 927 ms 21060 KB Output is correct
76 Correct 1188 ms 20928 KB Output is correct
77 Correct 876 ms 21092 KB Output is correct
78 Correct 967 ms 21184 KB Output is correct
79 Correct 145 ms 21312 KB Output is correct
80 Correct 228 ms 20872 KB Output is correct
81 Correct 898 ms 13184 KB Output is correct
82 Correct 1221 ms 14408 KB Output is correct
83 Correct 1075 ms 13764 KB Output is correct
84 Correct 1138 ms 14764 KB Output is correct
85 Correct 925 ms 13248 KB Output is correct
86 Correct 592 ms 12868 KB Output is correct
87 Correct 639 ms 12732 KB Output is correct
88 Correct 804 ms 12612 KB Output is correct
89 Correct 764 ms 13248 KB Output is correct
90 Correct 635 ms 13812 KB Output is correct
91 Correct 408 ms 12340 KB Output is correct
92 Correct 434 ms 12304 KB Output is correct
93 Correct 508 ms 12772 KB Output is correct
94 Correct 344 ms 13252 KB Output is correct
95 Correct 605 ms 13820 KB Output is correct
96 Correct 76 ms 11844 KB Output is correct
97 Correct 81 ms 12784 KB Output is correct
98 Correct 82 ms 12512 KB Output is correct
99 Correct 77 ms 12628 KB Output is correct
100 Correct 69 ms 11852 KB Output is correct
101 Correct 70 ms 11900 KB Output is correct
102 Correct 576 ms 11980 KB Output is correct
103 Correct 534 ms 11844 KB Output is correct
104 Correct 657 ms 12688 KB Output is correct
105 Correct 456 ms 12608 KB Output is correct
106 Correct 455 ms 12872 KB Output is correct
107 Correct 381 ms 12384 KB Output is correct
108 Correct 773 ms 20928 KB Output is correct
109 Correct 690 ms 21716 KB Output is correct
110 Correct 206 ms 11460 KB Output is correct
111 Correct 280 ms 11524 KB Output is correct
112 Correct 1008 ms 19268 KB Output is correct
113 Correct 124 ms 21952 KB Output is correct