답안 #140119

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
140119	2019-08-02T06:11:07 Z	mohammedehab2002	Cake 3 (JOI19_cake3)	C++11	100 / 100	2098 ms	151800 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:61:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~
cake3.cpp:63:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&arr[i].second,&arr[i].first);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	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	504 KB	Output is correct
7	Correct	2 ms	504 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	504 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	380 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	2 ms	504 KB	Output is correct
18	Correct	2 ms	504 KB	Output is correct
19	Correct	2 ms	368 KB	Output is correct
20	Correct	2 ms	504 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	504 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	504 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	504 KB	Output is correct
31	Correct	2 ms	420 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	3 ms	376 KB	Output is correct
36	Correct	3 ms	376 KB	Output is correct
37	Correct	3 ms	376 KB	Output is correct

Subtask #2
19.0 / 19.0

#	결과	실행 시간	메모리	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	504 KB	Output is correct
7	Correct	2 ms	504 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	504 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	380 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	2 ms	504 KB	Output is correct
18	Correct	2 ms	504 KB	Output is correct
19	Correct	2 ms	368 KB	Output is correct
20	Correct	2 ms	504 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	504 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	504 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	504 KB	Output is correct
31	Correct	2 ms	420 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	3 ms	376 KB	Output is correct
36	Correct	3 ms	376 KB	Output is correct
37	Correct	3 ms	376 KB	Output is correct
38	Correct	10 ms	1784 KB	Output is correct
39	Correct	10 ms	1912 KB	Output is correct
40	Correct	8 ms	1784 KB	Output is correct
41	Correct	8 ms	1784 KB	Output is correct
42	Correct	7 ms	1784 KB	Output is correct
43	Correct	7 ms	1656 KB	Output is correct
44	Correct	9 ms	1784 KB	Output is correct
45	Correct	9 ms	1784 KB	Output is correct
46	Correct	10 ms	1912 KB	Output is correct
47	Correct	9 ms	1784 KB	Output is correct
48	Correct	9 ms	1660 KB	Output is correct
49	Correct	8 ms	1912 KB	Output is correct
50	Correct	8 ms	1784 KB	Output is correct
51	Correct	8 ms	1784 KB	Output is correct
52	Correct	7 ms	1784 KB	Output is correct
53	Correct	7 ms	1784 KB	Output is correct
54	Correct	6 ms	1912 KB	Output is correct
55	Correct	5 ms	1784 KB	Output is correct
56	Correct	5 ms	1784 KB	Output is correct
57	Correct	5 ms	1784 KB	Output is correct
58	Correct	5 ms	1656 KB	Output is correct
59	Correct	6 ms	1784 KB	Output is correct
60	Correct	6 ms	1784 KB	Output is correct
61	Correct	6 ms	1912 KB	Output is correct
62	Correct	6 ms	1912 KB	Output is correct
63	Correct	6 ms	1784 KB	Output is correct
64	Correct	6 ms	1920 KB	Output is correct
65	Correct	8 ms	1784 KB	Output is correct
66	Correct	8 ms	1912 KB	Output is correct
67	Correct	8 ms	1784 KB	Output is correct
68	Correct	7 ms	1784 KB	Output is correct
69	Correct	8 ms	1784 KB	Output is correct
70	Correct	8 ms	1784 KB	Output is correct
71	Correct	7 ms	1912 KB	Output is correct
72	Correct	5 ms	1784 KB	Output is correct
73	Correct	6 ms	1784 KB	Output is correct
74	Correct	4 ms	1912 KB	Output is correct

Subtask #3
76.0 / 76.0

#	결과	실행 시간	메모리	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	504 KB	Output is correct
7	Correct	2 ms	504 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	504 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	380 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	2 ms	504 KB	Output is correct
18	Correct	2 ms	504 KB	Output is correct
19	Correct	2 ms	368 KB	Output is correct
20	Correct	2 ms	504 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	504 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	504 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	504 KB	Output is correct
31	Correct	2 ms	420 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	3 ms	376 KB	Output is correct
36	Correct	3 ms	376 KB	Output is correct
37	Correct	3 ms	376 KB	Output is correct
38	Correct	10 ms	1784 KB	Output is correct
39	Correct	10 ms	1912 KB	Output is correct
40	Correct	8 ms	1784 KB	Output is correct
41	Correct	8 ms	1784 KB	Output is correct
42	Correct	7 ms	1784 KB	Output is correct
43	Correct	7 ms	1656 KB	Output is correct
44	Correct	9 ms	1784 KB	Output is correct
45	Correct	9 ms	1784 KB	Output is correct
46	Correct	10 ms	1912 KB	Output is correct
47	Correct	9 ms	1784 KB	Output is correct
48	Correct	9 ms	1660 KB	Output is correct
49	Correct	8 ms	1912 KB	Output is correct
50	Correct	8 ms	1784 KB	Output is correct
51	Correct	8 ms	1784 KB	Output is correct
52	Correct	7 ms	1784 KB	Output is correct
53	Correct	7 ms	1784 KB	Output is correct
54	Correct	6 ms	1912 KB	Output is correct
55	Correct	5 ms	1784 KB	Output is correct
56	Correct	5 ms	1784 KB	Output is correct
57	Correct	5 ms	1784 KB	Output is correct
58	Correct	5 ms	1656 KB	Output is correct
59	Correct	6 ms	1784 KB	Output is correct
60	Correct	6 ms	1784 KB	Output is correct
61	Correct	6 ms	1912 KB	Output is correct
62	Correct	6 ms	1912 KB	Output is correct
63	Correct	6 ms	1784 KB	Output is correct
64	Correct	6 ms	1920 KB	Output is correct
65	Correct	8 ms	1784 KB	Output is correct
66	Correct	8 ms	1912 KB	Output is correct
67	Correct	8 ms	1784 KB	Output is correct
68	Correct	7 ms	1784 KB	Output is correct
69	Correct	8 ms	1784 KB	Output is correct
70	Correct	8 ms	1784 KB	Output is correct
71	Correct	7 ms	1912 KB	Output is correct
72	Correct	5 ms	1784 KB	Output is correct
73	Correct	6 ms	1784 KB	Output is correct
74	Correct	4 ms	1912 KB	Output is correct
75	Correct	1904 ms	139432 KB	Output is correct
76	Correct	2098 ms	135596 KB	Output is correct
77	Correct	1792 ms	139640 KB	Output is correct
78	Correct	2001 ms	141708 KB	Output is correct
79	Correct	309 ms	142220 KB	Output is correct
80	Correct	469 ms	138180 KB	Output is correct
81	Correct	862 ms	140792 KB	Output is correct
82	Correct	1201 ms	142716 KB	Output is correct
83	Correct	1043 ms	147408 KB	Output is correct
84	Correct	1099 ms	147096 KB	Output is correct
85	Correct	903 ms	142004 KB	Output is correct
86	Correct	549 ms	137308 KB	Output is correct
87	Correct	532 ms	135672 KB	Output is correct
88	Correct	799 ms	134496 KB	Output is correct
89	Correct	754 ms	142048 KB	Output is correct
90	Correct	533 ms	148344 KB	Output is correct
91	Correct	381 ms	137592 KB	Output is correct
92	Correct	391 ms	136540 KB	Output is correct
93	Correct	447 ms	142300 KB	Output is correct
94	Correct	351 ms	148456 KB	Output is correct
95	Correct	503 ms	148856 KB	Output is correct
96	Correct	546 ms	134264 KB	Output is correct
97	Correct	687 ms	149240 KB	Output is correct
98	Correct	665 ms	147108 KB	Output is correct
99	Correct	609 ms	147320 KB	Output is correct
100	Correct	516 ms	139128 KB	Output is correct
101	Correct	523 ms	139244 KB	Output is correct
102	Correct	932 ms	138872 KB	Output is correct
103	Correct	822 ms	136780 KB	Output is correct
104	Correct	1041 ms	144272 KB	Output is correct
105	Correct	686 ms	143864 KB	Output is correct
106	Correct	720 ms	147540 KB	Output is correct
107	Correct	621 ms	142320 KB	Output is correct
108	Correct	1548 ms	141448 KB	Output is correct
109	Correct	1286 ms	149940 KB	Output is correct
110	Correct	382 ms	139820 KB	Output is correct
111	Correct	506 ms	141176 KB	Output is correct
112	Correct	513 ms	134736 KB	Output is correct
113	Correct	318 ms	151800 KB	Output is correct

답안 #140119

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