Submission #876157

# Submission time Handle Problem Language Result Execution time Memory
876157 2023-11-21T10:24:39 Z CBG6682 Knapsack (NOI18_knapsack) C++14
73 / 100
1000 ms 33588 KB
#include <bits/stdc++.h>
using namespace std;

const int MAXX = 1e5 + 5;
int s,n,dp[2001][MAXX];


struct Product{
    int v,w,k;

};
Product product[MAXX];

bool cmp(Product a, Product b){
    return a.w < b.w;
}

int main(){
    cin >> s >> n;
    for (int i = 0; i < n; i++) cin >> product[i].v >> product[i].w >> product[i].k;
    sort(product,product + n,cmp);
    for (int i = 1; i <= s; i++){
        for (int j = 0; j < n; j++){
            if (i >= product[j].w){
                int num = 1;
                while (num*product[j].w <= i && num <= product[j].k){
                    dp[i][j] = max(max(dp[i - num*product[j].w][j - 1] + product[j].v*num,dp[i][j]),max(dp[i - 1][j],dp[i][j - 1]));
                    num++;
                }
            }
        }
    }
    cout << dp[s][n - 1];
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 6 ms 5724 KB Output is correct
2 Correct 1 ms 1732 KB Output is correct
3 Correct 6 ms 6236 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 9 ms 10588 KB Output is correct
3 Correct 9 ms 10588 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 9 ms 10076 KB Output is correct
7 Correct 9 ms 10332 KB Output is correct
8 Correct 10 ms 10076 KB Output is correct
9 Correct 12 ms 10172 KB Output is correct
10 Correct 13 ms 10156 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 9 ms 10588 KB Output is correct
3 Correct 9 ms 10588 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 9 ms 10076 KB Output is correct
7 Correct 9 ms 10332 KB Output is correct
8 Correct 10 ms 10076 KB Output is correct
9 Correct 12 ms 10172 KB Output is correct
10 Correct 13 ms 10156 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 12 ms 10588 KB Output is correct
13 Correct 9 ms 10512 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 508 KB Output is correct
16 Correct 11 ms 10140 KB Output is correct
17 Correct 10 ms 10076 KB Output is correct
18 Correct 9 ms 10168 KB Output is correct
19 Correct 11 ms 10332 KB Output is correct
20 Correct 10 ms 10072 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 5724 KB Output is correct
2 Correct 1 ms 1732 KB Output is correct
3 Correct 6 ms 6236 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 9 ms 10588 KB Output is correct
7 Correct 9 ms 10588 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 9 ms 10076 KB Output is correct
11 Correct 9 ms 10332 KB Output is correct
12 Correct 10 ms 10076 KB Output is correct
13 Correct 12 ms 10172 KB Output is correct
14 Correct 13 ms 10156 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 12 ms 10588 KB Output is correct
17 Correct 9 ms 10512 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 508 KB Output is correct
20 Correct 11 ms 10140 KB Output is correct
21 Correct 10 ms 10076 KB Output is correct
22 Correct 9 ms 10168 KB Output is correct
23 Correct 11 ms 10332 KB Output is correct
24 Correct 10 ms 10072 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 464 ms 10528 KB Output is correct
27 Correct 9 ms 10592 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 13 ms 10324 KB Output is correct
31 Correct 9 ms 10076 KB Output is correct
32 Correct 9 ms 10076 KB Output is correct
33 Correct 9 ms 10076 KB Output is correct
34 Correct 10 ms 10076 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 5724 KB Output is correct
2 Correct 1 ms 1732 KB Output is correct
3 Correct 6 ms 6236 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 9 ms 10588 KB Output is correct
7 Correct 9 ms 10588 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 9 ms 10076 KB Output is correct
11 Correct 9 ms 10332 KB Output is correct
12 Correct 10 ms 10076 KB Output is correct
13 Correct 12 ms 10172 KB Output is correct
14 Correct 13 ms 10156 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 12 ms 10588 KB Output is correct
17 Correct 9 ms 10512 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 508 KB Output is correct
20 Correct 11 ms 10140 KB Output is correct
21 Correct 10 ms 10076 KB Output is correct
22 Correct 9 ms 10168 KB Output is correct
23 Correct 11 ms 10332 KB Output is correct
24 Correct 10 ms 10072 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 464 ms 10528 KB Output is correct
27 Correct 9 ms 10592 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 13 ms 10324 KB Output is correct
31 Correct 9 ms 10076 KB Output is correct
32 Correct 9 ms 10076 KB Output is correct
33 Correct 9 ms 10076 KB Output is correct
34 Correct 10 ms 10076 KB Output is correct
35 Correct 48 ms 3668 KB Output is correct
36 Execution timed out 1020 ms 33588 KB Time limit exceeded
37 Halted 0 ms 0 KB -