oj.uz

Submission #984661

# Submission time Handle Problem Language Result Execution time Memory
984661 2024-05-17T00:54:29 Z Sandarach151 Knapsack (NOI18_knapsack) C++17
0 / 100
 2 ms 1116 KB 
#include <bits/stdc++.h>
using namespace std;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int s, n;
    cin >> s >> n;
    int w[n], v[n], k[n];
    for(int i=0; i<n; i++){
        cin >> v[i] >> w[i] >> k[i];
    }
    int ans[n][s+1];
    for(int i=0; i<n; i++){
        for(int j=0; j<=s; j++){
            ans[i][j] = 0;
            for(int kk=0; kk<=k[i]; kk++){
                if(j-w[i]*kk>=0 && i>0) ans[i][j] = max(ans[i][j], ans[i-1][j-w[i]*kk]+v[i]*kk);
                else break;
            }
        }
    }
    cout << ans[n-1][s] << '\n';
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 2 ms 1116 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 2 ms 1116 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

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

Subtask #5
0 / 27.0

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