oj.uz

Submission #1113255

# Submission time Handle Problem Language Result Execution time Memory
1113255 2024-11-16T08:58:53 Z Yang8on Knapsack (NOI18_knapsack) C++17
37 / 100
 5 ms 564 KB 
#include <bits/stdc++.h>
#define file "main"
#define maxn (int) 3e6 + 5
#define ll long long
#define pii pair<ll, int>
#define fi(i, a, b) for(int i = a; i <= b; i ++)
#define fid(i, a, b) for(int i = a; i >= b; i --)

using namespace std;

int S, n, N;
pii a[maxn];
ll dp[2005];

int main() {
//    freopen(file".inp", "r", stdin);

    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> S >> n;
    fi(i, 1, n) {
        int v, w, k; cin >> v >> w >> k;
        for(int tmp = 1; tmp <= k; tmp *= 2) {
            int nw_v = v * tmp, nw_w = w * tmp;
            if(nw_w <= S) a[++N] = { nw_v, nw_w };
            k -= tmp;
        }
        if(k) {
            int nw_v = v * k, nw_w = w * k;
            if(nw_w <= S) a[++N] = { nw_v, nw_w };
        }
    }

    memset(dp, -0x3f, sizeof dp);
    dp[0] = 0;

    fi(i, 1, N) {
        fid(j, S, a[i].second) {
            dp[j] = max(dp[j], dp[j - a[i].second] + a[i].first);
        }
    }

    cout << *max_element(dp + 0, dp + S + 1);

    return 0;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Runtime error 5 ms 564 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 504 KB Output is correct
10 Correct 1 ms 336 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 504 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 508 KB Output is correct

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Runtime error 5 ms 564 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Runtime error 5 ms 564 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -