Submission #128159

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
128159	2019-07-10T13:22:42 Z	mahmoudbadawy	Cake 3 (JOI19_cake3)	C++17	24 / 100	320 ms	3320 KB

cake3

#include <bits/stdc++.h>
#define F first
#define S second

using namespace std;

const int N=100005;

pair<int,int> arr[N];
int n,m;

int main()
{
	scanf("%d %d",&n,&m);
	for(int i=0;i<n;i++)
		scanf("%d %d",&arr[i].S,&arr[i].F);
	sort(arr,arr+n);
	long long ans=-(1LL<<60);
	for(int i=0;i<n;i++)
	{
		multiset<int> ss;
		long long curv=0;
		for(int j=i;j<n;j++)
		{
			ss.insert(arr[j].S);
			curv+=arr[j].S;
			if(ss.size()>m)
			{
				curv-=(*ss.begin());
				ss.erase(ss.begin());
			}
			if(ss.size()==m)
			{
				//cout << i << " " << j << " " << curv << " " << arr[j].F-arr[i].F << endl;
				ans=max(ans,curv-2*(arr[j].F-arr[i].F));
			}
		}
	}
	printf("%lld\n",ans);
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:27:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(ss.size()>m)
       ~~~~~~~~~^~
cake3.cpp:32:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(ss.size()==m)
       ~~~~~~~~~^~~
cake3.cpp:14: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:16:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&arr[i].S,&arr[i].F);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	3 ms	376 KB	Output is correct
4	Correct	3 ms	256 KB	Output is correct
5	Correct	3 ms	376 KB	Output is correct
6	Correct	3 ms	256 KB	Output is correct
7	Correct	3 ms	376 KB	Output is correct
8	Correct	3 ms	256 KB	Output is correct
9	Correct	3 ms	376 KB	Output is correct
10	Correct	3 ms	376 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	3 ms	376 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	3 ms	376 KB	Output is correct
15	Correct	3 ms	376 KB	Output is correct
16	Correct	3 ms	376 KB	Output is correct
17	Correct	3 ms	400 KB	Output is correct
18	Correct	3 ms	376 KB	Output is correct
19	Correct	3 ms	376 KB	Output is correct
20	Correct	3 ms	376 KB	Output is correct
21	Correct	3 ms	376 KB	Output is correct
22	Correct	3 ms	376 KB	Output is correct
23	Correct	2 ms	256 KB	Output is correct
24	Correct	3 ms	256 KB	Output is correct
25	Correct	3 ms	376 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	3 ms	376 KB	Output is correct
28	Correct	3 ms	396 KB	Output is correct
29	Correct	1 ms	376 KB	Output is correct
30	Correct	3 ms	376 KB	Output is correct
31	Correct	3 ms	376 KB	Output is correct
32	Correct	3 ms	376 KB	Output is correct
33	Correct	3 ms	376 KB	Output is correct
34	Correct	3 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	3 ms	376 KB	Output is correct
4	Correct	3 ms	256 KB	Output is correct
5	Correct	3 ms	376 KB	Output is correct
6	Correct	3 ms	256 KB	Output is correct
7	Correct	3 ms	376 KB	Output is correct
8	Correct	3 ms	256 KB	Output is correct
9	Correct	3 ms	376 KB	Output is correct
10	Correct	3 ms	376 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	3 ms	376 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	3 ms	376 KB	Output is correct
15	Correct	3 ms	376 KB	Output is correct
16	Correct	3 ms	376 KB	Output is correct
17	Correct	3 ms	400 KB	Output is correct
18	Correct	3 ms	376 KB	Output is correct
19	Correct	3 ms	376 KB	Output is correct
20	Correct	3 ms	376 KB	Output is correct
21	Correct	3 ms	376 KB	Output is correct
22	Correct	3 ms	376 KB	Output is correct
23	Correct	2 ms	256 KB	Output is correct
24	Correct	3 ms	256 KB	Output is correct
25	Correct	3 ms	376 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	3 ms	376 KB	Output is correct
28	Correct	3 ms	396 KB	Output is correct
29	Correct	1 ms	376 KB	Output is correct
30	Correct	3 ms	376 KB	Output is correct
31	Correct	3 ms	376 KB	Output is correct
32	Correct	3 ms	376 KB	Output is correct
33	Correct	3 ms	376 KB	Output is correct
34	Correct	3 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	225 ms	508 KB	Output is correct
39	Correct	262 ms	376 KB	Output is correct
40	Correct	266 ms	376 KB	Output is correct
41	Correct	253 ms	468 KB	Output is correct
42	Correct	281 ms	504 KB	Output is correct
43	Correct	320 ms	504 KB	Output is correct
44	Correct	226 ms	504 KB	Output is correct
45	Correct	256 ms	472 KB	Output is correct
46	Correct	267 ms	476 KB	Output is correct
47	Correct	228 ms	504 KB	Output is correct
48	Correct	217 ms	504 KB	Output is correct
49	Correct	280 ms	376 KB	Output is correct
50	Correct	271 ms	376 KB	Output is correct
51	Correct	274 ms	504 KB	Output is correct
52	Correct	253 ms	508 KB	Output is correct
53	Correct	267 ms	376 KB	Output is correct
54	Correct	289 ms	508 KB	Output is correct
55	Correct	272 ms	376 KB	Output is correct
56	Correct	265 ms	504 KB	Output is correct
57	Correct	259 ms	464 KB	Output is correct
58	Correct	260 ms	472 KB	Output is correct
59	Correct	142 ms	504 KB	Output is correct
60	Correct	155 ms	504 KB	Output is correct
61	Correct	165 ms	472 KB	Output is correct
62	Correct	158 ms	500 KB	Output is correct
63	Correct	204 ms	376 KB	Output is correct
64	Correct	171 ms	376 KB	Output is correct
65	Correct	229 ms	504 KB	Output is correct
66	Correct	234 ms	432 KB	Output is correct
67	Correct	232 ms	504 KB	Output is correct
68	Correct	265 ms	380 KB	Output is correct
69	Correct	244 ms	376 KB	Output is correct
70	Correct	261 ms	456 KB	Output is correct
71	Correct	199 ms	376 KB	Output is correct
72	Correct	239 ms	376 KB	Output is correct
73	Correct	149 ms	464 KB	Output is correct
74	Correct	296 ms	508 KB	Output is correct

Subtask #3
0 / 76.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	3 ms	376 KB	Output is correct
4	Correct	3 ms	256 KB	Output is correct
5	Correct	3 ms	376 KB	Output is correct
6	Correct	3 ms	256 KB	Output is correct
7	Correct	3 ms	376 KB	Output is correct
8	Correct	3 ms	256 KB	Output is correct
9	Correct	3 ms	376 KB	Output is correct
10	Correct	3 ms	376 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	3 ms	376 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	3 ms	376 KB	Output is correct
15	Correct	3 ms	376 KB	Output is correct
16	Correct	3 ms	376 KB	Output is correct
17	Correct	3 ms	400 KB	Output is correct
18	Correct	3 ms	376 KB	Output is correct
19	Correct	3 ms	376 KB	Output is correct
20	Correct	3 ms	376 KB	Output is correct
21	Correct	3 ms	376 KB	Output is correct
22	Correct	3 ms	376 KB	Output is correct
23	Correct	2 ms	256 KB	Output is correct
24	Correct	3 ms	256 KB	Output is correct
25	Correct	3 ms	376 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	3 ms	376 KB	Output is correct
28	Correct	3 ms	396 KB	Output is correct
29	Correct	1 ms	376 KB	Output is correct
30	Correct	3 ms	376 KB	Output is correct
31	Correct	3 ms	376 KB	Output is correct
32	Correct	3 ms	376 KB	Output is correct
33	Correct	3 ms	376 KB	Output is correct
34	Correct	3 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	225 ms	508 KB	Output is correct
39	Correct	262 ms	376 KB	Output is correct
40	Correct	266 ms	376 KB	Output is correct
41	Correct	253 ms	468 KB	Output is correct
42	Correct	281 ms	504 KB	Output is correct
43	Correct	320 ms	504 KB	Output is correct
44	Correct	226 ms	504 KB	Output is correct
45	Correct	256 ms	472 KB	Output is correct
46	Correct	267 ms	476 KB	Output is correct
47	Correct	228 ms	504 KB	Output is correct
48	Correct	217 ms	504 KB	Output is correct
49	Correct	280 ms	376 KB	Output is correct
50	Correct	271 ms	376 KB	Output is correct
51	Correct	274 ms	504 KB	Output is correct
52	Correct	253 ms	508 KB	Output is correct
53	Correct	267 ms	376 KB	Output is correct
54	Correct	289 ms	508 KB	Output is correct
55	Correct	272 ms	376 KB	Output is correct
56	Correct	265 ms	504 KB	Output is correct
57	Correct	259 ms	464 KB	Output is correct
58	Correct	260 ms	472 KB	Output is correct
59	Correct	142 ms	504 KB	Output is correct
60	Correct	155 ms	504 KB	Output is correct
61	Correct	165 ms	472 KB	Output is correct
62	Correct	158 ms	500 KB	Output is correct
63	Correct	204 ms	376 KB	Output is correct
64	Correct	171 ms	376 KB	Output is correct
65	Correct	229 ms	504 KB	Output is correct
66	Correct	234 ms	432 KB	Output is correct
67	Correct	232 ms	504 KB	Output is correct
68	Correct	265 ms	380 KB	Output is correct
69	Correct	244 ms	376 KB	Output is correct
70	Correct	261 ms	456 KB	Output is correct
71	Correct	199 ms	376 KB	Output is correct
72	Correct	239 ms	376 KB	Output is correct
73	Correct	149 ms	464 KB	Output is correct
74	Correct	296 ms	508 KB	Output is correct
75	Execution timed out	40 ms	3320 KB	Time limit exceeded (wall clock)
76	Halted	0 ms	0 KB	-

Submission #128159

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 19.0 / 19.0

Subtask #3 0 / 76.0

Subtask #1
5.0 / 5.0

Subtask #2
19.0 / 19.0

Subtask #3
0 / 76.0