Submission #249443

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
249443	2020-07-15T04:12:20 Z	shenxy	Cake 3 (JOI19_cake3)	C++11	24 / 100	4000 ms	6556 KB

cake3

#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#include <functional>
using namespace std;
typedef pair<long long, long long> ii;
int main() {
	int N, M;
	scanf("%d %d", &N, &M);
	ii CV[N];
	long long ans, bans = -1000000000000000000LL;
	for (int i = 0; i < N; ++i) scanf("%lld %lld", &CV[i].second, &CV[i].first);
	sort(CV, CV + N);
	for (int i = 0; i <= N - M; ++i) {
		priority_queue< long long, vector<long long>, greater<long long> > pq;
		ans = 0;
		for (int j = i; j < i + M; ++j) pq.push(CV[j].second), ans += CV[j].second;
		bans = max(bans, ans + 2 * CV[i].first - 2 * CV[i + M - 1].first);
		for (int j = i + M; j < N; ++j) {
			if (CV[j].second > pq.top()) {
				ans += CV[j].second - pq.top();
				pq.pop();
				pq.push(CV[j].second);
			}
			bans = max(bans, ans + 2 * CV[i].first - 2 * CV[j].first);
		}
	}
	printf("%lld", bans);
	return 0;
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:10: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:13:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 0; i < N; ++i) scanf("%lld %lld", &CV[i].second, &CV[i].first);
                              ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	0 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	0 ms	256 KB	Output is correct
19	Correct	0 ms	256 KB	Output is correct
20	Correct	1 ms	256 KB	Output is correct
21	Correct	0 ms	256 KB	Output is correct
22	Correct	0 ms	256 KB	Output is correct
23	Correct	0 ms	256 KB	Output is correct
24	Correct	0 ms	256 KB	Output is correct
25	Correct	0 ms	256 KB	Output is correct
26	Correct	0 ms	256 KB	Output is correct
27	Correct	0 ms	256 KB	Output is correct
28	Correct	1 ms	256 KB	Output is correct
29	Correct	0 ms	256 KB	Output is correct
30	Correct	0 ms	256 KB	Output is correct
31	Correct	1 ms	256 KB	Output is correct
32	Correct	0 ms	256 KB	Output is correct
33	Correct	0 ms	256 KB	Output is correct
34	Correct	0 ms	256 KB	Output is correct
35	Correct	0 ms	256 KB	Output is correct
36	Correct	0 ms	256 KB	Output is correct
37	Correct	0 ms	256 KB	Output is correct

Subtask #2
19.0 / 19.0

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

Subtask #3
0 / 76.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	0 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	0 ms	256 KB	Output is correct
19	Correct	0 ms	256 KB	Output is correct
20	Correct	1 ms	256 KB	Output is correct
21	Correct	0 ms	256 KB	Output is correct
22	Correct	0 ms	256 KB	Output is correct
23	Correct	0 ms	256 KB	Output is correct
24	Correct	0 ms	256 KB	Output is correct
25	Correct	0 ms	256 KB	Output is correct
26	Correct	0 ms	256 KB	Output is correct
27	Correct	0 ms	256 KB	Output is correct
28	Correct	1 ms	256 KB	Output is correct
29	Correct	0 ms	256 KB	Output is correct
30	Correct	0 ms	256 KB	Output is correct
31	Correct	1 ms	256 KB	Output is correct
32	Correct	0 ms	256 KB	Output is correct
33	Correct	0 ms	256 KB	Output is correct
34	Correct	0 ms	256 KB	Output is correct
35	Correct	0 ms	256 KB	Output is correct
36	Correct	0 ms	256 KB	Output is correct
37	Correct	0 ms	256 KB	Output is correct
38	Correct	63 ms	384 KB	Output is correct
39	Correct	67 ms	384 KB	Output is correct
40	Correct	42 ms	384 KB	Output is correct
41	Correct	46 ms	384 KB	Output is correct
42	Correct	25 ms	384 KB	Output is correct
43	Correct	31 ms	384 KB	Output is correct
44	Correct	62 ms	384 KB	Output is correct
45	Correct	66 ms	384 KB	Output is correct
46	Correct	70 ms	384 KB	Output is correct
47	Correct	64 ms	384 KB	Output is correct
48	Correct	61 ms	384 KB	Output is correct
49	Correct	57 ms	384 KB	Output is correct
50	Correct	60 ms	384 KB	Output is correct
51	Correct	54 ms	384 KB	Output is correct
52	Correct	49 ms	420 KB	Output is correct
53	Correct	53 ms	384 KB	Output is correct
54	Correct	36 ms	384 KB	Output is correct
55	Correct	25 ms	384 KB	Output is correct
56	Correct	24 ms	384 KB	Output is correct
57	Correct	27 ms	384 KB	Output is correct
58	Correct	25 ms	384 KB	Output is correct
59	Correct	6 ms	384 KB	Output is correct
60	Correct	9 ms	384 KB	Output is correct
61	Correct	8 ms	384 KB	Output is correct
62	Correct	7 ms	384 KB	Output is correct
63	Correct	12 ms	384 KB	Output is correct
64	Correct	7 ms	384 KB	Output is correct
65	Correct	56 ms	384 KB	Output is correct
66	Correct	53 ms	384 KB	Output is correct
67	Correct	60 ms	384 KB	Output is correct
68	Correct	49 ms	384 KB	Output is correct
69	Correct	44 ms	384 KB	Output is correct
70	Correct	44 ms	384 KB	Output is correct
71	Correct	51 ms	384 KB	Output is correct
72	Correct	37 ms	504 KB	Output is correct
73	Correct	41 ms	384 KB	Output is correct
74	Correct	1 ms	384 KB	Output is correct
75	Execution timed out	4073 ms	6556 KB	Time limit exceeded
76	Halted	0 ms	0 KB	-

Submission #249443

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