oj.uz

Submission #785669

# Submission time Handle Problem Language Result Execution time Memory
785669 2023-07-17T11:56:30 Z SamNguyen Cake 3 (JOI19_cake3) C++14
24 / 100
 4000 ms 8064 KB 
#include <bits/stdc++.h>
using namespace std;

#define INPFILE "cake3.inp"
#define OUTFILE "cake3.out"

using lli = long long;

template <class T1, class T2>
inline bool maximise(T1 &x, T2 y) {
    if (x < y) { x = y; return true; }
    return false;
}

template <class T1, class T2>
inline bool minimise(T1 &x, T2 y) {
    if (x > y) { x = y; return true; }
    return false;
}

const lli INF = 1e18;
const int MAX = 2e5 + 7;
int N, M;
pair<lli, lli> piece[MAX];

inline lli GET_V(int i) { return piece[i].second; }
inline lli GET_C(int i) { return piece[i].first; }

void input() {
    cin >> N >> M;
    for (int i = 1; i <= N; i++) {
        lli v, c; cin >> v >> c;
        piece[i] = make_pair(c, v);
    }

    sort(piece + 1, piece + N + 1);
}

void solve() {
    lli ans = -INF;

    for (int l = 1; l <= N; l++) {
        priority_queue<lli, vector<lli>, greater<lli>> pq;
        lli sum_v = 0;

        for (int r = l; r <= N; r++) {
            pq.push(GET_V(r));
            sum_v += GET_V(r);

            while (int(pq.size()) > M) {
                sum_v -= pq.top();
                pq.pop();
            }

            if (int(pq.size()) == M)
                maximise(ans, sum_v - 2 * (GET_C(r) - GET_C(l)));
        }
    }

    cout << ans;
}

int main(void) {
    if (fopen(INPFILE, "r")) {
        freopen(INPFILE, "r", stdin);
        freopen(OUTFILE, "w", stdout);
    }
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    input();
    solve();

    return 0;
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:65:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |         freopen(INPFILE, "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
cake3.cpp:66:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |         freopen(OUTFILE, "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
0 / 76.0

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