Submission #856566

# Submission time Handle Problem Language Result Execution time Memory
856566 2023-10-04T01:25:41 Z bob123 Knapsack (NOI18_knapsack) C++17
73 / 100
234 ms 262144 KB
/******************************************************************************

Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,
C#, OCaml, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.
Code, Compile, Run and Debug online from anywhere in world.

*******************************************************************************/
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

int main()
{
    ll s,n;
    cin>>s>>n;
    vector<ll>ws;
    vector<ll>vs;
    vector<ll>vk;
    vk.push_back(0);
    vs.push_back(0);
    ws.push_back(0);
    for(ll i=0;i<n;i++){
        ll v,w,k;
        cin>>v>>w>>k;
        ws.push_back(w);
        vs.push_back(v);
        vk.push_back(k);
    }
    vector<vector<ll>>dp(s+1,vector<ll>(n+1,0));
    for(ll j=1;j<=s;j++){
        for(int i=1;i<=n;i++){
            for(int k=1;k<=vk[i];k++){
                if(j>=(k*ws[i])){
                    dp[j][i]=max(dp[j][i],dp[j-(k*ws[i])][i-1]+(vs[i]*k));
                }else{
                    break;
                }
            }
            dp[j][i]=max(dp[j][i],dp[j][i-1]);
        }
    }
    cout<<dp[s][n]<<endl;
    return 0;
}
/*
20 3 
5000 15 1
100 1 3 
50 1 4 
*/
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 2 ms 1884 KB Output is correct
8 Correct 2 ms 1888 KB Output is correct
9 Correct 2 ms 1884 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 2 ms 1884 KB Output is correct
8 Correct 2 ms 1888 KB Output is correct
9 Correct 2 ms 1884 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 4 ms 1884 KB Output is correct
13 Correct 2 ms 1884 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Correct 1 ms 1884 KB Output is correct
16 Correct 2 ms 1884 KB Output is correct
17 Correct 2 ms 1884 KB Output is correct
18 Correct 2 ms 1884 KB Output is correct
19 Correct 2 ms 2016 KB Output is correct
20 Correct 2 ms 1900 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 2 ms 1884 KB Output is correct
12 Correct 2 ms 1888 KB Output is correct
13 Correct 2 ms 1884 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 1884 KB Output is correct
17 Correct 2 ms 1884 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 2 ms 1884 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 2 ms 1884 KB Output is correct
23 Correct 2 ms 2016 KB Output is correct
24 Correct 2 ms 1900 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 234 ms 1884 KB Output is correct
27 Correct 2 ms 1880 KB Output is correct
28 Correct 1 ms 1880 KB Output is correct
29 Correct 1 ms 1884 KB Output is correct
30 Correct 3 ms 1884 KB Output is correct
31 Correct 2 ms 2088 KB Output is correct
32 Correct 3 ms 1884 KB Output is correct
33 Correct 2 ms 1884 KB Output is correct
34 Correct 2 ms 1884 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 2 ms 1884 KB Output is correct
12 Correct 2 ms 1888 KB Output is correct
13 Correct 2 ms 1884 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 1884 KB Output is correct
17 Correct 2 ms 1884 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 2 ms 1884 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 2 ms 1884 KB Output is correct
23 Correct 2 ms 2016 KB Output is correct
24 Correct 2 ms 1900 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 234 ms 1884 KB Output is correct
27 Correct 2 ms 1880 KB Output is correct
28 Correct 1 ms 1880 KB Output is correct
29 Correct 1 ms 1884 KB Output is correct
30 Correct 3 ms 1884 KB Output is correct
31 Correct 2 ms 2088 KB Output is correct
32 Correct 3 ms 1884 KB Output is correct
33 Correct 2 ms 1884 KB Output is correct
34 Correct 2 ms 1884 KB Output is correct
35 Correct 50 ms 5196 KB Output is correct
36 Runtime error 135 ms 262144 KB Execution killed with signal 9
37 Halted 0 ms 0 KB -