제출 #1258263

#제출 시각아이디문제언어결과실행 시간메모리
1258263alizhanKnapsack (NOI18_knapsack)C++20
100 / 100
72 ms1728 KiB
#include <bits/stdc++.h> using namespace std; signed main() { int s, n; cin >> s >> n; vector<int> dp(s + 1, -1e18); vector<pair<int, int>> g[2010]; for(int i = 1; i <= n; i++) { int v, w, k; cin >> v >> w >> k; g[w].push_back({v, k}); } for(int i = 1; i <= s; i++) { sort(g[i].begin(), g[i].end()); } dp[0] = 0; for(int i = 1; i <= s; i++) { int c = 0; for(int k = 1; k <= s / i; k++) { if(g[i].size() == 0) break; c++; for(int j = s; j >= i; j--) { if(dp[j - i] == -1e18) continue; dp[j] = max(dp[j], dp[j - i] + g[i].back().first); } g[i].back().second--; if(g[i].back().second == 0) g[i].pop_back(); } } int mx = 0; for(int i = 1; i <= s; i++) { mx = max(dp[i], mx); } cout << mx; return 0; }

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

knapsack.cpp: In function 'int main()':
knapsack.cpp:7:27: warning: overflow in conversion from 'double' to 'std::vector<int>::value_type' {aka 'int'} changes value from '-1.0e+18' to '-2147483648' [-Woverflow]
    7 |     vector<int> dp(s + 1, -1e18);
      |                           ^~~~~
#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...