답안 #128790

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
128790	2019-07-11T09:31:30 Z	win11905	Cake 3 (JOI19_cake3)	C++11	24 / 100	4000 ms	5912 KB

cake3

#include <bits/stdc++.h>
#define long long long
#define pii pair<int, int>
#define x first
#define y second
using namespace std;
 
const int N = 1e5+5;
 
int n, m;
vector<pii> vec;
 
int main() {
    scanf("%d %d", &n, &m);
    for(int i = 1, v, c; i <= n; ++i) {
        scanf("%d %d", &v, &c);
        vec.emplace_back(v, c);
    }
    sort(vec.begin(), vec.end(), [&](const pii &a, const pii &b) {
        return a.y < b.y;      
    });
    long ans = -1e18;
    for(int i = 0; i < n; ++i) {
        priority_queue<int, vector<int>, greater<int> > Q;
        long sum = 0;
        for(int j = i; j < n; ++j) {
            sum += vec[j].x, Q.emplace(vec[j].x);
            if(Q.size() > m) sum -= Q.top(), Q.pop();
            if(Q.size() == m) ans = max(ans, sum - 2ll * (vec[j].y - vec[i].y));
        }
    }
    printf("%lld\n", ans);
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:28:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(Q.size() > m) sum -= Q.top(), Q.pop();
                ~~~~~~~~~^~~
cake3.cpp:29:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(Q.size() == m) ans = max(ans, sum - 2ll * (vec[j].y - vec[i].y));
                ~~~~~~~~~^~~~
cake3.cpp:14:10: 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:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &v, &c);
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	252 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	420 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	424 KB	Output is correct
9	Correct	2 ms	380 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	252 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	256 KB	Output is correct
24	Correct	2 ms	256 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	256 KB	Output is correct
28	Correct	2 ms	256 KB	Output is correct
29	Correct	2 ms	256 KB	Output is correct
30	Correct	2 ms	348 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	256 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	2 ms	376 KB	Output is correct
35	Correct	2 ms	256 KB	Output is correct
36	Correct	2 ms	256 KB	Output is correct
37	Correct	2 ms	256 KB	Output is correct

Subtask #2
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	252 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	420 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	424 KB	Output is correct
9	Correct	2 ms	380 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	252 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	256 KB	Output is correct
24	Correct	2 ms	256 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	256 KB	Output is correct
28	Correct	2 ms	256 KB	Output is correct
29	Correct	2 ms	256 KB	Output is correct
30	Correct	2 ms	348 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	256 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	2 ms	376 KB	Output is correct
35	Correct	2 ms	256 KB	Output is correct
36	Correct	2 ms	256 KB	Output is correct
37	Correct	2 ms	256 KB	Output is correct
38	Correct	84 ms	424 KB	Output is correct
39	Correct	92 ms	428 KB	Output is correct
40	Correct	66 ms	436 KB	Output is correct
41	Correct	68 ms	432 KB	Output is correct
42	Correct	54 ms	376 KB	Output is correct
43	Correct	55 ms	420 KB	Output is correct
44	Correct	79 ms	420 KB	Output is correct
45	Correct	89 ms	424 KB	Output is correct
46	Correct	99 ms	376 KB	Output is correct
47	Correct	93 ms	504 KB	Output is correct
48	Correct	81 ms	420 KB	Output is correct
49	Correct	81 ms	376 KB	Output is correct
50	Correct	81 ms	476 KB	Output is correct
51	Correct	77 ms	504 KB	Output is correct
52	Correct	77 ms	504 KB	Output is correct
53	Correct	76 ms	376 KB	Output is correct
54	Correct	63 ms	424 KB	Output is correct
55	Correct	53 ms	432 KB	Output is correct
56	Correct	52 ms	452 KB	Output is correct
57	Correct	53 ms	376 KB	Output is correct
58	Correct	52 ms	420 KB	Output is correct
59	Correct	25 ms	376 KB	Output is correct
60	Correct	33 ms	376 KB	Output is correct
61	Correct	28 ms	424 KB	Output is correct
62	Correct	24 ms	380 KB	Output is correct
63	Correct	35 ms	376 KB	Output is correct
64	Correct	26 ms	424 KB	Output is correct
65	Correct	83 ms	420 KB	Output is correct
66	Correct	75 ms	376 KB	Output is correct
67	Correct	82 ms	376 KB	Output is correct
68	Correct	72 ms	376 KB	Output is correct
69	Correct	63 ms	376 KB	Output is correct
70	Correct	65 ms	424 KB	Output is correct
71	Correct	90 ms	408 KB	Output is correct
72	Correct	64 ms	376 KB	Output is correct
73	Correct	91 ms	376 KB	Output is correct
74	Correct	49 ms	376 KB	Output is correct

Subtask #3
0 / 76.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	252 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	420 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	424 KB	Output is correct
9	Correct	2 ms	380 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	252 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	256 KB	Output is correct
24	Correct	2 ms	256 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	256 KB	Output is correct
28	Correct	2 ms	256 KB	Output is correct
29	Correct	2 ms	256 KB	Output is correct
30	Correct	2 ms	348 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	256 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	2 ms	376 KB	Output is correct
35	Correct	2 ms	256 KB	Output is correct
36	Correct	2 ms	256 KB	Output is correct
37	Correct	2 ms	256 KB	Output is correct
38	Correct	84 ms	424 KB	Output is correct
39	Correct	92 ms	428 KB	Output is correct
40	Correct	66 ms	436 KB	Output is correct
41	Correct	68 ms	432 KB	Output is correct
42	Correct	54 ms	376 KB	Output is correct
43	Correct	55 ms	420 KB	Output is correct
44	Correct	79 ms	420 KB	Output is correct
45	Correct	89 ms	424 KB	Output is correct
46	Correct	99 ms	376 KB	Output is correct
47	Correct	93 ms	504 KB	Output is correct
48	Correct	81 ms	420 KB	Output is correct
49	Correct	81 ms	376 KB	Output is correct
50	Correct	81 ms	476 KB	Output is correct
51	Correct	77 ms	504 KB	Output is correct
52	Correct	77 ms	504 KB	Output is correct
53	Correct	76 ms	376 KB	Output is correct
54	Correct	63 ms	424 KB	Output is correct
55	Correct	53 ms	432 KB	Output is correct
56	Correct	52 ms	452 KB	Output is correct
57	Correct	53 ms	376 KB	Output is correct
58	Correct	52 ms	420 KB	Output is correct
59	Correct	25 ms	376 KB	Output is correct
60	Correct	33 ms	376 KB	Output is correct
61	Correct	28 ms	424 KB	Output is correct
62	Correct	24 ms	380 KB	Output is correct
63	Correct	35 ms	376 KB	Output is correct
64	Correct	26 ms	424 KB	Output is correct
65	Correct	83 ms	420 KB	Output is correct
66	Correct	75 ms	376 KB	Output is correct
67	Correct	82 ms	376 KB	Output is correct
68	Correct	72 ms	376 KB	Output is correct
69	Correct	63 ms	376 KB	Output is correct
70	Correct	65 ms	424 KB	Output is correct
71	Correct	90 ms	408 KB	Output is correct
72	Correct	64 ms	376 KB	Output is correct
73	Correct	91 ms	376 KB	Output is correct
74	Correct	49 ms	376 KB	Output is correct
75	Execution timed out	4067 ms	5912 KB	Time limit exceeded
76	Halted	0 ms	0 KB	-

답안 #128790

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