# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100323 | AKaan37 | Sličice (COCI19_slicice) | C++14 | 563 ms | 4324 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.
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//Bismillahirrahmanirrahim
#include <bits/stdc++.h>
using namespace std;
typedef long long int lo;
typedef pair< int,int > PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(lo i=1;i<=n;i++)
#define mid (bas+son)/2
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 3000005;
const lo mod = 1000000007;
lo n,m,cev,b[li],a[li],k,dp[705][705];
string s;
vector<lo> v;
lo f(lo sira,lo hak){
//~ cout<<hak<<" "<<sira<<endl;
lo mx=-inf;
if(hak<0) return -inf;
if(sira>n) return 0;
if(~dp[sira][hak]) return dp[sira][hak];
for(int i=0;i<=500;i++){
//~ if(e)
mx=max(mx,f(sira+1,hak-i)+b[a[sira]+i]);
}
return dp[sira][hak]=mx;
}
int main(){
memset(dp,-1,sizeof(dp));
scanf("%lld %lld %lld",&n,&m,&k);
FOR{
scanf("%lld",&a[i]);
}
for (lo i = 0; i <= m; i++){
scanf("%lld",&b[i]);
}
for(lo i=m+1;i<=500;i++) b[i]=0;
printf("%lld\n",f(1,k));
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |