# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
691593 | penguin133 | Visiting Singapore (NOI20_visitingsingapore) | C++17 | 918 ms | 197332 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>
using namespace std;
#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
int S[5005], T[5005], V[5005], memo[5005][5005], n, m, k, a, b;
int dp(int x, int y){
if(x == n + 1 || y == m + 1)return 0;
if(memo[x][y] != -1)return memo[x][y];
int res = max(dp(x+1, y), dp(x, y+1));
if(S[x] == T[y])res = max(res, dp(x+1, y+1) + V[S[x]]);
return memo[x][y] = res;
}
void solve(){
cin >> k >> n >> m >> a >> b;
for(int i=1;i<=k;i++)cin >> V[i];
for(int i=1;i<=n;i++)cin >> S[i];
for(int i=1;i<=m;i++)cin >> T[i];
memset(memo, -1, sizeof(memo));
cout << dp(1, 1) << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |