| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1345166 | po_rag526 | Knapsack (NOI18_knapsack) | C++17 | 887 ms | 49904 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int s, n;
cin >> s >> n;
vector<int> w, v;
vector<int> dp(s+1, 0);
for(int i = 0; i < n; i++){
int a, b, c;
cin >> a >> b >> c;
int k = 1;
while (c > 0){
int mn = min(k, c);
w.push_back(mn * b);
v.push_back(mn * a);
c -= mn;
k*=2;
}
}
for(int i = 0; i < (int)w.size(); i++){
for(int j = s; j >= w[i]; j--){
dp[j] = max(dp[j], dp[j-w[i]] + v[i]);
}
}cout << dp[s];
}| # | 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... | ||||
