제출 #1078599

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1078599		SlayerOfDeath	Knapsack (NOI18_knapsack)	C++14	37 / 100	2 ms	348 KiB

knapsack

#include <bits/stdc++.h>
 
using namespace std;
 
typedef vector<pair<long long, long long>> vii;
 
#define pb push_back
#define all(x) x.begin(), x.end()
 
const int V = 1e6 + 7;
const int N = 1e5 + 7;
const int S = 2e3 + 7;
const int inf = 1e9;
 
long long s, n, v[N], w[N], k[N];
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
 
  #ifndef ONLINE_JUDGE
  // freopen("test.inp", "r", stdin);
  //freopen("test.out", "w", stdout);
  #endif
 
  cin >> s >> n;
  for (int i = 0; i < n; i++) cin >> v[i] >> w[i] >> k[i];
 
  int mx = *max_element(k, k + n);
  // Subtask 1
//   if (n == 1) {
//     cout << v[1] * min(s / w[1], k[1]) << endl;
//   }
  // Subtask 2 & 3: Normal knapsack
    if (1 <= n && n <= 100 && mx <= 10) {
    long long dp[2001];
    memset(dp, 0, sizeof dp);
    for (int i = 0; i < n; i++)
      for (int t = 0; t < k[i]; t++)
        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: 0 / 12
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 0 / 24
• Subtask 5: 0 / 27