oj.uz

Submission #829968

# Submission time Handle Problem Language Result Execution time Memory
829968 2023-08-18T16:23:51 Z now_or_never Knapsack (NOI18_knapsack) C++14
100 / 100
 46 ms 5460 KB 
#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 = 1; 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;
    return 0;
  }
    /*
      Observation: The numbers of taken product must less than S since 1 <= Wi <= S -> maximum taken product: S / W[i]
      -> consider the top valued S/W[i] items for each W[i]
    */
    vii obj[S];
    long long dp[2001];
    memset(dp, 0, sizeof dp);
    for (int i = 1; i <= n; i++) {
      obj[w[i]].pb({v[i], k[i]});
    }

    for (int i = s;i>=0;i--) {
      if (obj[i].size() == 0) continue;
      sort(all(obj[i]), greater<pair<int, int>>());

      int id = 0;
      for (int j = 1; j * i <= s; j++) {
        for (int k = s; k >= i; k--) {
          dp[k] = max(dp[k], dp[k - i] + obj[i][id].first);
        }
        --obj[i][id].second;
        if (obj[i][id].second == 0) ++id;
        if (id >= obj[i].size()) break;
      }
    }
    cout << dp[s] << endl;
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:57:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         if (id >= obj[i].size()) break;
      |             ~~~^~~~~~~~~~~~~~~~
knapsack.cpp:29:7: warning: unused variable 'mx' [-Wunused-variable]
   29 |   int mx = *max_element(k, k + n);
      |       ^~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 0 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 380 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 340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 380 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 340 KB Output is correct
11 Correct 1 ms 380 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 388 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 404 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 0 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 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 380 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 340 KB Output is correct
15 Correct 1 ms 380 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 388 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 404 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 4 ms 384 KB Output is correct
27 Correct 1 ms 388 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 388 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 0 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 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 380 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 340 KB Output is correct
15 Correct 1 ms 380 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 388 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 404 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 4 ms 384 KB Output is correct
27 Correct 1 ms 388 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 388 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 28 ms 5168 KB Output is correct
36 Correct 31 ms 5168 KB Output is correct
37 Correct 26 ms 5172 KB Output is correct
38 Correct 24 ms 4916 KB Output is correct
39 Correct 28 ms 4796 KB Output is correct
40 Correct 46 ms 5196 KB Output is correct
41 Correct 32 ms 5292 KB Output is correct
42 Correct 33 ms 5204 KB Output is correct
43 Correct 42 ms 5300 KB Output is correct
44 Correct 42 ms 5296 KB Output is correct
45 Correct 27 ms 5252 KB Output is correct
46 Correct 27 ms 5080 KB Output is correct
47 Correct 30 ms 5460 KB Output is correct
48 Correct 35 ms 5132 KB Output is correct
49 Correct 24 ms 5252 KB Output is correct
50 Correct 39 ms 4916 KB Output is correct