답안 #263417

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
263417	2020-08-13T16:47:37 Z	mjkocijan	Cake 3 (JOI19_cake3)	C++14	24 / 100	240 ms	632 KB

cake3

#include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> ii;
#define MAXN 2020
#define INF 1001001001001001001LL

int n, m;
ll _v[MAXN], c[MAXN];
vector<ii> v;
multiset<ll> s;
ll reza = -INF;

int main()
{
	scanf("%d%d", &n, &m);
	for (int i = 0; i < n; i++) {
		scanf("%lld%lld", &_v[i], &c[i]);
		v.pb({c[i], _v[i]});
	}
	sort(v.begin(), v.end());
	for (int i = 0; i <= n - m; i++) {
		s.clear();
		ll suma = 0;
		for (int j = i; j < i + m; j++) {
			s.insert(v[j].Y);
			suma += v[j].Y;
		}
		//cout << suma - (v[i + m - 1].X - v[i].X) * 2LL<<endl;
		reza = max(reza, suma - (v[i + m - 1].X - v[i].X) * 2LL);
		for (int j = i + m; j < n; j++) {
			if ((*s.begin()) < v[j].Y) {
				//cout << (*s.begin()) <<'.'<<v[j].Y<<endl;
				suma += v[j].Y - (*s.begin());
				s.erase(s.begin());
				s.insert(v[j].Y);
			}
			//cout << suma - (v[j].X - v[i].X) * 2LL << endl;
			reza = max(reza, suma - (v[j].X - v[i].X) * 2LL);
		}
	}
	printf("%lld\n", reza);
  return 0;
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:19:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   19 |  scanf("%d%d", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~
cake3.cpp:21:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   21 |   scanf("%lld%lld", &_v[i], &c[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	1 ms	384 KB	Output is correct
32	Correct	1 ms	384 KB	Output is correct
33	Correct	1 ms	384 KB	Output is correct
34	Correct	1 ms	384 KB	Output is correct
35	Correct	1 ms	512 KB	Output is correct
36	Correct	1 ms	384 KB	Output is correct
37	Correct	1 ms	372 KB	Output is correct
38	Correct	190 ms	384 KB	Output is correct
39	Correct	212 ms	504 KB	Output is correct
40	Correct	180 ms	516 KB	Output is correct
41	Correct	181 ms	504 KB	Output is correct
42	Correct	129 ms	632 KB	Output is correct
43	Correct	146 ms	512 KB	Output is correct
44	Correct	185 ms	384 KB	Output is correct
45	Correct	209 ms	508 KB	Output is correct
46	Correct	219 ms	384 KB	Output is correct
47	Correct	183 ms	384 KB	Output is correct
48	Correct	175 ms	504 KB	Output is correct
49	Correct	211 ms	512 KB	Output is correct
50	Correct	212 ms	504 KB	Output is correct
51	Correct	203 ms	632 KB	Output is correct
52	Correct	186 ms	504 KB	Output is correct
53	Correct	203 ms	504 KB	Output is correct
54	Correct	173 ms	512 KB	Output is correct
55	Correct	127 ms	512 KB	Output is correct
56	Correct	126 ms	524 KB	Output is correct
57	Correct	138 ms	512 KB	Output is correct
58	Correct	131 ms	512 KB	Output is correct
59	Correct	73 ms	384 KB	Output is correct
60	Correct	76 ms	384 KB	Output is correct
61	Correct	79 ms	504 KB	Output is correct
62	Correct	92 ms	512 KB	Output is correct
63	Correct	107 ms	512 KB	Output is correct
64	Correct	98 ms	512 KB	Output is correct
65	Correct	194 ms	492 KB	Output is correct
66	Correct	177 ms	384 KB	Output is correct
67	Correct	180 ms	384 KB	Output is correct
68	Correct	240 ms	384 KB	Output is correct
69	Correct	176 ms	384 KB	Output is correct
70	Correct	180 ms	500 KB	Output is correct
71	Correct	153 ms	504 KB	Output is correct
72	Correct	166 ms	504 KB	Output is correct
73	Correct	165 ms	504 KB	Output is correct
74	Correct	2 ms	512 KB	Output is correct

Subtask #3
0 / 76.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	1 ms	384 KB	Output is correct
32	Correct	1 ms	384 KB	Output is correct
33	Correct	1 ms	384 KB	Output is correct
34	Correct	1 ms	384 KB	Output is correct
35	Correct	1 ms	512 KB	Output is correct
36	Correct	1 ms	384 KB	Output is correct
37	Correct	1 ms	372 KB	Output is correct
38	Correct	190 ms	384 KB	Output is correct
39	Correct	212 ms	504 KB	Output is correct
40	Correct	180 ms	516 KB	Output is correct
41	Correct	181 ms	504 KB	Output is correct
42	Correct	129 ms	632 KB	Output is correct
43	Correct	146 ms	512 KB	Output is correct
44	Correct	185 ms	384 KB	Output is correct
45	Correct	209 ms	508 KB	Output is correct
46	Correct	219 ms	384 KB	Output is correct
47	Correct	183 ms	384 KB	Output is correct
48	Correct	175 ms	504 KB	Output is correct
49	Correct	211 ms	512 KB	Output is correct
50	Correct	212 ms	504 KB	Output is correct
51	Correct	203 ms	632 KB	Output is correct
52	Correct	186 ms	504 KB	Output is correct
53	Correct	203 ms	504 KB	Output is correct
54	Correct	173 ms	512 KB	Output is correct
55	Correct	127 ms	512 KB	Output is correct
56	Correct	126 ms	524 KB	Output is correct
57	Correct	138 ms	512 KB	Output is correct
58	Correct	131 ms	512 KB	Output is correct
59	Correct	73 ms	384 KB	Output is correct
60	Correct	76 ms	384 KB	Output is correct
61	Correct	79 ms	504 KB	Output is correct
62	Correct	92 ms	512 KB	Output is correct
63	Correct	107 ms	512 KB	Output is correct
64	Correct	98 ms	512 KB	Output is correct
65	Correct	194 ms	492 KB	Output is correct
66	Correct	177 ms	384 KB	Output is correct
67	Correct	180 ms	384 KB	Output is correct
68	Correct	240 ms	384 KB	Output is correct
69	Correct	176 ms	384 KB	Output is correct
70	Correct	180 ms	500 KB	Output is correct
71	Correct	153 ms	504 KB	Output is correct
72	Correct	166 ms	504 KB	Output is correct
73	Correct	165 ms	504 KB	Output is correct
74	Correct	2 ms	512 KB	Output is correct
75	Incorrect	2 ms	512 KB	Output isn't correct
76	Halted	0 ms	0 KB	-

답안 #263417

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