oj.uz

Submission #526461

# Submission time Handle Problem Language Result Execution time Memory
526461 2022-02-14T20:08:19 Z erto Knapsack (NOI18_knapsack) C++17
12 / 100
 2 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, t2;
    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;
        t2 = -1;
        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]))){
                if(dp[i][g] != t2)++t;
                if(t <= k[i]){
                    dp[i][j] = dp[i][g] + v[i];
                    t2=dp[i][g];
                    bb=1;
                }
 
            }
            else{
                t= 0;
            }
            if(g>=0 && !bb){
                if(dp[i-1][g] + v[i] > max(dp[i][g], dp[i][j]))t=1;
                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();
    }
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 332 KB Output is correct

Subtask #2
0 / 17.0

# 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 2 ms 1740 KB Output is correct
4 Correct 1 ms 1868 KB Output is correct
5 Correct 1 ms 1868 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct
7 Incorrect 1 ms 1868 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 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 2 ms 1740 KB Output is correct
4 Correct 1 ms 1868 KB Output is correct
5 Correct 1 ms 1868 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct
7 Incorrect 1 ms 1868 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 2 ms 1868 KB Output is correct
7 Correct 2 ms 1740 KB Output is correct
8 Correct 1 ms 1868 KB Output is correct
9 Correct 1 ms 1868 KB Output is correct
10 Correct 1 ms 1868 KB Output is correct
11 Incorrect 1 ms 1868 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 2 ms 1868 KB Output is correct
7 Correct 2 ms 1740 KB Output is correct
8 Correct 1 ms 1868 KB Output is correct
9 Correct 1 ms 1868 KB Output is correct
10 Correct 1 ms 1868 KB Output is correct
11 Incorrect 1 ms 1868 KB Output isn't correct
12 Halted 0 ms 0 KB -