# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
233979 | WannnabeIOI | Visiting Singapore (NOI20_visitingsingapore) | C++14 | 183 ms | 760 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;
const int mn = -2e9;
int K, M, N, A, B;
int V[1005], S[5005], T[5005];
int dp[5][5005][5];
int main() {
ios_base::sync_with_stdio(false);
cin.tie (NULL);
cout.tie (NULL);
// freopen("inp", "r", stdin);
scanf("%d %d %d %d %d", &K, &N, &M, &A, &B);
for(int i = 1; i <= K; i++) scanf("%d", &V[i]);
for(int i = 1; i <= N; i++) scanf("%d", &S[i]);
for(int i = 1; i <= M; i++) scanf("%d", &T[i]);
for(int i = 0; i <= M; i++) {
for(int j = 1; j <= 4; j++) {
dp[0][i][j] = mn;
}
}
int ans = A + M * B;
for(int i = 1; i <= N; i++) {
int now = i % 2, bef = !now;
for(int k = 1; k <= 4; k++) dp[now][0][k] = mn;
for(int j = 1; j <= M; j++) {
if(S[i] == T[j]) {
int opt = (j == 1 ? 0 : (A + (j - 1) * B));
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... |