oj.uz

Submission #704285

# Submission time Handle Problem Language Result Execution time Memory
704285 2023-03-02T02:49:51 Z Stormersyle Knapsack (NOI18_knapsack) C++14
100 / 100
 294 ms 247240 KB 
#include <iostream>
#include <bits/stdc++.h>
#include <fstream>
#include <string>
#include <cstdio>
#include <cstring>
#include <algorithm>  
#include <math.h>
#include <numeric>
using namespace std;
using ll=long long;

int S, N, V[100001], W[100001], K[10001];
vector<pair<int, int>> weightClass[2001]; //(a, b)=value a, quantity b

int main() {
  // ifstream cin("file.in");
  cin>>S>>N;
  for (int i=0; i<N; i++){
    cin>>V[i]>>W[i]>>K[i];
    weightClass[W[i]].push_back({V[i], K[i]});
  }
  for (int w=1; w<=S; w++){
    if (weightClass[w].size()>0) sort(weightClass[w].begin(), weightClass[w].end());
  }
  vector<int> value, weight; //list of items we consider (up to top S/w from each weight w); pair=(value, weight)
  for (int w=1; w<=S; w++){
    vector<pair<int, int>> wc=weightClass[w];
    for (int i=0; i<S/w; i++){
      if (wc.size()==0) break;
      value.push_back({wc.back().first}), weight.push_back(w);
      wc.back().second--;
      if (wc.back().second==0) wc.pop_back();
    }
  }
  //Now: 0-1 DP on rest of objects
  int T=value.size();
  // cout<<T<<"\n";
  // for (int i=0; i<T; i++) cout<<value[i]<<" "<<weight[i]<<"\n";
  ll f[S+1][T];
  for (int i=0; i<T; i++) f[0][i]=0;
  for (int x=1; x<=S; x++){
    if (x>=weight[0]) f[x][0]=(ll)(value[0]);
    else f[x][0]=0;
    for (int i=1; i<T; i++){
      if (x>=weight[i]) f[x][i]=max(f[x][i-1], f[x-weight[i]][i-1]+(ll)(value[i]));
      else f[x][i]=f[x][i-1];
    }
  }
  cout<<f[S][T-1];
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 1492 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 1 ms 356 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 2 ms 1876 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 1748 KB Output is correct
7 Correct 2 ms 1896 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 2 ms 1764 KB Output is correct
10 Correct 2 ms 1748 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 356 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 2 ms 1876 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 1748 KB Output is correct
7 Correct 2 ms 1896 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 2 ms 1764 KB Output is correct
10 Correct 2 ms 1748 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 13 ms 15588 KB Output is correct
13 Correct 2 ms 1876 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 3668 KB Output is correct
17 Correct 2 ms 1748 KB Output is correct
18 Correct 2 ms 2260 KB Output is correct
19 Correct 3 ms 3540 KB Output is correct
20 Correct 3 ms 3284 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 356 KB Output is correct
6 Correct 2 ms 1876 KB Output is correct
7 Correct 2 ms 1876 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 1748 KB Output is correct
11 Correct 2 ms 1896 KB Output is correct
12 Correct 1 ms 1748 KB Output is correct
13 Correct 2 ms 1764 KB Output is correct
14 Correct 2 ms 1748 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 13 ms 15588 KB Output is correct
17 Correct 2 ms 1876 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 3 ms 3668 KB Output is correct
21 Correct 2 ms 1748 KB Output is correct
22 Correct 2 ms 2260 KB Output is correct
23 Correct 3 ms 3540 KB Output is correct
24 Correct 3 ms 3284 KB Output is correct
25 Correct 1 ms 356 KB Output is correct
26 Correct 26 ms 31604 KB Output is correct
27 Correct 2 ms 1876 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 9 ms 10536 KB Output is correct
31 Correct 2 ms 1876 KB Output is correct
32 Correct 2 ms 2132 KB Output is correct
33 Correct 3 ms 3164 KB Output is correct
34 Correct 4 ms 4308 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 356 KB Output is correct
6 Correct 2 ms 1876 KB Output is correct
7 Correct 2 ms 1876 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 1748 KB Output is correct
11 Correct 2 ms 1896 KB Output is correct
12 Correct 1 ms 1748 KB Output is correct
13 Correct 2 ms 1764 KB Output is correct
14 Correct 2 ms 1748 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 13 ms 15588 KB Output is correct
17 Correct 2 ms 1876 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 3 ms 3668 KB Output is correct
21 Correct 2 ms 1748 KB Output is correct
22 Correct 2 ms 2260 KB Output is correct
23 Correct 3 ms 3540 KB Output is correct
24 Correct 3 ms 3284 KB Output is correct
25 Correct 1 ms 356 KB Output is correct
26 Correct 26 ms 31604 KB Output is correct
27 Correct 2 ms 1876 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 9 ms 10536 KB Output is correct
31 Correct 2 ms 1876 KB Output is correct
32 Correct 2 ms 2132 KB Output is correct
33 Correct 3 ms 3164 KB Output is correct
34 Correct 4 ms 4308 KB Output is correct
35 Correct 66 ms 3900 KB Output is correct
36 Correct 115 ms 34596 KB Output is correct
37 Correct 88 ms 34484 KB Output is correct
38 Correct 73 ms 3588 KB Output is correct
39 Correct 93 ms 4332 KB Output is correct
40 Correct 294 ms 247240 KB Output is correct
41 Correct 198 ms 145068 KB Output is correct
42 Correct 195 ms 155788 KB Output is correct
43 Correct 271 ms 246920 KB Output is correct
44 Correct 272 ms 245708 KB Output is correct
45 Correct 104 ms 21796 KB Output is correct
46 Correct 94 ms 4784 KB Output is correct
47 Correct 123 ms 43364 KB Output is correct
48 Correct 181 ms 115140 KB Output is correct
49 Correct 83 ms 5736 KB Output is correct
50 Correct 194 ms 144816 KB Output is correct