oj.uz

Submission #411477

# Submission time Handle Problem Language Result Execution time Memory
411477 2021-05-25T11:40:17 Z amoo_safar Cake 3 (JOI19_cake3) C++17
100 / 100
 711 ms 16624 KB 
// vaziat meshki-ghermeze !
#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'

using namespace std;

typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;

const ll Mod = 1000000007LL;
const int N = 2e5 + 10;
const ll Inf = 2242545357980376863LL;
const ll Log = 30;

vector<pll> A, V;
ll ans = -Inf;
int ridx[N];
int n, m;

struct Fenwick {
	ll fen[N];
	Fenwick (){
		memset(fen, 0, sizeof fen);
	}
	void Add(int idx, ll x){
		// cerr << "^^ " << idx << ' ' << x << '\n';
		idx += 2;
		for(; idx < N; idx += (idx & (-idx)))
			fen[idx] += x;
	}
	ll Get(int idx){
		idx += 2;
		ll res = 0;
		for(; idx; idx -= (idx & (-idx)))
			res += fen[idx];
		return res;
	}
	ll GetK(int k){
		int nw = 0;
		for(int i = Log - 1; i >= 0; i--){
			int st = (1 << i);
			if(nw + st >= N) continue;
			if(fen[nw + st] <= k){
				nw += st;
				k -= fen[nw];
			}
		}
		return nw - 2;
	}
};
Fenwick On, Sum;

void Add(int id, int del){
	// cerr << "# " << id << ' ' << del << '\n';
	int pos = ridx[id];
	On.Add(pos, del);
	Sum.Add(pos, A[id].S * del);
}
int L = 1, R = 0; // []
ll Get(int lq, int rq){
	if(rq - lq + 1 < m) return -Inf;

	while(R < rq) Add(++R, 1);
	while(L > lq) Add(--L, 1);

	while(R > rq) Add(R--, -1);
	while(L < lq) Add(L++, -1);

	// cerr << '\n';
	// debug(On.GetK(m));
	// for(int i = 0; i < 7; i++) cerr << On.Get(i) - On.Get(i - 1) << ' ';
	// cerr << '\n';
	return Sum.Get(On.GetK(m)) - 2ll * (A[rq].F - A[lq].F);
}

void Solve(int l, int r, int lo, int ro){
	if(r - l < 1) return ;
	ll mx = -Inf, opt = lo;
	int mid = (l + r) >> 1;
	ll res;
	for(int i = lo; i <= ro; i++){
		if(i > mid) break;
		res = Get(i, mid);
		if(res > mx){
			mx = res;
			opt = i;
		}
	}
	ans = max(ans, mx);

	Solve(l, mid, lo, opt + 1);
	Solve(mid + 1, r, opt, ro);
}
// naive
int OPT[N];
void NAIVE(){
	for(int i = 0; i < n; i++){
		ll res;
		ll mx = -Inf;
		for(int j = 0; j < n; j++){
			if(j > i) break;
			res = Get(j, i);
			if(res > mx){
				mx = res;
				OPT[i] = j;
			}
		}
		ans = max(ans, mx);	
	}
	for(int i = 1; i < n; i++)
		assert(OPT[i - 1] <= OPT[i]);
}

int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n >> m;
	ll val, cost;
	for(int i = 0; i < n; i++){
		cin >> val >> cost;
		A.pb({cost, val});
	}
	sort(all(A));
	for(int i = 0; i < n; i++)
		V.pb({A[i].S, i});
	sort(all(V)); reverse(all(V));
	for(int i = 0; i < n; i++)
		ridx[V[i].S] = i;

	Solve(0, n, 0, n);
	// NAIVE();
	// debug(Get(0, 4));
	cout << ans << '\n';
	// debug(Sum.Get(N - 5));
	// debug(Sum.Get(78));
	return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3404 KB Output is correct
2 Correct 3 ms 3404 KB Output is correct
3 Correct 2 ms 3404 KB Output is correct
4 Correct 2 ms 3404 KB Output is correct
5 Correct 2 ms 3404 KB Output is correct
6 Correct 2 ms 3404 KB Output is correct
7 Correct 2 ms 3404 KB Output is correct
8 Correct 2 ms 3404 KB Output is correct
9 Correct 2 ms 3404 KB Output is correct
10 Correct 2 ms 3404 KB Output is correct
11 Correct 2 ms 3404 KB Output is correct
12 Correct 3 ms 3404 KB Output is correct
13 Correct 2 ms 3404 KB Output is correct
14 Correct 2 ms 3404 KB Output is correct
15 Correct 2 ms 3404 KB Output is correct
16 Correct 3 ms 3404 KB Output is correct
17 Correct 2 ms 3404 KB Output is correct
18 Correct 3 ms 3404 KB Output is correct
19 Correct 3 ms 3404 KB Output is correct
20 Correct 3 ms 3404 KB Output is correct
21 Correct 2 ms 3404 KB Output is correct
22 Correct 2 ms 3404 KB Output is correct
23 Correct 2 ms 3404 KB Output is correct
24 Correct 3 ms 3404 KB Output is correct
25 Correct 2 ms 3404 KB Output is correct
26 Correct 2 ms 3404 KB Output is correct
27 Correct 3 ms 3404 KB Output is correct
28 Correct 3 ms 3404 KB Output is correct
29 Correct 3 ms 3404 KB Output is correct
30 Correct 2 ms 3404 KB Output is correct
31 Correct 2 ms 3404 KB Output is correct
32 Correct 2 ms 3404 KB Output is correct
33 Correct 2 ms 3404 KB Output is correct
34 Correct 3 ms 3404 KB Output is correct
35 Correct 3 ms 3404 KB Output is correct
36 Correct 2 ms 3404 KB Output is correct
37 Correct 2 ms 3404 KB Output is correct
38 Correct 6 ms 3532 KB Output is correct
39 Correct 6 ms 3532 KB Output is correct
40 Correct 5 ms 3532 KB Output is correct
41 Correct 5 ms 3532 KB Output is correct
42 Correct 4 ms 3560 KB Output is correct
43 Correct 5 ms 3532 KB Output is correct
44 Correct 6 ms 3532 KB Output is correct
45 Correct 8 ms 3444 KB Output is correct
46 Correct 8 ms 3532 KB Output is correct
47 Correct 8 ms 3560 KB Output is correct
48 Correct 6 ms 3532 KB Output is correct
49 Correct 5 ms 3532 KB Output is correct
50 Correct 6 ms 3532 KB Output is correct
51 Correct 5 ms 3532 KB Output is correct
52 Correct 5 ms 3532 KB Output is correct
53 Correct 5 ms 3532 KB Output is correct
54 Correct 5 ms 3532 KB Output is correct
55 Correct 4 ms 3532 KB Output is correct
56 Correct 4 ms 3532 KB Output is correct
57 Correct 4 ms 3532 KB Output is correct
58 Correct 4 ms 3532 KB Output is correct
59 Correct 5 ms 3532 KB Output is correct
60 Correct 6 ms 3532 KB Output is correct
61 Correct 5 ms 3516 KB Output is correct
62 Correct 6 ms 3532 KB Output is correct
63 Correct 6 ms 3532 KB Output is correct
64 Correct 6 ms 3532 KB Output is correct
65 Correct 7 ms 3532 KB Output is correct
66 Correct 6 ms 3556 KB Output is correct
67 Correct 7 ms 3532 KB Output is correct
68 Correct 6 ms 3532 KB Output is correct
69 Correct 6 ms 3532 KB Output is correct
70 Correct 5 ms 3532 KB Output is correct
71 Correct 5 ms 3532 KB Output is correct
72 Correct 5 ms 3532 KB Output is correct
73 Correct 5 ms 3532 KB Output is correct
74 Correct 3 ms 3532 KB Output is correct
75 Correct 535 ms 12428 KB Output is correct
76 Correct 644 ms 15896 KB Output is correct
77 Correct 466 ms 16104 KB Output is correct
78 Correct 552 ms 16176 KB Output is correct
79 Correct 120 ms 16176 KB Output is correct
80 Correct 153 ms 16124 KB Output is correct
81 Correct 534 ms 15400 KB Output is correct
82 Correct 711 ms 15508 KB Output is correct
83 Correct 610 ms 15592 KB Output is correct
84 Correct 654 ms 15664 KB Output is correct
85 Correct 605 ms 15408 KB Output is correct
86 Correct 306 ms 15152 KB Output is correct
87 Correct 335 ms 15244 KB Output is correct
88 Correct 492 ms 15152 KB Output is correct
89 Correct 471 ms 15404 KB Output is correct
90 Correct 327 ms 15668 KB Output is correct
91 Correct 229 ms 15236 KB Output is correct
92 Correct 241 ms 15148 KB Output is correct
93 Correct 284 ms 15312 KB Output is correct
94 Correct 203 ms 15592 KB Output is correct
95 Correct 307 ms 15708 KB Output is correct
96 Correct 355 ms 15160 KB Output is correct
97 Correct 375 ms 15664 KB Output is correct
98 Correct 389 ms 15560 KB Output is correct
99 Correct 351 ms 15536 KB Output is correct
100 Correct 293 ms 15224 KB Output is correct
101 Correct 314 ms 15264 KB Output is correct
102 Correct 556 ms 15212 KB Output is correct
103 Correct 546 ms 15136 KB Output is correct
104 Correct 606 ms 15468 KB Output is correct
105 Correct 458 ms 15404 KB Output is correct
106 Correct 465 ms 15484 KB Output is correct
107 Correct 411 ms 15280 KB Output is correct
108 Correct 462 ms 15952 KB Output is correct
109 Correct 424 ms 16280 KB Output is correct
110 Correct 268 ms 14636 KB Output is correct
111 Correct 353 ms 14776 KB Output is correct
112 Correct 432 ms 14512 KB Output is correct
113 Correct 120 ms 16624 KB Output is correct