oj.uz

Submission #767755

# Submission time Handle Problem Language Result Execution time Memory
767755 2023-06-27T06:44:53 Z drdilyor Akcija (COCI21_akcija) C++17
30 / 110
 87 ms 63188 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

signed main() {
    cin.tie(0)->sync_with_stdio(0);

    int n, k;
    cin >> n >> k;
    vector<pair<int,int>> arr(n);
    for (auto&[d, cost] : arr) cin >> cost >> d;
    // assert(k == 1);

    sort(arr.begin(), arr.end());

    vector memo(n, vector(n+1, pair{-1, 0ll}));
    auto dp = [&](auto& dp, int i, int t)->pair<int,ll> {
        if (i < 0 || t <= 0) return {0, 0};
        if (memo[i][t].first != -1) return memo[i][t];
        auto res = dp(dp, i-1, t);
        if (arr[i].first >= t) {
            auto [cnt, cost] = dp(dp, i-1, t-1);
            cnt++;
            cost -= arr[i].second;
            res = max(res, {cnt, cost});
        }
        return memo[i][t] = res;
    };

    pair<int,ll> res = {0, 0};
    for (int i = 1; i <= n; i++) {
        res = max(res, dp(dp, n-1, i));
    }

    cout << res.first << ' ' << -res.second << endl;
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 58196 KB Output is correct
2 Correct 87 ms 63180 KB Output is correct
3 Correct 75 ms 53372 KB Output is correct
4 Correct 65 ms 52052 KB Output is correct
5 Correct 84 ms 62004 KB Output is correct
6 Correct 63 ms 51880 KB Output is correct
7 Correct 68 ms 62556 KB Output is correct
8 Correct 65 ms 53832 KB Output is correct
9 Correct 54 ms 51300 KB Output is correct
10 Correct 74 ms 55500 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 58196 KB Output is correct
2 Correct 87 ms 63180 KB Output is correct
3 Correct 75 ms 53372 KB Output is correct
4 Correct 65 ms 52052 KB Output is correct
5 Correct 84 ms 62004 KB Output is correct
6 Correct 63 ms 51880 KB Output is correct
7 Correct 68 ms 62556 KB Output is correct
8 Correct 65 ms 53832 KB Output is correct
9 Correct 54 ms 51300 KB Output is correct
10 Correct 74 ms 55500 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 79 ms 58208 KB Output is correct
15 Correct 83 ms 63188 KB Output is correct
16 Correct 74 ms 53332 KB Output is correct
17 Correct 67 ms 51948 KB Output is correct
18 Correct 84 ms 61992 KB Output is correct
19 Correct 63 ms 51896 KB Output is correct
20 Correct 69 ms 62576 KB Output is correct
21 Correct 65 ms 53848 KB Output is correct
22 Correct 55 ms 51284 KB Output is correct
23 Correct 72 ms 55464 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 340 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 78 ms 58196 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 58196 KB Output is correct
2 Correct 87 ms 63180 KB Output is correct
3 Correct 75 ms 53372 KB Output is correct
4 Correct 65 ms 52052 KB Output is correct
5 Correct 84 ms 62004 KB Output is correct
6 Correct 63 ms 51880 KB Output is correct
7 Correct 68 ms 62556 KB Output is correct
8 Correct 65 ms 53832 KB Output is correct
9 Correct 54 ms 51300 KB Output is correct
10 Correct 74 ms 55500 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 79 ms 58208 KB Output is correct
15 Correct 83 ms 63188 KB Output is correct
16 Correct 74 ms 53332 KB Output is correct
17 Correct 67 ms 51948 KB Output is correct
18 Correct 84 ms 61992 KB Output is correct
19 Correct 63 ms 51896 KB Output is correct
20 Correct 69 ms 62576 KB Output is correct
21 Correct 65 ms 53848 KB Output is correct
22 Correct 55 ms 51284 KB Output is correct
23 Correct 72 ms 55464 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Incorrect 78 ms 58196 KB Output isn't correct
28 Halted 0 ms 0 KB -