제출 #490619

#제출 시각아이디문제언어결과실행 시간메모리
490619lolipopKnapsack (NOI18_knapsack)C++17
37 / 100
6 ms1868 KiB
//looking for 49 points(subtasks 1 - 3) #include<bits/stdc++.h> using namespace std; #define int long long using ll = long long; using ii = pair <int, int>; const int maxn = 105, maxk = 15, maxs = 2005; int n, s; int V[maxn], W[maxn], K[maxs]; int dp[maxn][maxs]; main () { ios::sync_with_stdio(0); cin.tie(0); #ifdef LOCAL freopen("in.txt", "r", stdin); #endif cin >> s >> n; for (int i = 1; i <= n; ++i) { cin >> V[i] >> W[i] >> K[i]; } int ans = 0; if (n == 1) { int take = s / W[0]; ans = take > K[0] ? K[0] * V[0] : take * V[0]; cout << ans; return 0; } for (int i = 1; i <= n; ++i) { for (int j = 0; j <= s; ++j) { for (int k = 0; k <= K[i]; ++k) { int tot = k * W[i]; if (j - tot >= 0) dp[i][j] = max(dp[i][j], dp[i - 1][j - tot] + k * V[i]); dp[i][j] = max(dp[i][j], dp[i - 1][j]); ans = max(ans, dp[i][j]); } } } cout << ans; return 0; } /* array bound? overflow? print newline after every cases idea correct? */

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

knapsack.cpp:18:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   18 | main () {
      | ^~~~
#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...