답안 #486195

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
486195	2021-11-10T18:37:27 Z	cheissmart	Cake 3 (JOI19_cake3)	C++14	100 / 100	948 ms	183692 KB

cake3

#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

void DBG() { cerr << "]" << endl; }
template<class H, class...T> void DBG(H h, T ...t) {
	cerr << to_string(h);
	if(sizeof ...(t)) cerr << ", ";
	DBG(t...); 
}
#define debug(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)

const int INF = 1e9 + 7, N = 2e5 + 7;
const ll oo = 1e18 + 7;

vi compress;

struct node {
	node *l, *r;
	ll sum, cnt;
	node() {
		l = r = nullptr;
		sum = cnt = 0;
	}
	node(node* _l, node* _r) {
		l = _l, r = _r;
		sum = (l ? l -> sum : 0LL) + (r ? r -> sum : 0LL);
		cnt = (l ? l -> cnt : 0LL) + (r ? r -> cnt : 0LL);
	}
};

ll cnt(node* t) {
	return t ? t -> cnt : 0LL;
}

ll sum(node* t) {
	return t ? t -> sum : 0LL;
}
node* lc(node* t) {
	return t ? t -> l : nullptr;
}
node* rc(node* t) {
	return t ? t -> r : nullptr;
}

node* h[N];

node* add(node* t, int pos, int tl = 0, int tr = compress.size()) {
	if(tr - tl == 1) {
		node* tt = new node();
		tt -> sum = sum(t) + compress[pos];
		tt -> cnt = cnt(t) + 1;
		return tt;
	}
	int tm = (tl + tr) / 2;
	if(pos < tm)
		return new node(add(lc(t), pos, tl, tm), rc(t));
	else
		return new node(lc(t), add(rc(t), pos, tm, tr));
}


ll qry(node* t1, node* t2, int m, int tl = 0, int tr = compress.size()) {
	if(cnt(t2) - cnt(t1) == m)
		return sum(t2) - sum(t1);
	if(tr - tl == 1)
		return 1LL * compress[tl] * m;
	int tm = (tl + tr) / 2;
	if(cnt(rc(t2)) - cnt(rc(t1)) >= m)
		return qry(rc(t1), rc(t2), m, tm, tr);
	else {
		int x = cnt(rc(t2)) - cnt(rc(t1));
		return sum(rc(t2)) - sum(rc(t1)) + qry(lc(t1), lc(t2), m - x, tl, tm);
	}
}

ll qry(int l, int r, int m) {
	assert(r - l >= m);
	return qry(h[l], h[r], m);
}

signed main() {
	IO_OP;
	int n, m;
	cin >> n >> m;
	m -= 2;
	V<pi> a(n); // c, v
	
	for(int i = 0; i < n; i++) {
		cin >> a[i].S >> a[i].F;
		compress.PB(a[i].S);
	}	
	sort(ALL(a));
	
	sort(ALL(compress));
	compress.resize(unique(ALL(compress)) - compress.begin());
	
	h[0] = nullptr;
	for(int i = 1; i <= n; i++) {
		int tt = lower_bound(ALL(compress), a[i - 1].S) - compress.begin();
		h[i] = add(h[i - 1], tt);
//		debug(h[i] -> cnt);
	}
	
	auto cost = [&] (int j, int i) {
		if(i - j - 1 < m) return -oo;
		return 0LL + 2 * a[j].F - 2 * a[i].F + a[i].S + a[j].S + qry(j + 1, i, m);
	};
	
	ll ans = -oo;
	
	function<void(int, int, int, int)> solve = [&] (int l, int r, int ql, int qr) {
		if(l > r)
			return;
		if(r == l) {
			for(int i = ql; i <= qr; i++)
				ans = max(ans, cost(i, l));
			return;
		}
		int m = (l + r) / 2;
		ll mx = -oo, qm = -1;
		for(int i = ql; i <= qr; i++) {
			ll tt = cost(i, m);
			if(tt > mx) {
				mx = tt;
				qm = i;
			}
		}
		assert(qm != -1);
		ans = max(ans, mx);
		solve(l, m - 1, ql, qm);
		solve(m + 1, r, qm, qr);
	};
	solve(m + 1, n - 1, 0, n - 1);

	cout << ans << '\n';
	
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	0 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	0 ms	332 KB	Output is correct
17	Correct	0 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	0 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	0 ms	332 KB	Output is correct
23	Correct	0 ms	332 KB	Output is correct
24	Correct	0 ms	332 KB	Output is correct
25	Correct	0 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	0 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	332 KB	Output is correct
32	Correct	0 ms	332 KB	Output is correct
33	Correct	0 ms	332 KB	Output is correct
34	Correct	0 ms	332 KB	Output is correct
35	Correct	0 ms	332 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	0 ms	332 KB	Output is correct

Subtask #2
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	0 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	0 ms	332 KB	Output is correct
17	Correct	0 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	0 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	0 ms	332 KB	Output is correct
23	Correct	0 ms	332 KB	Output is correct
24	Correct	0 ms	332 KB	Output is correct
25	Correct	0 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	0 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	332 KB	Output is correct
32	Correct	0 ms	332 KB	Output is correct
33	Correct	0 ms	332 KB	Output is correct
34	Correct	0 ms	332 KB	Output is correct
35	Correct	0 ms	332 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	0 ms	332 KB	Output is correct
38	Correct	4 ms	1356 KB	Output is correct
39	Correct	3 ms	1356 KB	Output is correct
40	Correct	3 ms	1356 KB	Output is correct
41	Correct	3 ms	1356 KB	Output is correct
42	Correct	2 ms	1356 KB	Output is correct
43	Correct	2 ms	1356 KB	Output is correct
44	Correct	3 ms	1356 KB	Output is correct
45	Correct	3 ms	1356 KB	Output is correct
46	Correct	4 ms	1484 KB	Output is correct
47	Correct	3 ms	1356 KB	Output is correct
48	Correct	3 ms	1356 KB	Output is correct
49	Correct	3 ms	1356 KB	Output is correct
50	Correct	3 ms	1356 KB	Output is correct
51	Correct	3 ms	1356 KB	Output is correct
52	Correct	3 ms	1356 KB	Output is correct
53	Correct	3 ms	1356 KB	Output is correct
54	Correct	2 ms	1356 KB	Output is correct
55	Correct	2 ms	1356 KB	Output is correct
56	Correct	2 ms	1356 KB	Output is correct
57	Correct	2 ms	1356 KB	Output is correct
58	Correct	2 ms	1356 KB	Output is correct
59	Correct	1 ms	332 KB	Output is correct
60	Correct	1 ms	460 KB	Output is correct
61	Correct	1 ms	332 KB	Output is correct
62	Correct	2 ms	332 KB	Output is correct
63	Correct	1 ms	460 KB	Output is correct
64	Correct	1 ms	332 KB	Output is correct
65	Correct	4 ms	1356 KB	Output is correct
66	Correct	3 ms	1356 KB	Output is correct
67	Correct	4 ms	1356 KB	Output is correct
68	Correct	3 ms	1356 KB	Output is correct
69	Correct	3 ms	1356 KB	Output is correct
70	Correct	2 ms	1356 KB	Output is correct
71	Correct	1 ms	716 KB	Output is correct
72	Correct	1 ms	716 KB	Output is correct
73	Correct	3 ms	1356 KB	Output is correct
74	Correct	3 ms	1484 KB	Output is correct

Subtask #3
76.0 / 76.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	0 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	0 ms	332 KB	Output is correct
17	Correct	0 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	0 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	0 ms	332 KB	Output is correct
23	Correct	0 ms	332 KB	Output is correct
24	Correct	0 ms	332 KB	Output is correct
25	Correct	0 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	0 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	332 KB	Output is correct
32	Correct	0 ms	332 KB	Output is correct
33	Correct	0 ms	332 KB	Output is correct
34	Correct	0 ms	332 KB	Output is correct
35	Correct	0 ms	332 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	0 ms	332 KB	Output is correct
38	Correct	4 ms	1356 KB	Output is correct
39	Correct	3 ms	1356 KB	Output is correct
40	Correct	3 ms	1356 KB	Output is correct
41	Correct	3 ms	1356 KB	Output is correct
42	Correct	2 ms	1356 KB	Output is correct
43	Correct	2 ms	1356 KB	Output is correct
44	Correct	3 ms	1356 KB	Output is correct
45	Correct	3 ms	1356 KB	Output is correct
46	Correct	4 ms	1484 KB	Output is correct
47	Correct	3 ms	1356 KB	Output is correct
48	Correct	3 ms	1356 KB	Output is correct
49	Correct	3 ms	1356 KB	Output is correct
50	Correct	3 ms	1356 KB	Output is correct
51	Correct	3 ms	1356 KB	Output is correct
52	Correct	3 ms	1356 KB	Output is correct
53	Correct	3 ms	1356 KB	Output is correct
54	Correct	2 ms	1356 KB	Output is correct
55	Correct	2 ms	1356 KB	Output is correct
56	Correct	2 ms	1356 KB	Output is correct
57	Correct	2 ms	1356 KB	Output is correct
58	Correct	2 ms	1356 KB	Output is correct
59	Correct	1 ms	332 KB	Output is correct
60	Correct	1 ms	460 KB	Output is correct
61	Correct	1 ms	332 KB	Output is correct
62	Correct	2 ms	332 KB	Output is correct
63	Correct	1 ms	460 KB	Output is correct
64	Correct	1 ms	332 KB	Output is correct
65	Correct	4 ms	1356 KB	Output is correct
66	Correct	3 ms	1356 KB	Output is correct
67	Correct	4 ms	1356 KB	Output is correct
68	Correct	3 ms	1356 KB	Output is correct
69	Correct	3 ms	1356 KB	Output is correct
70	Correct	2 ms	1356 KB	Output is correct
71	Correct	1 ms	716 KB	Output is correct
72	Correct	1 ms	716 KB	Output is correct
73	Correct	3 ms	1356 KB	Output is correct
74	Correct	3 ms	1484 KB	Output is correct
75	Correct	920 ms	166600 KB	Output is correct
76	Correct	948 ms	165252 KB	Output is correct
77	Correct	761 ms	170628 KB	Output is correct
78	Correct	853 ms	173292 KB	Output is correct
79	Correct	352 ms	174144 KB	Output is correct
80	Correct	353 ms	168704 KB	Output is correct
81	Correct	489 ms	146776 KB	Output is correct
82	Correct	651 ms	155552 KB	Output is correct
83	Correct	587 ms	154972 KB	Output is correct
84	Correct	642 ms	156096 KB	Output is correct
85	Correct	515 ms	148252 KB	Output is correct
86	Correct	312 ms	138196 KB	Output is correct
87	Correct	348 ms	137448 KB	Output is correct
88	Correct	513 ms	139788 KB	Output is correct
89	Correct	472 ms	145412 KB	Output is correct
90	Correct	324 ms	148032 KB	Output is correct
91	Correct	281 ms	135516 KB	Output is correct
92	Correct	274 ms	134792 KB	Output is correct
93	Correct	293 ms	140704 KB	Output is correct
94	Correct	342 ms	144268 KB	Output is correct
95	Correct	321 ms	147572 KB	Output is correct
96	Correct	73 ms	15296 KB	Output is correct
97	Correct	71 ms	16448 KB	Output is correct
98	Correct	71 ms	16204 KB	Output is correct
99	Correct	69 ms	16208 KB	Output is correct
100	Correct	62 ms	15368 KB	Output is correct
101	Correct	65 ms	15296 KB	Output is correct
102	Correct	437 ms	119148 KB	Output is correct
103	Correct	369 ms	116960 KB	Output is correct
104	Correct	388 ms	126528 KB	Output is correct
105	Correct	358 ms	117724 KB	Output is correct
106	Correct	295 ms	120380 KB	Output is correct
107	Correct	337 ms	114448 KB	Output is correct
108	Correct	727 ms	172376 KB	Output is correct
109	Correct	661 ms	183300 KB	Output is correct
110	Correct	98 ms	44780 KB	Output is correct
111	Correct	113 ms	45276 KB	Output is correct
112	Correct	353 ms	163220 KB	Output is correct
113	Correct	397 ms	183692 KB	Output is correct

답안 #486195

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 19.0 / 19.0

Subtask #3 76.0 / 76.0

Subtask #1
5.0 / 5.0

Subtask #2
19.0 / 19.0

Subtask #3
76.0 / 76.0