Submission #970468

#	Time	Username	Problem	Language	Result	Execution time	Memory
970468		v_matei	Knapsack (NOI18_knapsack)	C++17	73 / 100	1067 ms	1552 KiB

knapsack

 #pragma gcc optimize("Ofast")
 #pragma GCC target("avx")

#include<bits/stdc++.h>
#include <vector>
 
#define ll long long
#define ull unsigned long long
#define pii std::pair<int, int>
 
#define NMAX 100'007
#define SMAX 2007
 
int n, s;
int v[NMAX], w[NMAX], k[NMAX];
std::vector<int> dp[2];
void citire(){
  std::cin >> s >> n;
  for(int i = 1; i <= n; i++)
    std::cin >> v[i] >> w[i] >> k[i];
  dp[0].resize(s + 1);
  dp[1].resize(s + 1);
}
 
int main(){
  citire();
  for(int i = 1; i <= n; i++){
    for(int j = 0; j <= s; j++){
      dp[1][j] = dp[0][j];
      for(int x = 0; j - w[i]*x >= 0 && x <= k[i]; x++){
        dp[1][j] = std::max(dp[1][j], dp[0][j - x*w[i]] + x*v[i]);
      }
    }
    dp[0] = dp[1];
    dp[1].clear();
    dp[1].resize(s + 1);
  }
  std::cout << dp[0][s];
  return 0;
}

Compilation message (stderr)

knapsack.cpp:1: warning: ignoring '#pragma gcc optimize' [-Wunknown-pragmas]
    1 |  #pragma gcc optimize("Ofast")
      |

• Subtask 1: 12 / 12
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 24 / 24
• Subtask 5: 0 / 27