제출 #852788

#제출 시각아이디문제언어결과실행 시간메모리
852788DP_196Knapsack (NOI18_knapsack)C++14
0 / 100
6 ms25436 KiB
#include <bits/stdc++.h> using namespace std; #define file "MARKET" #define mp make_pair #define fi first #define se second #define all(x) x.begin(), x.end() #define getbit(x, i) (((x) >> (i)) & 1) #define bit(x) (1LL << (x)) #define popcount __builtin_popcountll mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count()); int rand(int l, int r) { return l + rd() % (r - l + 1); } const int N = 1e6 + 5; const int mod = (int)1e9 + 7; // 998244353; const int lg = 25; // lg + 1 const int oo = 1e9; const long long ooo = 1e18; template<class X, class Y> bool mini(X &a, Y b) { return a > b ? (a = b, true) : false; } template<class X, class Y> bool maxi(X &a, Y b) { return a < b ? (a = b, true) : false; } void add(int &a, int b) { a += b; if (a >= mod) a -= mod; if (a < 0) a += mod; } int n, W; vector<pair<int, int> > adj[N]; int f[N]; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> W >> n; for (int i = 1; i <= n; ++i) { int c, e, l; cin >> c >> e >> l; adj[c].emplace_back(e, l); } for (int i = 1; i <= W; ++i) { sort(all(adj[i])); reverse(all(adj[i])); int curW = i; for (auto [e, l] : adj[i]) { if (curW > W) break; for (int j = 0; j < l && curW <= W; ++j, curW += i) { for (int k = W; k >= i; --k) { f[k] = max(f[k], f[k - i] + e); } } } } cout << f[W]; return 0; } /* */

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

knapsack.cpp: In function 'int main()':
knapsack.cpp:59:16: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   59 |      for (auto [e, l] : adj[i]) {
      |                ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...