답안 #528504

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
528504 2022-02-20T12:10:58 Z theysoldtheworld Knapsack (NOI18_knapsack) C++14
100 / 100
87 ms 7348 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;
    }
  }

  auto Get_candidates = [&](long long val) {
    vector<long long> c;
    int po = -1;
    for (int i = 11 ; i >= 0 ; i--) {
      long long cur = (1LL << i);
      if (cur & val) {
        if (po == -1) {
          po = (1 << i) - 1;
          c.push_back(1);
        }
        else {
          c.push_back(cur);
        }
      }
    }
    for (int i = 11 ; i >= 0 ; i--) {
      long long cur = (1LL << i);
      if (po & cur) {
        c.push_back(cur);
      }
    }
    return c;
  };

  int n = (int)b.size();
  
  vector<pair<long long , long long>> who;
  for (int i = 0 ; i < n ; i++) {
    vector<long long> c = Get_candidates(b[i].k);
    for (int j = 0 ; j < (int)c.size() ; j++) {
      long long cost = b[i].w * c[j];
      long long add = b[i].v * c[j];
      who.emplace_back(add , cost);
    }
  }
  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; 
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 324 KB Output is correct
2 Correct 0 ms 288 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 316 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 312 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 316 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 312 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 2 ms 312 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 0 ms 312 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 324 KB Output is correct
2 Correct 0 ms 288 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 316 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 312 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 2 ms 312 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 0 ms 312 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 304 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 308 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 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 308 KB Output is correct
34 Correct 1 ms 312 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 324 KB Output is correct
2 Correct 0 ms 288 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 316 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 312 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 2 ms 312 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 0 ms 312 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 304 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 308 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 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 308 KB Output is correct
34 Correct 1 ms 312 KB Output is correct
35 Correct 27 ms 5708 KB Output is correct
36 Correct 38 ms 5804 KB Output is correct
37 Correct 38 ms 5692 KB Output is correct
38 Correct 29 ms 6140 KB Output is correct
39 Correct 39 ms 6556 KB Output is correct
40 Correct 62 ms 7256 KB Output is correct
41 Correct 87 ms 6904 KB Output is correct
42 Correct 84 ms 6876 KB Output is correct
43 Correct 64 ms 6708 KB Output is correct
44 Correct 58 ms 6624 KB Output is correct
45 Correct 39 ms 7148 KB Output is correct
46 Correct 28 ms 6368 KB Output is correct
47 Correct 39 ms 7348 KB Output is correct
48 Correct 47 ms 7196 KB Output is correct
49 Correct 26 ms 6792 KB Output is correct
50 Correct 43 ms 6524 KB Output is correct