Submission #1096585

#TimeUsernameProblemLanguageResultExecution timeMemory
1096585dostsKnapsack (NOI18_knapsack)C++17
73 / 100
1095 ms2936 KiB
//SİGUSMUS SEFEROĞLU #include <bits/stdc++.h> #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt") using namespace std; //#define int int64_t #define pii pair<int,int> #define ff first #define ss second #define sp << " " << #define all(cont) cont.begin(),cont.end() #define vi vector<int> const int MOD = 1e9+7,inf = 2e9; const int N = 1e5+50,Q = 2e5+50; int alloc[2008]; int ptr = 0; int sz = 0; int v[N],c[N],k[N]; int sk[2008],sk1[2008]; signed main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); #ifdef Dodi freopen("in.txt","r",stdin); freopen("out.txt","w",stdout); #endif int n,w; cin >> w >> n; for (int i=1;i<=n;i++) cin >> v[i] >> c[i] >> k[i]; int*sack=sk,*sack2=sk1; for (int i=0;i<=w+1;i++) sack2[i] = -inf; sack2[0] = 0; for (int i=1;i<=n;i++) { for (int jj = 0;jj<c[i];jj++) { sz = ptr = 0; for (int j = jj;j<=w;j+=c[i]) { while (sz && k[i] < (j-alloc[ptr])/c[i]) { sz--; ptr++; } while (sz && (j-alloc[ptr+sz-1])/c[i]*v[i]+sack2[alloc[sz+ptr-1]] <= sack2[j]) { sz--; } alloc[sz+ptr] = j; sz++; sack[j] = (j-alloc[ptr])/c[i]*v[i]+sack2[alloc[ptr]]; } } swap(sack,sack2); } int ans=0; for(int i=0;i<=w;i++)if(ans<sack2[i])ans=sack2[i]; cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...