제출 #914409

#제출 시각아이디문제언어결과실행 시간메모리
914409Em1LKnapsack (NOI18_knapsack)C++14
0 / 100
321 ms2520 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; using tiii = tuple<int, int, int>; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, s; cin >> s >> n; vector < pii > val; for (int i = 1, v, w, k; i <= n; i++) { cin >> v >> w >> k; int total = 0; while (total <= s) { val.push_back({ v, w }); total += w; } } vector < int > dp(s + 1, -1); dp[0] = 0; for (auto [v, w] : val) { if (w > s) continue; for (int cur = s; cur >= w; cur--) if (dp[cur - w] >= 0) dp[cur] = max(dp[cur], dp[cur - w] + v); } cout << *max_element(dp.begin(), dp.end()) << "\n"; }

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

knapsack.cpp: In function 'int main()':
knapsack.cpp:31:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   31 |     for (auto [v, w] : val) {
      |               ^
#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...