# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
860754 | noyancanturk | Knapsack (NOI18_knapsack) | C++17 | 39 ms | 3040 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.
#ifndef Local
#pragma GCC optimize("O3,unroll-loops")
#endif
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define lim 100000
using namespace std;
const int mod=1000000007ll;
void solve(){
int s,n;
cin>>s>>n;
priority_queue<pair<int,int>>weight[s+1];
for(int i=0;i<n;i++){
int v,w,k;
cin>>v>>w>>k;
weight[w].push({v,k});
}
int dp[s+1];
memset(dp,0,sizeof(dp));
for(int i=1;i<=s;i++){
int cani=s/i,j=0;
while(cani&&weight[i].size()){
auto p=weight[i].top();
weight[i].pop();
int to=min(p.second,cani);
for(int rep=0;rep<to;rep++){
for(int j=s-i;0<=j;j--){
dp[j+i]=max(dp[j+i],dp[j]+p.first);
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... |