제출 #1104217

#제출 시각아이디문제언어결과실행 시간메모리
1104217KasymKKnapsack (NOI18_knapsack)C++17
0 / 100
1 ms504 KiB
#include "bits/stdc++.h" using namespace std; #define ff first #define ss second #define all(v) v.begin(), v.end() #define ll long long #define pb push_back #define pii pair<int, int> #define pli pair<ll, int> #define pll pair<ll, ll> #define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i) #define wr puts("----------------") template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;} template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;} const int N = 2005; ll dp[N]; vector<pii> Q[N]; int main(){ int s, n; scanf("%d%d", &s, &n); for(int i = 1; i <= n; ++i){ int w, v, k; scanf("%d%d%d", &v, &w, &k); Q[w].pb({v, k}); } for(int ad = 1; ad <= s; ++ad){ sort(all(Q[ad])); reverse(all(Q[ad])); int sz = (int)Q[ad].size(), w = 0; ll v = 0; for(int i = 0; i < sz;){ if(Q[ad][i].ss == 0){ i++; continue; } w += ad, v += Q[ad][i].ff, Q[ad][i].ss--; if(w > s) break; for(int i = s; i >= w; --i) umax(dp[i], dp[i-w]+v); } } printf("%lld\n", dp[s]); return 0; }

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

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