oj.uz

Submission #249440

# Submission time Handle Problem Language Result Execution time Memory
249440 2020-07-15T04:03:13 Z cheeheng Cake 3 (JOI19_cake3) C++14
24 / 100
 4000 ms 4032 KB 
#include <bits/stdc++.h>
using namespace std;

typedef pair<long long, long long> ii;

ii CV[200005];

int N, M;

priority_queue<long long, vector<int>, greater<int> > pq;
long long sum = 0;
void init(){
    pq = priority_queue<long long, vector<int>, greater<int> >();
    sum = 0;
}

long long insert1(long long x){
    pq.push(x);
    sum += x;
    if(pq.size() > M){
        sum -= pq.top();
        pq.pop();
    }
}

long long getSum(){
    return sum;
}

int getSize(){
    return (int)pq.size();
}

int main(){
    scanf("%d%d", &N, &M);

    for(int i = 0; i < N; i ++){
        long long V, C;
        scanf("%lld%lld", &V, &C);
        CV[i] = ii(C, V);
    }

    sort(CV, CV+N);

    long long ans = -1LL << 62;
    for(int i = 0; i < N; i ++){
        init();
        for(int j = i; j < N; j ++){
            insert1(CV[j].second);
            if(getSize() == M){
                ans = max(ans, getSum() - 2*(CV[j].first - CV[i].first));
            }
        }
    }

    printf("%lld", ans);
    return 0;
}

Compilation message

cake3.cpp: In function 'long long int insert1(long long int)':
cake3.cpp:20:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(pq.size() > M){
        ~~~~~~~~~~^~~
cake3.cpp:24:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
cake3.cpp: In function 'int main()':
cake3.cpp:35: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:39:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld", &V, &C);
         ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 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 372 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 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 0 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 0 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 0 ms 256 KB Output is correct
37 Correct 1 ms 256 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 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 372 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 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 0 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 0 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 0 ms 256 KB Output is correct
37 Correct 1 ms 256 KB Output is correct
38 Correct 79 ms 504 KB Output is correct
39 Correct 87 ms 384 KB Output is correct
40 Correct 61 ms 384 KB Output is correct
41 Correct 76 ms 384 KB Output is correct
42 Correct 51 ms 408 KB Output is correct
43 Correct 51 ms 404 KB Output is correct
44 Correct 74 ms 384 KB Output is correct
45 Correct 85 ms 384 KB Output is correct
46 Correct 93 ms 384 KB Output is correct
47 Correct 91 ms 384 KB Output is correct
48 Correct 77 ms 400 KB Output is correct
49 Correct 77 ms 384 KB Output is correct
50 Correct 75 ms 384 KB Output is correct
51 Correct 73 ms 384 KB Output is correct
52 Correct 69 ms 504 KB Output is correct
53 Correct 77 ms 384 KB Output is correct
54 Correct 59 ms 384 KB Output is correct
55 Correct 51 ms 384 KB Output is correct
56 Correct 49 ms 384 KB Output is correct
57 Correct 49 ms 384 KB Output is correct
58 Correct 52 ms 504 KB Output is correct
59 Correct 26 ms 384 KB Output is correct
60 Correct 35 ms 384 KB Output is correct
61 Correct 29 ms 384 KB Output is correct
62 Correct 26 ms 384 KB Output is correct
63 Correct 32 ms 384 KB Output is correct
64 Correct 27 ms 384 KB Output is correct
65 Correct 88 ms 408 KB Output is correct
66 Correct 69 ms 384 KB Output is correct
67 Correct 77 ms 384 KB Output is correct
68 Correct 67 ms 384 KB Output is correct
69 Correct 59 ms 384 KB Output is correct
70 Correct 64 ms 504 KB Output is correct
71 Correct 81 ms 396 KB Output is correct
72 Correct 60 ms 384 KB Output is correct
73 Correct 51 ms 384 KB Output is correct
74 Correct 45 ms 384 KB Output is correct

Subtask #3
0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 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 372 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 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 0 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 0 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 0 ms 256 KB Output is correct
37 Correct 1 ms 256 KB Output is correct
38 Correct 79 ms 504 KB Output is correct
39 Correct 87 ms 384 KB Output is correct
40 Correct 61 ms 384 KB Output is correct
41 Correct 76 ms 384 KB Output is correct
42 Correct 51 ms 408 KB Output is correct
43 Correct 51 ms 404 KB Output is correct
44 Correct 74 ms 384 KB Output is correct
45 Correct 85 ms 384 KB Output is correct
46 Correct 93 ms 384 KB Output is correct
47 Correct 91 ms 384 KB Output is correct
48 Correct 77 ms 400 KB Output is correct
49 Correct 77 ms 384 KB Output is correct
50 Correct 75 ms 384 KB Output is correct
51 Correct 73 ms 384 KB Output is correct
52 Correct 69 ms 504 KB Output is correct
53 Correct 77 ms 384 KB Output is correct
54 Correct 59 ms 384 KB Output is correct
55 Correct 51 ms 384 KB Output is correct
56 Correct 49 ms 384 KB Output is correct
57 Correct 49 ms 384 KB Output is correct
58 Correct 52 ms 504 KB Output is correct
59 Correct 26 ms 384 KB Output is correct
60 Correct 35 ms 384 KB Output is correct
61 Correct 29 ms 384 KB Output is correct
62 Correct 26 ms 384 KB Output is correct
63 Correct 32 ms 384 KB Output is correct
64 Correct 27 ms 384 KB Output is correct
65 Correct 88 ms 408 KB Output is correct
66 Correct 69 ms 384 KB Output is correct
67 Correct 77 ms 384 KB Output is correct
68 Correct 67 ms 384 KB Output is correct
69 Correct 59 ms 384 KB Output is correct
70 Correct 64 ms 504 KB Output is correct
71 Correct 81 ms 396 KB Output is correct
72 Correct 60 ms 384 KB Output is correct
73 Correct 51 ms 384 KB Output is correct
74 Correct 45 ms 384 KB Output is correct
75 Execution timed out 4048 ms 4032 KB Time limit exceeded
76 Halted 0 ms 0 KB -