# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48307 | choikiwon | 도장 모으기 (JOI14_stamps) | C++17 | 1055 ms | 262144 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 = 3010;
int N, T;
int U[MN], V[MN], D[MN], E[MN];
int cc[MN][MN][2][2];
int dp(int idx, int open, int t, int d) {
if(idx == N) return open? 1e9 : 0;
int &ret = cc[idx][open][t][d];
if(ret != -1) return ret;
ret = 1e9;
if(t) {
if(open <= N) ret = min(ret, dp(idx, open + 1, 1, d | 1) + V[idx] + D[idx]);
ret = min(ret, dp(idx, open, 0, d));
}
else {
if(open) ret = min(ret, dp(idx, open - 1, 0, d | 1) + U[idx] + E[idx]);
if(d) ret = min(ret, dp(idx + 1, open, 1, 0) + T * (2 * open + 1));
else {
int cost = U[idx] + V[idx];
if(open) cost = min(cost, D[idx] + E[idx]);
ret = min(ret, dp(idx + 1, open, 1, 0) + cost + T * (2 * open + 1));
}
}
return ret;
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... |