제출 #1258212

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1258212		alizhan	Knapsack (NOI18_knapsack)	C++20	73 / 100	1096 ms	18552 KiB

knapsack

 #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int mod = 1000000007;
#define endl '\n'
#define skip continue
#define uno first
#define duo second
#define YES cout<<"YES"<<'\n'
#define NO cout<<"NO"<<'\n'
#define GO while(tt--)
#define ins insert
#define pb push_back
#define all(x) x.begin(), x.end()
#define forest signed
#define Kaldun cin.tie(0)->sync_with_stdio(0)
#define int long long 
int bp(int a, int n) {
    if(n == 0) return 1;
    if(n % 2 == 1) return (bp(a, n-1) * 1LL * a) % mod;
    long long b = bp(a, n/2);
    return (b * b) % mod;
}
signed main() {
    //freopen("time.in", "r", stdin);
    //freopen("time.out", "w", stdout);
    Kaldun;
    int s,n;
    cin>>s>>n;
    vector<int>v,w;
    int va[n+1],wa[n+1],k[n+1];
    for(int i=1;i<=n;i++){
        cin>>va[i]>>wa[i]>>k[i];
        for(int p=1;k[i]>0;p<<=1){
            int t=min(p,k[i]);
            v.push_back(t*va[i]);
            w.push_back(t*wa[i]);
            k[i]-=t;
        }
    }
    
    
    int dp[s+1]{};
    for(int i=0;i<v.size();i++){
        for(int j=s;j>=w[i];j--){
            dp[j]=max(dp[j],dp[j-w[i]]+v[i]);
        }
    }
    cout<<dp[s]<<endl;
}

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