제출 #1272329

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1272329		sm.22	Knapsack (NOI18_knapsack)	C++20	100 / 100	66 ms	38480 KiB

knapsack

#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
 
#define watch(x)        cerr << "\n" << (#x) << " is " << (x) << "\n";
#define int             long long 
#define ffor(i, a, b)   for(int i=a;i<b;i++)
#define rfor(i, a, b)   for(int i=a-1;i>=b;i--)
#define all(v)          v.begin(), v.end()
#define rall(v)         v.rbegin(), v.rend()
#define pb              push_back
#define fi              first
#define se              second
#define pii             pair<int, int>
#define vi              vector<int> 
#define vvi             vector<vi> 
#define show(a)         for(auto e : a) {cout<<e<<" ";} cout<<"\n"; 
#define pr(a, b, c)     ffor(i, b, c) {cout<<a[i]<<" ";} cout<<"\n";
#define cerr            if(false)cerr
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int N = 2e3 + 10; 
int Mod = 1e9 + 7, INF = 1e18, BASE = 7, Block = 555;

vvi z[N]; 
        
void solve() {

        int n, s; cin>>s>>n; 
        
        ffor(i, 0, n) {
                int v, w, k; cin>>v>>w>>k; 
                z[w].pb({v, k});
        }

        ffor(i, 0, N) {
                sort(all(z[i])); reverse(all(z[i])); 
        }


        int dp[N][s + 1];
        memset(dp, 0, sizeof(dp)); 
        
        ffor(i, 1, N) {
                // go through all weights = i 
                ffor(c, 1, s + 1) {
                        
                        int cur = c - i, k = 0, used = 1, amt = 0; 
                        dp[i][c] = dp[i - 1][c]; 


                        while(cur >= 0 && k < (int)z[i].size()) {
                                amt += z[i][k][0];
                                dp[i][c] = max(dp[i][c], dp[i - 1][cur] + amt); 
                                cur -= i; 
                                used++; 
                                if(z[i][k][1] < used) {
                                        k++; used = 1; 
                                }
                        }
                }
        }
        
        int ans = 0; 
        ffor(i, 1, s + 1) ans = max(ans, dp[N - 1][i]); 
        cout<<ans<<"\n"; 
}

signed main() { 
 
        ios_base::sync_with_stdio(false); 
        cin.tie(NULL); 

        int t = 1; //cin>>t; 
 
        while(t--) solve();
 
        return 0; 
}

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