| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1321940 | jim_x | Knapsack (NOI18_knapsack) | C++17 | 1097 ms | 33408 KiB |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <numeric>
#include <queue>
#include <stack>
#include <iomanip>
using namespace std;
void baseIO(string s = ""){
ios_base::sync_with_stdio(0);
cin.tie(0);
if (s.size()){
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
}
int main() {
baseIO();
int s, n;
cin >> s >> n;
vector<vector<int>> items(n, vector<int>(3));
vector<pair<int, int>> ai;
for (int i = 0; i < n; i++){
cin >> items[i][0] >> items[i][1] >> items[i][2];
while (items[i][2]--) ai.push_back({items[i][0], items[i][1]});
}
int dp[s + 1]{};
for (auto &item : ai){
for (int pos = s - item.second; pos >= 0; pos--){
dp[pos + item.second] = max(dp[pos + item.second], dp[pos] + item.first);
}
}
cout << *max_element(dp, dp + s + 1);
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
| # | 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... | ||||
