제출 #1326046

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1326046		c0d3xx_	Knapsack (NOI18_knapsack)	C++20	73 / 100	1094 ms	424 KiB

knapsack

#include <bits/stdc++.h>
#define maxn 2003
#define pii pair<ll, ll> 
#define tpe tuple<int, int, int>
#define MOD 1000000007
#define ll long long
#define lim 44725
#define file "mind"
#define base 131
using namespace std;

int n, c;
ll d[maxn];
int main() {
    
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  cin >> c >> n;
  for(int i = 1; i <= n; i++) {
    int w, v, k; 
    cin >> v >> w >> k;
    for(int p = 1; k > 0; p *= 2) {
      int cur = min(p, k);
      ll new_w = 1ll * w * cur;
      ll new_v = 1ll * v * cur;
      for(int j = c; j >= new_w; j--) 
        d[j] = max(d[j], d[j-new_w] + new_v);
        
      k -= cur;
    }
  }
  
  cout << d[c];
}

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