제출 #1142922

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

knapsack

#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define ld long double
#define pb push_back
#define f first
#define s second 
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define pii pair<int,int> 
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define pdd pair<double,double>
#define mp make_pair   
#define AmirMakaM ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
// solve it
const ull SEED = chrono::steady_clock::now().time_since_epoch().count();
mt19937_64 mrand(SEED);
ull rnd(ull x = ~(0ull)) {return mrand() % x;} 
const ll MOD = 998244353;
const ll INF = 1e16+20;
const int inf = 1e9 + 7;
const ll N = 1e5+5;
const ll M = 2e3+1;
const double pi = 2*acos(0.0);
const int dx[] = {1,-1,0,0}, dy[] = {0,0,1,-1};

void solve() {
    int m, n;
    cin >> m >> n;
    int v[n+1], w[n+1], k[n+1];
    for(int i=1; i<=n; i++) cin >> v[i] >> w[i] >> k[i];

    pair<ll,ll> dp[m+1] = {};
    for(int i=1; i<=n; i++) {
        int mx = min(k[i],m/w[i]);
        for(int j=w[i]*mx; j>=w[i]; j-=w[i]) {
            for(int t=m; t>=j; t--) {
                if(t == j || dp[t-j].f!=0) {
                    if(dp[t-j].s != i && dp[t].f < dp[t-j].f + v[i]*(j/w[i])) {
                        dp[t] = {dp[t-j].f + v[i]*(j/w[i]),i};
                    }
                }
            }
        }
    }

    ll ans = 0;
    for(int i=1; i<=m; i++) ans = max(ans,dp[i].f);
    cout << ans;
}

int main() {
    AmirMakaM;
    srand(SEED);
    //freopen("bulk.in", "r", stdin);
    //freopen("bulk.out", "w", stdout);
    int ttt = 1;
    //cin >> ttt;
    while(ttt--) {
        solve();
    }
    return 0;
}

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