Submission #101978

#TimeUsernameProblemLanguageResultExecution timeMemory
101978someone_aaSličice (COCI19_slicice)C++17
90 / 90
89 ms504 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; const int maxn = 510; ll dp[2][maxn*maxn]; ll n, m, k; ll p[maxn], b[maxn]; int main() { cin>>n>>m>>k; for(int i=1;i<=n;i++) { cin>>p[i]; } for(int i=0;i<=m;i++) { cin>>b[i]; } // dp[i][k] -> prefix of size i with k more pictures ll result = 0LL; for(int i=1;i<=n;i++) { int ci = i % 2; int pi = (i-1) % 2; for(int j=0;j<=k;j++) { dp[ci][j] = dp[pi][j] + b[p[i]]; for(int c=0;c+p[i]<=m;c++) { if(j - c >= 0) dp[ci][j] = max(dp[ci][j], dp[pi][j-c] + b[c+p[i]]); } result = max(result, dp[ci][j]); } } cout<<result<<"\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...