제출 #488354

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
488354		ali22413836	Knapsack (NOI18_knapsack)	C++14	0 / 100	61 ms	158496 KiB

knapsack

#include <bits/stdc++.h>
#define  endl "\n"
using namespace std ;
typedef long long ll;
typedef long double ld ;
const int N=2e7;
const ll inf=1e18 ;
const ll mod = 1e9 + 7 ;
ll mypower(ll x, ll y){
    if(y == 0) return 1 ;
    if(y == 1) return x ;
    ll ret = mypower(x , y / 2);
    ret = (ret * ret) % mod;
    if(y % 2) ret = ( ret * x ) % mod ;
    return ret ;
}
ll to , n , dp[200009][101] ;
ll wa[200009] , v[200009] , k[200009] ;
int main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> to >> n ;
    for(int i = 1 ; i <= n  ; i++){
        cin >> v[i] >> wa[i] >> k[i] ;
    }
    memset(dp , 0 , sizeof dp) ;
    for(int j = 0 ; j <= n ; j++){
        for(int i = 1 ; i <= to ; i++){
            if(i - wa[j] >= 0)
                dp[i][j] = max(dp[i][j] , dp[i-wa[j]][j] + v[j]) ;
            else
                dp[i][j] = dp[i][j-1] ;
        }
    }
    cout << dp[to][n] << endl ;
    return 0 ;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 24
• Subtask 5: 0 / 27