# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1265959 | nhathanh | Knapsack (NOI18_knapsack) | C++20 | 30 ms | 55368 KiB |
#include<bits/stdc++.h>
using namespace std;
#define el "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define int long long
#define file(name) if(fopen(name".inp","r")){freopen(name".inp","r",stdin);freopen(name".out","w",stdout);}
const int N=1e6+10;
int s,n,a,b,c,cnt=1,trueans;
vector<pii>w[N];
int ans[2005][2005];
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
file("a");
cin>>s>>n;
for(int i=1;i<=n;i++)
{
cin>>a>>b>>c;
w[b].push_back({a,c});
}
memset(ans,-1,sizeof(ans));
ans[0][0]=0;
for(int i=1;i<=s;i++)
sort(w[b].begin(),w[b].end(),greater<pii>());
for(int i=1;i<=s;i++)
{
if(w[i].empty()) continue;
for(int lim=0;lim<=s;lim++)
{
ans[cnt][lim]=ans[cnt-1][lim];
int cur_w=0, cur_val=0;
for(int k=0;k<w[i].size();k++)
{
if(cur_w>lim) break;
for(int f=1;f<=w[i][k].se;f++)
{
cur_val+=w[i][k].fi;
cur_w+=i;
if(cur_w>lim) break;
if(ans[cnt-1][lim-cur_w]!=-1)
{
ans[cnt][lim]=max(ans[cnt][lim],ans[cnt-1][lim-cur_w]+cur_val);
trueans=max(ans[cnt][lim],trueans);
}
}
}
}
cnt++;
}
cout<<trueans;
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... |