답안 #108135

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
108135	2019-04-27T15:30:55 Z	eriksuenderhauf	Cake 3 (JOI19_cake3)	C++11	100 / 100	2990 ms	14880 KB

cake3

//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%lld", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%lld\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const ll INF = 1e16 + 7;
const int MAXN = 2e5 + 5;
const double eps = 1e-9;
pair<pii,int> a[MAXN];
ll ans = -INF;
int n, m, curL = 0, curR = -1;
pair<ll,int> seg[MAXN*4];

void upd(int l, int r, int k, int a, ll val) {
	if (r < a || a < l) return;
	if (a <= l && r <= a) {
		if (val < 0)
			seg[k] = {0, 0};
		else
			seg[k] = {val, 1};
		return;
	}
	int mi = (l + r) / 2;
	upd(l, mi, k*2, a, val);
	upd(mi+1, r, k*2+1, a, val);
	seg[k].fi = seg[k*2].fi + seg[k*2+1].fi;
	seg[k].se = seg[k*2].se + seg[k*2+1].se;
}

pair<ll,int> qry(int l, int r, int k, int cnt) {
	if (seg[k].se <= cnt) return seg[k];
	int mi = (l + r) / 2;
	pair<ll,int> t1 = qry(mi+1, r, k*2+1, cnt);
	if (t1.se >= cnt) return t1;
	pair<ll,int> t2 = qry(l, mi, k*2, cnt - t1.se);
	return mp(t1.fi+t2.fi, t1.se+t2.se);
}

ll qry(int lo, int hi) {
	if (hi - lo + 1 < m)
		return -INF;
	while (curL > lo) {
		curL--;
		upd(0, n-1, 1, a[curL].se, a[curL].fi.se);
	}
	while (curR < hi) {
		curR++;
		upd(0, n-1, 1, a[curR].se, a[curR].fi.se);
	}
	while (curL < lo) {
		upd(0, n-1, 1, a[curL].se, -1);
		curL++;
	}
	while (curR > hi) {
		upd(0, n-1, 1, a[curR].se, -1);
		curR--;
	}
	/*upd(0, n-1, 1, a[lo].se, -1);
	upd(0, n-1, 1, a[hi].se, -1);
	ll ret = qry(0, n-1, 1, m-2).fi + a[lo].fi.se + a[hi].fi.se - 2 * (a[hi].fi.fi - a[lo].fi.fi);
	upd(0, n-1, 1, a[lo].se, a[lo].fi.se);
	upd(0, n-1, 1, a[hi].se, a[hi].fi.se);*/
	ll ret = qry(0, n-1, 1, m).fi - 2 * (a[hi].fi.fi - a[lo].fi.fi);
	return ret;
}

void dfs(int l, int r, int oL, int oR) {
	if (l > r) return;
	int mi = (l + r) / 2, nx = oL;
	ll val = -INF;
	for (int i = max(oL, mi + m-1); i <= oR; i++) {
		ll tmp = qry(mi, i);
		if (tmp > val)
			tie(nx, val) = mp(i, tmp);
	}
	ans = max(ans, val);
	dfs(l, mi-1, oL, nx);
	dfs(mi+1, r, nx, oR);
}

int main() {
	assert(scanf("%d %d", &n, &m) == 2);
	for (int i = 0; i < n; i++) {
		assert(scanf("%d %d", &a[i].fi.fi, &a[i].fi.se) == 2);
		a[i].se = 0;
	}
	sort(a, a + n);
	for (int i = 0; i < n; i++) {
		a[i].se = i;
		swap(a[i].fi.fi, a[i].fi.se);
	}
	sort(a, a + n);
	dfs(0, n-m, 0, n-1);
	prl(ans);
    return 0;
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	512 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	3 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	3 ms	384 KB	Output is correct
8	Correct	3 ms	384 KB	Output is correct
9	Correct	5 ms	512 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	3 ms	384 KB	Output is correct
14	Correct	3 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	0 ms	384 KB	Output is correct
18	Correct	3 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct
21	Correct	2 ms	384 KB	Output is correct
22	Correct	3 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	3 ms	384 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	3 ms	356 KB	Output is correct
28	Correct	3 ms	384 KB	Output is correct
29	Correct	2 ms	384 KB	Output is correct
30	Correct	2 ms	384 KB	Output is correct
31	Correct	2 ms	384 KB	Output is correct
32	Correct	2 ms	384 KB	Output is correct
33	Correct	3 ms	384 KB	Output is correct
34	Correct	3 ms	384 KB	Output is correct
35	Correct	2 ms	384 KB	Output is correct
36	Correct	3 ms	384 KB	Output is correct
37	Correct	0 ms	384 KB	Output is correct

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	512 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	3 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	3 ms	384 KB	Output is correct
8	Correct	3 ms	384 KB	Output is correct
9	Correct	5 ms	512 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	3 ms	384 KB	Output is correct
14	Correct	3 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	0 ms	384 KB	Output is correct
18	Correct	3 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct
21	Correct	2 ms	384 KB	Output is correct
22	Correct	3 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	3 ms	384 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	3 ms	356 KB	Output is correct
28	Correct	3 ms	384 KB	Output is correct
29	Correct	2 ms	384 KB	Output is correct
30	Correct	2 ms	384 KB	Output is correct
31	Correct	2 ms	384 KB	Output is correct
32	Correct	2 ms	384 KB	Output is correct
33	Correct	3 ms	384 KB	Output is correct
34	Correct	3 ms	384 KB	Output is correct
35	Correct	2 ms	384 KB	Output is correct
36	Correct	3 ms	384 KB	Output is correct
37	Correct	0 ms	384 KB	Output is correct
38	Correct	11 ms	512 KB	Output is correct
39	Correct	11 ms	500 KB	Output is correct
40	Correct	6 ms	384 KB	Output is correct
41	Correct	7 ms	512 KB	Output is correct
42	Correct	5 ms	384 KB	Output is correct
43	Correct	6 ms	384 KB	Output is correct
44	Correct	10 ms	384 KB	Output is correct
45	Correct	10 ms	508 KB	Output is correct
46	Correct	11 ms	384 KB	Output is correct
47	Correct	11 ms	384 KB	Output is correct
48	Correct	8 ms	484 KB	Output is correct
49	Correct	8 ms	384 KB	Output is correct
50	Correct	8 ms	384 KB	Output is correct
51	Correct	9 ms	384 KB	Output is correct
52	Correct	7 ms	512 KB	Output is correct
53	Correct	8 ms	384 KB	Output is correct
54	Correct	8 ms	384 KB	Output is correct
55	Correct	6 ms	384 KB	Output is correct
56	Correct	5 ms	356 KB	Output is correct
57	Correct	5 ms	512 KB	Output is correct
58	Correct	4 ms	384 KB	Output is correct
59	Correct	7 ms	384 KB	Output is correct
60	Correct	9 ms	384 KB	Output is correct
61	Correct	6 ms	384 KB	Output is correct
62	Correct	6 ms	384 KB	Output is correct
63	Correct	7 ms	384 KB	Output is correct
64	Correct	5 ms	384 KB	Output is correct
65	Correct	9 ms	384 KB	Output is correct
66	Correct	8 ms	512 KB	Output is correct
67	Correct	9 ms	384 KB	Output is correct
68	Correct	7 ms	384 KB	Output is correct
69	Correct	7 ms	384 KB	Output is correct
70	Correct	7 ms	384 KB	Output is correct
71	Correct	41 ms	384 KB	Output is correct
72	Correct	7 ms	384 KB	Output is correct
73	Correct	8 ms	512 KB	Output is correct
74	Correct	4 ms	384 KB	Output is correct
75	Correct	2358 ms	10780 KB	Output is correct
76	Correct	2990 ms	14328 KB	Output is correct
77	Correct	1951 ms	14456 KB	Output is correct
78	Correct	2377 ms	14568 KB	Output is correct
79	Correct	187 ms	14588 KB	Output is correct
80	Correct	379 ms	14352 KB	Output is correct
81	Correct	2139 ms	13688 KB	Output is correct
82	Correct	2893 ms	13740 KB	Output is correct
83	Correct	2532 ms	13888 KB	Output is correct
84	Correct	2406 ms	13944 KB	Output is correct
85	Correct	2050 ms	13664 KB	Output is correct
86	Correct	1012 ms	13560 KB	Output is correct
87	Correct	1190 ms	13432 KB	Output is correct
88	Correct	1895 ms	13532 KB	Output is correct
89	Correct	1654 ms	13676 KB	Output is correct
90	Correct	1277 ms	13872 KB	Output is correct
91	Correct	768 ms	13576 KB	Output is correct
92	Correct	815 ms	13432 KB	Output is correct
93	Correct	928 ms	13816 KB	Output is correct
94	Correct	620 ms	13820 KB	Output is correct
95	Correct	1099 ms	13872 KB	Output is correct
96	Correct	997 ms	13560 KB	Output is correct
97	Correct	1106 ms	13840 KB	Output is correct
98	Correct	1010 ms	13660 KB	Output is correct
99	Correct	978 ms	13780 KB	Output is correct
100	Correct	687 ms	13432 KB	Output is correct
101	Correct	755 ms	13560 KB	Output is correct
102	Correct	1611 ms	13532 KB	Output is correct
103	Correct	1641 ms	13536 KB	Output is correct
104	Correct	1937 ms	13696 KB	Output is correct
105	Correct	1490 ms	13776 KB	Output is correct
106	Correct	1584 ms	13816 KB	Output is correct
107	Correct	1386 ms	13724 KB	Output is correct
108	Correct	2112 ms	14324 KB	Output is correct
109	Correct	1465 ms	14712 KB	Output is correct
110	Correct	944 ms	13148 KB	Output is correct
111	Correct	1421 ms	13048 KB	Output is correct
112	Correct	1348 ms	12924 KB	Output is correct
113	Correct	186 ms	14880 KB	Output is correct

답안 #108135

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