제출 #1319419

#제출 시각아이디문제언어결과실행 시간메모리
1319419f0rswornKnapsack (NOI18_knapsack)C++20
37 / 100
1094 ms25148 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; ll dp[2001]; int main() { int S, n; scanf("%d%d", &S, &n); memset(dp, 0, sizeof(dp)); vector<int> val, weights; for (int i = 0; i < n; ++i) { int v, w, k; scanf("%d%d%d", &v, &w, &k); while (k--) { val.push_back(v); weights.push_back(w); } } int N = val.size(); for (int i = 0; i < N; ++i) { for (int s = S; s >= weights[i]; --s) { dp[s] = max(dp[s], val[i] + dp[s - weights[i]]); } } printf("%lld\n", dp[S]); return 0; }

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

knapsack.cpp: In function 'int main()':
knapsack.cpp:9:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |   scanf("%d%d", &S, &n);
      |   ~~~~~^~~~~~~~~~~~~~~~
knapsack.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     scanf("%d%d%d", &v, &w, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
#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...