답안 #499305

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
499305	2021-12-27T23:00:00 Z	couplefire	Cake 3 (JOI19_cake3)	C++17	100 / 100	1348 ms	151640 KB

cake3

#include <iostream>
#include <algorithm>
using namespace std;
#define sz 30000000
pair<long long,int> tree[sz];
int n,m,lc[sz],rc[sz],root[200005],cn;
long long ans=-1e18;
pair<int,int> arr[200005];
void update(int node,int node2,int st,int en,int idx){
	tree[node2]=tree[node];
	tree[node2].first+=idx;
	tree[node2].second++;
	if (st!=en){
		int mid=(st+en)/2;
		if (st<=idx && idx<=mid){
			lc[node2]=++cn;
			rc[node2]=rc[node];
			update(lc[node],lc[node2],st,mid,idx);
		}
		else{
			rc[node2]=++cn;
			lc[node2]=lc[node];
			update(rc[node],rc[node2],mid+1,en,idx);
		}
	}
}
long long get(int node,int node2,int st,int en,int k){
	if (st==en)
	return 1LL*k*st;
	int mid=(st+en)/2;
	if (tree[rc[node2]].second-tree[rc[node]].second>=k)
	return get(rc[node],rc[node2],mid+1,en,k);
	k-=tree[rc[node2]].second-tree[rc[node]].second;
	return tree[rc[node2]].first-tree[rc[node]].first+get(lc[node],lc[node2],st,mid,k);
}
long long query(int l,int r){
	return get(root[l],root[r-1],1,1e9,m-2)+arr[l].second+arr[r].second-2*arr[r].first+2*arr[l].first;
}
void solve(int l,int r,int optl,int optr){
	if (r<l)
	return;
	int opt=optl,mid=(l+r)/2;
	for (int i=optl+1;i<=min(mid-m+1,optr);i++)
	{
		if (query(i,mid)>query(opt,mid))
		opt=i;
	}
	ans=max(ans,query(opt,mid));
	solve(l,mid-1,optl,opt);
	solve(mid+1,r,opt,optr);
}
int main(){
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++)
	scanf("%d%d",&arr[i].second,&arr[i].first);
	sort(arr+1,arr+n+1);
	for (int i=1;i<=n;i++)
	{
		root[i]=++cn;
		update(root[i-1],root[i],1,1e9,arr[i].second);
	}
	solve(m,n,1,n-m+1);
	printf("%lld",ans);
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:53:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |  scanf("%d%d",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~
cake3.cpp:55:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |  scanf("%d%d",&arr[i].second,&arr[i].first);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	300 KB	Output is correct
3	Correct	1 ms	280 KB	Output is correct
4	Correct	1 ms	300 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	1 ms	280 KB	Output is correct
8	Correct	1 ms	280 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	0 ms	332 KB	Output is correct
14	Correct	1 ms	296 KB	Output is correct
15	Correct	1 ms	300 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	0 ms	332 KB	Output is correct
18	Correct	0 ms	332 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	0 ms	292 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	1 ms	288 KB	Output is correct
26	Correct	0 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	0 ms	300 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 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	292 KB	Output is correct
37	Correct	0 ms	296 KB	Output is correct

Subtask #2
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	300 KB	Output is correct
3	Correct	1 ms	280 KB	Output is correct
4	Correct	1 ms	300 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	1 ms	280 KB	Output is correct
8	Correct	1 ms	280 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	0 ms	332 KB	Output is correct
14	Correct	1 ms	296 KB	Output is correct
15	Correct	1 ms	300 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	0 ms	332 KB	Output is correct
18	Correct	0 ms	332 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	0 ms	292 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	1 ms	288 KB	Output is correct
26	Correct	0 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	0 ms	300 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 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	292 KB	Output is correct
37	Correct	0 ms	296 KB	Output is correct
38	Correct	6 ms	1712 KB	Output is correct
39	Correct	6 ms	1724 KB	Output is correct
40	Correct	5 ms	1760 KB	Output is correct
41	Correct	5 ms	1612 KB	Output is correct
42	Correct	4 ms	1716 KB	Output is correct
43	Correct	4 ms	1612 KB	Output is correct
44	Correct	7 ms	1708 KB	Output is correct
45	Correct	5 ms	1740 KB	Output is correct
46	Correct	5 ms	1748 KB	Output is correct
47	Correct	5 ms	1720 KB	Output is correct
48	Correct	5 ms	1584 KB	Output is correct
49	Correct	4 ms	1740 KB	Output is correct
50	Correct	5 ms	1748 KB	Output is correct
51	Correct	5 ms	1780 KB	Output is correct
52	Correct	4 ms	1740 KB	Output is correct
53	Correct	5 ms	1868 KB	Output is correct
54	Correct	3 ms	1716 KB	Output is correct
55	Correct	4 ms	1740 KB	Output is correct
56	Correct	2 ms	1748 KB	Output is correct
57	Correct	3 ms	1624 KB	Output is correct
58	Correct	2 ms	1740 KB	Output is correct
59	Correct	4 ms	1588 KB	Output is correct
60	Correct	4 ms	1720 KB	Output is correct
61	Correct	3 ms	1720 KB	Output is correct
62	Correct	3 ms	1712 KB	Output is correct
63	Correct	3 ms	1712 KB	Output is correct
64	Correct	3 ms	1740 KB	Output is correct
65	Correct	4 ms	1720 KB	Output is correct
66	Correct	4 ms	1740 KB	Output is correct
67	Correct	5 ms	1732 KB	Output is correct
68	Correct	4 ms	1704 KB	Output is correct
69	Correct	3 ms	1740 KB	Output is correct
70	Correct	4 ms	1720 KB	Output is correct
71	Correct	4 ms	1740 KB	Output is correct
72	Correct	2 ms	1740 KB	Output is correct
73	Correct	3 ms	1740 KB	Output is correct
74	Correct	2 ms	1740 KB	Output is correct

Subtask #3
76.0 / 76.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	300 KB	Output is correct
3	Correct	1 ms	280 KB	Output is correct
4	Correct	1 ms	300 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	1 ms	280 KB	Output is correct
8	Correct	1 ms	280 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	0 ms	332 KB	Output is correct
14	Correct	1 ms	296 KB	Output is correct
15	Correct	1 ms	300 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	0 ms	332 KB	Output is correct
18	Correct	0 ms	332 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	0 ms	292 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	1 ms	288 KB	Output is correct
26	Correct	0 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	0 ms	300 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 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	292 KB	Output is correct
37	Correct	0 ms	296 KB	Output is correct
38	Correct	6 ms	1712 KB	Output is correct
39	Correct	6 ms	1724 KB	Output is correct
40	Correct	5 ms	1760 KB	Output is correct
41	Correct	5 ms	1612 KB	Output is correct
42	Correct	4 ms	1716 KB	Output is correct
43	Correct	4 ms	1612 KB	Output is correct
44	Correct	7 ms	1708 KB	Output is correct
45	Correct	5 ms	1740 KB	Output is correct
46	Correct	5 ms	1748 KB	Output is correct
47	Correct	5 ms	1720 KB	Output is correct
48	Correct	5 ms	1584 KB	Output is correct
49	Correct	4 ms	1740 KB	Output is correct
50	Correct	5 ms	1748 KB	Output is correct
51	Correct	5 ms	1780 KB	Output is correct
52	Correct	4 ms	1740 KB	Output is correct
53	Correct	5 ms	1868 KB	Output is correct
54	Correct	3 ms	1716 KB	Output is correct
55	Correct	4 ms	1740 KB	Output is correct
56	Correct	2 ms	1748 KB	Output is correct
57	Correct	3 ms	1624 KB	Output is correct
58	Correct	2 ms	1740 KB	Output is correct
59	Correct	4 ms	1588 KB	Output is correct
60	Correct	4 ms	1720 KB	Output is correct
61	Correct	3 ms	1720 KB	Output is correct
62	Correct	3 ms	1712 KB	Output is correct
63	Correct	3 ms	1712 KB	Output is correct
64	Correct	3 ms	1740 KB	Output is correct
65	Correct	4 ms	1720 KB	Output is correct
66	Correct	4 ms	1740 KB	Output is correct
67	Correct	5 ms	1732 KB	Output is correct
68	Correct	4 ms	1704 KB	Output is correct
69	Correct	3 ms	1740 KB	Output is correct
70	Correct	4 ms	1720 KB	Output is correct
71	Correct	4 ms	1740 KB	Output is correct
72	Correct	2 ms	1740 KB	Output is correct
73	Correct	3 ms	1740 KB	Output is correct
74	Correct	2 ms	1740 KB	Output is correct
75	Correct	1225 ms	141408 KB	Output is correct
76	Correct	1348 ms	137544 KB	Output is correct
77	Correct	1142 ms	141720 KB	Output is correct
78	Correct	1188 ms	143836 KB	Output is correct
79	Correct	183 ms	144472 KB	Output is correct
80	Correct	282 ms	140248 KB	Output is correct
81	Correct	686 ms	142216 KB	Output is correct
82	Correct	869 ms	144144 KB	Output is correct
83	Correct	750 ms	148832 KB	Output is correct
84	Correct	785 ms	148392 KB	Output is correct
85	Correct	627 ms	143400 KB	Output is correct
86	Correct	346 ms	138580 KB	Output is correct
87	Correct	392 ms	136792 KB	Output is correct
88	Correct	559 ms	135900 KB	Output is correct
89	Correct	546 ms	143452 KB	Output is correct
90	Correct	351 ms	150056 KB	Output is correct
91	Correct	241 ms	138684 KB	Output is correct
92	Correct	260 ms	137680 KB	Output is correct
93	Correct	291 ms	143520 KB	Output is correct
94	Correct	225 ms	149804 KB	Output is correct
95	Correct	331 ms	150084 KB	Output is correct
96	Correct	393 ms	135484 KB	Output is correct
97	Correct	459 ms	150792 KB	Output is correct
98	Correct	460 ms	148624 KB	Output is correct
99	Correct	420 ms	148852 KB	Output is correct
100	Correct	429 ms	140484 KB	Output is correct
101	Correct	391 ms	140560 KB	Output is correct
102	Correct	681 ms	140224 KB	Output is correct
103	Correct	572 ms	138252 KB	Output is correct
104	Correct	698 ms	145804 KB	Output is correct
105	Correct	470 ms	145300 KB	Output is correct
106	Correct	531 ms	149060 KB	Output is correct
107	Correct	434 ms	143840 KB	Output is correct
108	Correct	1026 ms	143020 KB	Output is correct
109	Correct	866 ms	151472 KB	Output is correct
110	Correct	258 ms	140780 KB	Output is correct
111	Correct	348 ms	142256 KB	Output is correct
112	Correct	371 ms	135724 KB	Output is correct
113	Correct	203 ms	151640 KB	Output is correct

답안 #499305

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