| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1315474 | ilovewaguri | Knapsack (NOI18_knapsack) | C++20 | 0 ms | 332 KiB |
#include<bits/stdc++.h>
using namespace std;
#define NAME "TEST"
#define nl '\n'
#define allofa(x,sz) x+1,x+sz+1
#define allof(x) x.begin(),x.end()
#define mset(x,val) memset(x,val,sizeof(x))
template<typename T> T Max(T x, T y){return(x>y)?x:y;};
template<typename T> T Min(T x, T y){return(x<y)?x:y;};
template<class X,class Y> bool minimize(X &a, Y b){if(a>b){a=b;return true;}return false;};
template<class X,class Y> bool maximize(X &a, Y b){if(a<b){a=b;return true;}return false;};
typedef long long ll;
const ll mod = (long long)1e9+7;
const ll LINF = (long long)1e18;
const int INF = (int)1e9;
const int MAXN = (int)1e5+5;
const int MAXV = (int)1e6+5;
int v[MAXN],w[MAXN],k[MAXN];
int s,n;
void ccps() {
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
if(fopen(NAME".inp","r")) {
freopen(NAME".inp","r",stdin);
freopen(NAME".out","w",stdout);
}
}
namespace sub2 {
const int V = 2010;
const int N = 110;
ll dp[V];
bool check() {
for (int i = 1; i<=n; i++) {
if(k[i]!=1) return false;
}
return n<=100;
}
void sol() {
fill(allofa(dp,s),0);
for (int i = 1; i<=n; i++) {
for (int c = s; c>=w[i]; c--) {
maximize(dp[c],dp[c-w[i]]+v[i]);
}
}
cout << dp[s];
}
}
signed main() {
ccps();
cin >> s >> n;
for (int i = 1; i<=n; i++) {
cin >> v[i] >> w[i] >> k[i];
}
if(sub2::check()) sub2::sol();
}
컴파일 시 표준 에러 (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... | ||||
