# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1107588 | adkjt | Knapsack (NOI18_knapsack) | C++14 | 39 ms | 5836 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>
using namespace std;
#define f first
#define s second
vector<pair<long long,long long>> V[2222];
long long dp[2222];
pair<long long,pair<long long,long long>> a[111111];//v,w,k
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int s,n;
cin>>s>>n;
for(int i=1; i<=n; i++)
{
cin>>a[i].f>>a[i].s.f>>a[i].s.s;
if(a[i].s.f>s) continue;
V[a[i].s.f].push_back({-a[i].f,a[i].s.s});
}
for(int i=1; i<=s; i++) dp[i]=-1;
for(int i=1; i<=s; i++)
sort(V[i].begin(),V[i].end());
for(int i=1; i<=s; i++)
{
if (V[i].empty()) continue;
int id=0;
for(int j=0;j<s/i;j++)
//for(auto x:V[i])//v,k
{
//re:
if(id>=V[i].size()) break;
for (int w = s; w - i >= 0; w--)
{
dp[w] = max(dp[w], dp[w - i] - V[i][id].f);
}
/*idx--;
if(idx>s/i) break;*/
V[i][id].s--;
if (V[i][id].s == 0)
{
id++;
continue;
}
//else goto re;
}
}
long long ans=0;
for(int i=1; i<=s; i++)
ans=max(ans,dp[i]);
cout<<ans;
}
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... |