oj.uz

Submission #528518

# Submission time Handle Problem Language Result Execution time Memory
528518 2022-02-20T12:37:05 Z theysoldtheworld Knapsack (NOI18_knapsack) C++14
100 / 100
 122 ms 6604 KB 
#include <bits/stdc++.h>
 
using namespace std;

struct Item {
  long long v , w , k;
};
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int S , N;
  cin >> S >> N;
  vector<Item> a(N);
  vector<vector<pair<long long , long long>>> now(S + 1);
  for (int i = 0 ; i < N ; i++) {
    cin >> a[i].v >> a[i].w >> a[i].k;
    a[i].k = min(a[i].k , S * 1LL);
    now[a[i].w].emplace_back(a[i].v , a[i].k);
  }

  vector<Item> b;
  for (int i = 1 ; i <= S ; i++) {
    sort(now[i].rbegin(), now[i].rend());
    long long h = S;
    for (int j = 0 ; j < (int)now[i].size() ; j++) {
      long long can = min(h / i , now[i][j].second);
      if (can == 0) break;
      b.push_back({now[i][j].first , i , can});
      h -= can * i;
    }
  }

  int n = (int)b.size();
  
  vector<pair<long long , long long>> who;
  for (int i = 0 ; i < n ; i++) {
    for (int j = 0 ; j < b[i].k ; j++) {
      who.emplace_back(b[i].v , b[i].w);
    }
  }
  vector<long long> dp(S + 1);
  vector<bool> Reachable(S + 1);
  Reachable[0] = true;
  for (int i = 0 ; i < (int)who.size() ; i++) {
    for (int j = S - who[i].second ; j >= 0 ; j--) {
      if (j + who[i].second <= S && Reachable[j]) {
        Reachable[who[i].second + j] = true;
        dp[who[i].second + j] = max(dp[who[i].second + j] , dp[j] + who[i].first);
      }
    }
  }
  cout << *max_element(dp.begin(),dp.end()) << '\n';
  return 0; 
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 312 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 312 KB Output is correct

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 0 ms 312 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 312 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 312 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 312 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 0 ms 312 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 312 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 9 ms 332 KB Output is correct
27 Correct 1 ms 316 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 3 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 312 KB Output is correct
34 Correct 2 ms 332 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 312 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 312 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 0 ms 312 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 312 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 9 ms 332 KB Output is correct
27 Correct 1 ms 316 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 3 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 312 KB Output is correct
34 Correct 2 ms 332 KB Output is correct
35 Correct 26 ms 5652 KB Output is correct
36 Correct 42 ms 5724 KB Output is correct
37 Correct 35 ms 5696 KB Output is correct
38 Correct 31 ms 5804 KB Output is correct
39 Correct 40 ms 5600 KB Output is correct
40 Correct 122 ms 6472 KB Output is correct
41 Correct 79 ms 6596 KB Output is correct
42 Correct 86 ms 6604 KB Output is correct
43 Correct 118 ms 6448 KB Output is correct
44 Correct 114 ms 6428 KB Output is correct
45 Correct 41 ms 6048 KB Output is correct
46 Correct 29 ms 5808 KB Output is correct
47 Correct 48 ms 6348 KB Output is correct
48 Correct 73 ms 6248 KB Output is correct
49 Correct 27 ms 6084 KB Output is correct
50 Correct 88 ms 5996 KB Output is correct