# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
571048 | Farhan_HY | Sličice (COCI19_slicice) | C++14 | 41 ms | 65536 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.
#include <bits/stdc++.h>
#define int long long
#define float double
#define pb push_back
#define F first
#define S second
#define T int t; cin >> t; while(t--)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
/// Benzema in the best player in the world
const int inf = 8e18;
const int N = 1e6 + 6;
const int M = 1e3 + 3;
const int LOG = 31;
const int mod = 1e9 + 7;
const float pi = atan(1) * 4;
int n, m, k, a[N], b[N], dp[505][505][505];
int Rec(int i, int rem, int cnt)
{
if (i > n)
return 0;
int &ret = dp[i][rem][cnt];
if (ret != -1)
return ret;
if (rem == 0)
ret = b[a[i] + cnt] + Rec(i + 1, rem, 0);
else
{
ret = Rec(i, rem - 1, cnt + 1);
ret = max(ret, Rec(i + 1, rem, 0) + b[a[i] + cnt]);
}
return ret;
}
main()
{
IOS
memset(dp, -1, sizeof dp);
cin >> n >> m >> k;
for(int i = 1; i <= n; i++)
cin >> a[i];
for(int i = 0; i <= m; i++)
cin >> b[i];
cout << Rec(1, k, 0);
}
///use scanf
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |