제출 #434406

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
434406		Valera_Grinenko	Knapsack (NOI18_knapsack)	C++17	100 / 100	64 ms	3824 KiB

knapsack

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <queue>
#include <bitset>
#include <numeric>
#include <array>
#include <cstring>
#include <random>
#include <chrono>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template<class T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll dp[2042] = {0};
int main() {

  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

  int s, n;

  cin >> s >> n;

  vector<vector<pair<int, int> > > av(s + 1);

  for(int i = 0; i < n; i++) {
    int v, w, k;
    cin >> v >> w >> k;
    av[w].pb(mp(v, k));
  }

  for(int i = 1; i <= s; i++) {
    sort(rall(av[i]));
    int x = i;
    for(auto& a : av[i]) {
      if(x > s) break;
      for(int j = 0; j < a.se && x <= s; j++, x += i)
        for(int k = s; k >= i; k--)
          dp[k] = max(dp[k], dp[k - i] + a.fi);
    }
  }

  cout << dp[s];

  return 0;
}
/*

*/

컴파일 시 표준 에러 (stderr) 메시지

knapsack.cpp:3: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      |

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