Submission #101977

#TimeUsernameProblemLanguageResultExecution timeMemory
101977someone_aaSličice (COCI19_slicice)C++17
0 / 90
9 ms1280 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; const int maxn = 55; ll dp[maxn][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++) { for(int j=0;j<=k;j++) { dp[i][j] = dp[i-1][j] + b[p[i]]; for(int c=0;c+p[i]<=m;c++) { if(j - c >= 0) dp[i][j] = max(dp[i][j], dp[i-1][j-c] + b[c+p[i]]); } result = max(result, dp[i][j]); } } cout<<result<<"\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...