# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
592820 |
2022-07-09T16:12:29 Z |
mjay |
Knapsack (NOI18_knapsack) |
C++11 |
|
123 ms |
262144 KB |
#include <bits/stdc++.h>
using namespace std;
int main(){
int S, N;
cin >> S >> N;
vector<int> values, weights;
for(int i=0; i<N; i++){
int value, weight, freq;
cin >> value >> weight >> freq;
while(freq--){
values.push_back(value);
weights.push_back(weight);
}
}
N = weights.size();
vector<vector<int>> dp(N+1, vector<int>(S+1, 0));
for(int i=1; i<=N; i++){
for(int j=0; j<=S; j++){
dp[i][j] = dp[i-1][j];
int left = j - weights[i-1];
if(left >= 0)
dp[i][j] = max(dp[i][j], dp[i-1][left] + values[i-1]);
}
}
cout << dp[N][S] << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
123 ms |
262144 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
980 KB |
Output is correct |
3 |
Correct |
1 ms |
1072 KB |
Output is correct |
4 |
Correct |
1 ms |
1068 KB |
Output is correct |
5 |
Correct |
1 ms |
980 KB |
Output is correct |
6 |
Correct |
1 ms |
980 KB |
Output is correct |
7 |
Correct |
1 ms |
980 KB |
Output is correct |
8 |
Correct |
1 ms |
980 KB |
Output is correct |
9 |
Correct |
2 ms |
980 KB |
Output is correct |
10 |
Correct |
1 ms |
980 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
980 KB |
Output is correct |
3 |
Correct |
1 ms |
1072 KB |
Output is correct |
4 |
Correct |
1 ms |
1068 KB |
Output is correct |
5 |
Correct |
1 ms |
980 KB |
Output is correct |
6 |
Correct |
1 ms |
980 KB |
Output is correct |
7 |
Correct |
1 ms |
980 KB |
Output is correct |
8 |
Correct |
1 ms |
980 KB |
Output is correct |
9 |
Correct |
2 ms |
980 KB |
Output is correct |
10 |
Correct |
1 ms |
980 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
7 ms |
7892 KB |
Output is correct |
13 |
Correct |
1 ms |
980 KB |
Output is correct |
14 |
Correct |
1 ms |
980 KB |
Output is correct |
15 |
Correct |
4 ms |
4564 KB |
Output is correct |
16 |
Correct |
4 ms |
4436 KB |
Output is correct |
17 |
Correct |
2 ms |
980 KB |
Output is correct |
18 |
Correct |
2 ms |
1364 KB |
Output is correct |
19 |
Correct |
3 ms |
1876 KB |
Output is correct |
20 |
Correct |
3 ms |
1748 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
123 ms |
262144 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
123 ms |
262144 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |