Submission #64558388

Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define rg register
using namespace std;
const int N = 810;
int read() {
    int x = 0, f = 1;
    char c = getchar();
    while(c < '0' || c > '9')
        f = (c == '-') ? -1 : 1, c = getchar();
    while(c >= '0' && c <= '9')
        x = x * 10 + c - 48, c = getchar();
    return f * x;
}
int f[N][N];
int c[N], x[N];
int dfs(int l, int r) {
    if(r < l)
        return 0;
    if(f[l][r])
        return f[l][r];
    int minx = 1e16;
    for(int i = l; i < r; i++) {
        minx = min(dfs(l, i) + dfs(i + 1, r), minx);
        if(i != l)
            minx = min(dfs(l, i) + dfs(i, r), minx);
    }
    if(c[l] == c[r]) {
        int ans = r - l + 1 + x[c[l]];
        int last = l;
        minx = min(minx, ans + dfs(l + 1, r - 1));
        for(int i = l + 1; i <= r; i++) {
            if(c[i] == c[l]) {
                ans += dfs(last + 1, i - 1);
                last = i;
            }
        }
        minx = min(minx, ans);
    }
    return f[l][r] = minx;
}
signed main() {
    int n = read();
    for(int i = 1; i <= n; i++)
        c[i] = c[i + n] = read();
    for(int i = 1; i <= n; i++)
        x[i] = read();
    int minx = 1e16;
    for(int i = 1; i <= n; i++)
        minx = min(minx, dfs(i, i + n - 1));
    cout << minx << "\n";
}

Submission Info

Submission Time
Task F - Happy Birthday! 3
User hbx
Language C++ 20 (gcc 12.2)
Score 0
Code Size 1352 Byte
Status WA
Exec Time 147 ms
Memory 8388 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 550
Status
AC × 3
AC × 36
WA × 9
Set Name Test Cases
Sample sample00.txt, sample01.txt, sample02.txt
All sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt, testcase24.txt, testcase25.txt, testcase26.txt, testcase27.txt, testcase28.txt, testcase29.txt, testcase30.txt, testcase31.txt, testcase32.txt, testcase33.txt, testcase34.txt, testcase35.txt, testcase36.txt, testcase37.txt, testcase38.txt, testcase39.txt, testcase40.txt, testcase41.txt
Case Name Status Exec Time Memory
sample00.txt AC 1 ms 3416 KiB
sample01.txt AC 1 ms 3604 KiB
sample02.txt AC 1 ms 3704 KiB
testcase00.txt AC 122 ms 8388 KiB
testcase01.txt AC 119 ms 8388 KiB
testcase02.txt AC 119 ms 8184 KiB
testcase03.txt AC 94 ms 8196 KiB
testcase04.txt AC 94 ms 8304 KiB
testcase05.txt AC 94 ms 8232 KiB
testcase06.txt AC 73 ms 7104 KiB
testcase07.txt AC 146 ms 8180 KiB
testcase08.txt AC 44 ms 6396 KiB
testcase09.txt AC 147 ms 8196 KiB
testcase10.txt AC 37 ms 6196 KiB
testcase11.txt AC 147 ms 8388 KiB
testcase12.txt AC 4 ms 4484 KiB
testcase13.txt AC 126 ms 8308 KiB
testcase14.txt AC 29 ms 6100 KiB
testcase15.txt AC 125 ms 8232 KiB
testcase16.txt AC 58 ms 7036 KiB
testcase17.txt AC 125 ms 8256 KiB
testcase18.txt WA 6 ms 4776 KiB
testcase19.txt AC 111 ms 8240 KiB
testcase20.txt AC 3 ms 4344 KiB
testcase21.txt WA 111 ms 8180 KiB
testcase22.txt WA 64 ms 7356 KiB
testcase23.txt WA 111 ms 8232 KiB
testcase24.txt WA 19 ms 5764 KiB
testcase25.txt WA 105 ms 8240 KiB
testcase26.txt WA 29 ms 6348 KiB
testcase27.txt WA 105 ms 8196 KiB
testcase28.txt AC 4 ms 4608 KiB
testcase29.txt WA 105 ms 8196 KiB
testcase30.txt AC 4 ms 4564 KiB
testcase31.txt AC 94 ms 8200 KiB
testcase32.txt AC 43 ms 7012 KiB
testcase33.txt AC 94 ms 8196 KiB
testcase34.txt AC 2 ms 3968 KiB
testcase35.txt AC 94 ms 8116 KiB
testcase36.txt AC 22 ms 6076 KiB
testcase37.txt AC 94 ms 8200 KiB
testcase38.txt AC 40 ms 6908 KiB
testcase39.txt AC 94 ms 8176 KiB
testcase40.txt AC 16 ms 5672 KiB
testcase41.txt AC 95 ms 8388 KiB