# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
682635 | vjudge1 | Knapsack (NOI18_knapsack) | C++17 | 61 ms | 5008 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 2010;
typedef pair<int,int> ii;
#define ff first
#define ss second
vector <ii> adj[maxn];
int n,S;
int dp[maxn];
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
cin>>S>>n;
for (int i=1; i<=n; i++)
{
int v,w,k; cin>>v>>w>>k;
adj[w].push_back({v,k});
}
for (int i=1; i<=S; i++)
{
if (adj[i].empty()) continue;
sort(adj[i].begin(),adj[i].end(),greater<ii> ());
for (int j=S; j>=i; j--)
{
int it=0;
int cnt = adj[i][it].ss;
int temp=j;
int w=0;
while (it<adj[i].size()&&temp-i>=0)
{
temp-=i;
w+=adj[i][it].ff;
cnt--;
dp[j]=max(dp[j],dp[temp]+w);
if (cnt==0)
{
it++;
cnt=adj[i][it].ss;
}
}
}
}
cout<<dp[S]<<'\n';
}
Compilation message (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... |