oj.uz

Submission #829954

# Submission time Handle Problem Language Result Execution time Memory
829954 2023-08-18T16:15:53 Z now_or_never Knapsack (NOI18_knapsack) C++14
100 / 100
 45 ms 5396 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 = 0; i <= s; 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 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 2 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 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 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 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 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 3 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 388 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 400 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 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 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 3 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 388 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 400 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 25 ms 4960 KB Output is correct
36 Correct 30 ms 5000 KB Output is correct
37 Correct 26 ms 5016 KB Output is correct
38 Correct 23 ms 4752 KB Output is correct
39 Correct 29 ms 4616 KB Output is correct
40 Correct 45 ms 5160 KB Output is correct
41 Correct 32 ms 5140 KB Output is correct
42 Correct 35 ms 5148 KB Output is correct
43 Correct 42 ms 5176 KB Output is correct
44 Correct 42 ms 5172 KB Output is correct
45 Correct 27 ms 5044 KB Output is correct
46 Correct 27 ms 5012 KB Output is correct
47 Correct 29 ms 5396 KB Output is correct
48 Correct 34 ms 5040 KB Output is correct
49 Correct 25 ms 5136 KB Output is correct
50 Correct 39 ms 4724 KB Output is correct