# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
526435 |
2022-02-14T18:35:02 Z |
erto |
Knapsack (NOI18_knapsack) |
C++17 |
|
3 ms |
1868 KB |
#include <bits/stdc++.h>
typedef long long int ll;
#define INF ll(1e9 + 7)
#define N (ll)2e2 + 5
using namespace std;
void solve(){
ll s, n, g,t;
bool bb=0;
cin >> s >> n;
ll v[n+1], w[n+1], k[n+1], dp[n+2][s+2];
memset(dp, 0, sizeof(dp));
for(int i=1; i<=n; i++){
cin >> v[i] >> w[i] >> k[i];
}
for(int i=1; i<=n; i++){
t=0;
for(int j=1; j<=s; j++){
dp[i][j] = dp[i-1][j];
g = j-w[i];
if(g>=0 && ((dp[i][g] + v[i]) > max(dp[i][j], dp[i-1][g] + v[i]))){
++t;
if(t <= k[i]){
dp[i][j] = dp[i][g] + v[i];
bb=1;
}
}
else{
t= 0;
}
if(g>=0 && !bb){
if(dp[i-1][g] + v[i] > max(dp[i][g], dp[i][j]))t++;
dp[i][j] = max(dp[i][g], max(dp[i-1][g] + v[i], dp[i][j]));
}
bb=0;
}
}
cout<<dp[n][s];
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int T = 1;
//cin>>T;
while (T--){
solve();
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
316 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
2 ms |
1868 KB |
Output is correct |
3 |
Correct |
3 ms |
1844 KB |
Output is correct |
4 |
Correct |
1 ms |
1868 KB |
Output is correct |
5 |
Correct |
1 ms |
1868 KB |
Output is correct |
6 |
Correct |
2 ms |
1868 KB |
Output is correct |
7 |
Incorrect |
2 ms |
1868 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
2 ms |
1868 KB |
Output is correct |
3 |
Correct |
3 ms |
1844 KB |
Output is correct |
4 |
Correct |
1 ms |
1868 KB |
Output is correct |
5 |
Correct |
1 ms |
1868 KB |
Output is correct |
6 |
Correct |
2 ms |
1868 KB |
Output is correct |
7 |
Incorrect |
2 ms |
1868 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
316 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
2 ms |
1868 KB |
Output is correct |
7 |
Correct |
3 ms |
1844 KB |
Output is correct |
8 |
Correct |
1 ms |
1868 KB |
Output is correct |
9 |
Correct |
1 ms |
1868 KB |
Output is correct |
10 |
Correct |
2 ms |
1868 KB |
Output is correct |
11 |
Incorrect |
2 ms |
1868 KB |
Output isn't correct |
12 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
316 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
2 ms |
1868 KB |
Output is correct |
7 |
Correct |
3 ms |
1844 KB |
Output is correct |
8 |
Correct |
1 ms |
1868 KB |
Output is correct |
9 |
Correct |
1 ms |
1868 KB |
Output is correct |
10 |
Correct |
2 ms |
1868 KB |
Output is correct |
11 |
Incorrect |
2 ms |
1868 KB |
Output isn't correct |
12 |
Halted |
0 ms |
0 KB |
- |