oj.uz

Submission #139289

# Submission time Handle Problem Language Result Execution time Memory
139289 2019-07-31T14:08:41 Z Mahmoud_Adel Cake 3 (JOI19_cake3) C++14
100 / 100
 1406 ms 143324 KB 
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef long long ll;
const int N = 2e5+5;
ll n, k, cn, ans = -1e18;
ll root[N], lc[N*40], b[N], rc[N*40];
pair<ll, ll> tree[N*40];
vector<pair<ll, ll>> comp;
pair<ll, ll> p[N];
void merge(int node)
{
	tree[node].f = tree[lc[node]].f+tree[rc[node]].f;
	tree[node].s = tree[lc[node]].s+tree[rc[node]].s;
}
void build(int node = 0, int l=0, int r=n-1)
{
	if(l == r)
	{
		tree[node] = {1, comp[l].f};
		//cout << node << " " << tree[node].f << " " << tree[node].s << " | " << l << " " << r << endl;
		return ;
	}
	int mid = (l+r)>>1;
	lc[node] = ++cn, rc[node] = ++cn;
	build(lc[node], l, mid);
	build(rc[node], mid+1, r);
	merge(node);
	//cout << node << " " << tree[node].f << " " << tree[node].s << " | " << l << " " << r << endl;
}
void upd(int i, int node, int node2, int l=0, int r=n-1)
{
	tree[node] = tree[node2];
	if(l == r)
	{
		tree[node] = {0, 0};
		//cout << node << " " << tree[node].f << " " << tree[node].s << " | " << l << " " << r << endl;
		return ;
	}
	int mid = (l+r)>>1;
	if(i > mid)
	{
		rc[node] = ++cn;
		lc[node] = lc[node2];
		upd(i, rc[node], rc[node2], mid+1, r);
	}
	else
	{
		rc[node] = rc[node2];
		lc[node] = ++cn;
		upd(i, lc[node], lc[node2], l, mid);
	}
	merge(node);
	//cout << node << " " << tree[node].f << " " << tree[node].s << " | " << l << " " << r << endl;
}
bool cmp(pair<ll, ll> a, pair<ll, ll> b)
{
	return a.s < b.s;
}
ll sum2(ll l, ll r)
{
	vector<ll> vec;
	ll ret = 0;
	for(ll i=l; i<=r; i++)
	{
		vec.push_back(p[i].f);
	}
	sort(vec.rbegin(), vec.rend());
	for(ll i=0; i<k; i++) ret += vec[i];
	return ret;
}
ll sum(int node1, int node2, ll cnt)
{
	ll cmt = tree[rc[node2]].f-tree[rc[node1]].f;
//	cout << node1 << " " << node2 << " | " << rc[node1] << " " << lc[node1]
//	 << " | " << cmt << " " << cnt << " " << tree[node2].f-tree[node1].f << endl;
	assert(tree[node2].f-tree[node1].f >= cnt);
	if(tree[node2].f-tree[node1].f == cnt) return tree[node2].s-tree[node1].s;
	if(!cnt) return 0;
	else if(cmt >= cnt) return sum(rc[node1], rc[node2], cnt);
	else return sum(rc[node1], rc[node2], cmt) + sum(lc[node1], lc[node2], cnt-cmt); 
}
void solve(ll l, ll r, ll s, ll e)
{
	if(l > r) return ;
	ll id = -1, m = -1e18;
	ll mid = (l+r)>>1;
	for(ll i=max(mid+k-1, (ll)s); i<=e; i++)
	{
		ll tmp;
		if(tree[root[mid]].f-tree[root[i+1]].f >= k) tmp = sum(root[i+1], root[mid], k);
		else tmp = sum2(mid, i);
		tmp -= (p[i].s-p[mid].s)*2LL;
		if(tmp > m)  m = tmp, id = i;
	}
	solve(l, mid-1, s, id);
	solve(mid+1, r, id, e);
	ans = max(ans, m);
}
	
int main()
{
	cin >> n >> k;
	for(int i=0; i<n; i++) cin >> p[i].f >> p[i].s;
	sort(p, p+n, cmp);
	for(int i=0; i<n; i++) comp.push_back({p[i].f, i});
	sort(comp.begin(), comp.end());
	for(int i=0; i<n; i++) b[comp[i].s] = i;
	build();
	for(int i=1; i<=n; i++)
	{
		int id = b[i-1];
		root[i] = ++cn;
		upd(id, root[i], root[i-1]);
	}
	//cout << sum(root[6+1], root[1], k) << " " << sum2(1, 6) << endl;
	solve(0, n-k, 0, n-1);
	cout << ans << endl;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 1 ms 248 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 380 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 3 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 380 KB Output is correct
38 Correct 8 ms 1404 KB Output is correct
39 Correct 8 ms 1400 KB Output is correct
40 Correct 7 ms 1272 KB Output is correct
41 Correct 7 ms 1272 KB Output is correct
42 Correct 7 ms 1272 KB Output is correct
43 Correct 7 ms 1272 KB Output is correct
44 Correct 7 ms 1296 KB Output is correct
45 Correct 7 ms 1400 KB Output is correct
46 Correct 9 ms 1396 KB Output is correct
47 Correct 8 ms 1272 KB Output is correct
48 Correct 8 ms 1272 KB Output is correct
49 Correct 7 ms 1272 KB Output is correct
50 Correct 7 ms 1400 KB Output is correct
51 Correct 7 ms 1400 KB Output is correct
52 Correct 7 ms 1272 KB Output is correct
53 Correct 7 ms 1400 KB Output is correct
54 Correct 7 ms 1400 KB Output is correct
55 Correct 6 ms 1272 KB Output is correct
56 Correct 6 ms 1272 KB Output is correct
57 Correct 6 ms 1272 KB Output is correct
58 Correct 6 ms 1272 KB Output is correct
59 Correct 6 ms 1272 KB Output is correct
60 Correct 7 ms 1272 KB Output is correct
61 Correct 7 ms 1272 KB Output is correct
62 Correct 6 ms 1400 KB Output is correct
63 Correct 7 ms 1528 KB Output is correct
64 Correct 6 ms 1400 KB Output is correct
65 Correct 7 ms 1272 KB Output is correct
66 Correct 7 ms 1272 KB Output is correct
67 Correct 7 ms 1272 KB Output is correct
68 Correct 7 ms 1400 KB Output is correct
69 Correct 7 ms 1272 KB Output is correct
70 Correct 6 ms 1400 KB Output is correct
71 Correct 6 ms 1272 KB Output is correct
72 Correct 2 ms 1276 KB Output is correct
73 Correct 7 ms 1272 KB Output is correct
74 Correct 6 ms 1400 KB Output is correct
75 Correct 1296 ms 129440 KB Output is correct
76 Correct 1395 ms 129304 KB Output is correct
77 Correct 1250 ms 133340 KB Output is correct
78 Correct 1236 ms 135512 KB Output is correct
79 Correct 581 ms 136140 KB Output is correct
80 Correct 702 ms 132060 KB Output is correct
81 Correct 1126 ms 133852 KB Output is correct
82 Correct 1278 ms 135900 KB Output is correct
83 Correct 1267 ms 140476 KB Output is correct
84 Correct 1406 ms 140124 KB Output is correct
85 Correct 1128 ms 135220 KB Output is correct
86 Correct 749 ms 130200 KB Output is correct
87 Correct 775 ms 128320 KB Output is correct
88 Correct 1012 ms 127572 KB Output is correct
89 Correct 1004 ms 135104 KB Output is correct
90 Correct 809 ms 141716 KB Output is correct
91 Correct 710 ms 130652 KB Output is correct
92 Correct 713 ms 129204 KB Output is correct
93 Correct 756 ms 135220 KB Output is correct
94 Correct 635 ms 141468 KB Output is correct
95 Correct 781 ms 142044 KB Output is correct
96 Correct 617 ms 131320 KB Output is correct
97 Correct 658 ms 142288 KB Output is correct
98 Correct 724 ms 140036 KB Output is correct
99 Correct 632 ms 140252 KB Output is correct
100 Correct 562 ms 131804 KB Output is correct
101 Correct 625 ms 131932 KB Output is correct
102 Correct 1129 ms 131804 KB Output is correct
103 Correct 1121 ms 130004 KB Output is correct
104 Correct 1394 ms 137432 KB Output is correct
105 Correct 1153 ms 137052 KB Output is correct
106 Correct 1063 ms 140720 KB Output is correct
107 Correct 948 ms 135516 KB Output is correct
108 Correct 1160 ms 134772 KB Output is correct
109 Correct 1062 ms 143068 KB Output is correct
110 Correct 564 ms 132100 KB Output is correct
111 Correct 673 ms 133644 KB Output is correct
112 Correct 1131 ms 127320 KB Output is correct
113 Correct 625 ms 143324 KB Output is correct