# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
340929 | mihai145 | Visiting Singapore (NOI20_visitingsingapore) | C++14 | 1272 ms | 640 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 <iostream>
using namespace std;
/*
ifstream cin("txt.in");
ofstream cout("txt.out");
*/
const int INF = -1e9;
const int KMAX = 1000;
const int NMAX = 5000;
int K, N, M, A, B;
int dp[2][NMAX + 5][2][2];
int v[KMAX + 5], s[NMAX + 5], t[NMAX + 5];
void Upd(int i, int j, int x, int y)
{
if(i < N && j < M && s[i + 1] == t[j + 1])
{
dp[!(i & 1)][j + 1][0][0] = max(dp[!(i & 1)][j + 1][0][0], dp[i & 1][j][x][y] + v[s[i + 1]]);
}
if(i < N)
{
dp[!(i & 1)][j][1][y] = max(dp[!(i & 1)][j][1][y], dp[i & 1][j][x][y] + B + ((x == 0) ? A : 0));
}
# | 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... |