| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1332835 | yumemystery | Knapsack (NOI18_knapsack) | C++20 | 1093 ms | 456 KiB |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int W,n;
cin >> W >> n;
vector<ll>dp(W+1,0);
for (int i=1; i<=n; i++) {
int v,w,K;
cin >> v >> w >> K;
for (int j=1; j<=min(K,W/w); j++) {
for (int k = W; k>=w; k--) {
dp[k] = max(dp[k],dp[k-w]+v);
}
}
}
cout << dp[W];
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
