oj.uz

답안 #719608

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
719608 2023-04-06T11:05:06 Z JANCARAPAN Knapsack (NOI18_knapsack) C++17
29 / 100
 2 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define ll long long 
#define fi first
#define se second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define sz(a) (long long) a.size()
#define endl '\n'
 
#define dbg(a) cerr << #a << " = " << a << endl;
#define print(a) for (auto x : a) cerr << x << " "; cerr << endl;
 
const long long INF = 1e18, MOD = 1e9 + 7;
 
void solve(){
  int s, n;
  cin >> s >> n;
  vector<int> v(n), w(n), k(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i] >> w[i] >> k[i];
  }
  vector<ll> dp(s + 1);
  for (int i = 0; i < n; i++) {
    vector<ll> already(s + 1), ndp(s + 1);
    for (int j = w[i]; j <= s; j++) {
      if (dp[j - w[i]] + v[i] > dp[j]) {
        ndp[j] = dp[j - w[i]] + v[i];
        already[j] = 1;
      }
      if (ndp[j - w[i]] + v[i] > ndp[j] && already[j - w[i]] + 1 <= k[i]) {
        ndp[j] = ndp[j - w[i]] + v[i];
        already[j] = already[j - w[i]] + 1;
      }
      if (ndp[j - 1] > ndp[j]) {
        ndp[j] = ndp[j - 1];
        already[j] = already[j - 1];
      }
    }
    for (int j = w[i]; j <= s; j++) {
      dp[j] = max(dp[j], ndp[j]);
    }
    //print(dp)
  }
  
  cout << dp[s] << endl;
}
 
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
    solve();
  }
  return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 320 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 316 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 320 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Incorrect 1 ms 324 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 320 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Incorrect 1 ms 324 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 320 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Incorrect 1 ms 324 KB Output isn't correct
17 Halted 0 ms 0 KB -