oj.uz

답안 #1061125

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1061125 2024-08-16T06:28:30 Z thinknoexit Copy and Paste 3 (JOI22_copypaste3) C++17
6 / 100
 7 ms 2392 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll Base = 31;
char s[2505];
ll dp[2505][2505], h[2505], pw[2505], H[2505];
ll A, B, C;
ll val(int l, int r) {
    return h[r] - h[l - 1] * pw[r - l + 1];
}
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    bool ch = 1;
    for (int i = 1;i <= n;i++) {
        cin >> s[i];
        ch &= s[i] == 'a';
        h[i] = h[i - 1] * Base + (s[i] - 'a');
        pw[i] = pw[i - 1] * Base;
    }
    cin >> A >> B >> C;
    if (ch) {
        vector<ll> dp(n + 2, 0);
        for (int i = 1;i <= n;i++) {
            dp[i] = dp[i - 1] + A;
            for (int j = 1;j < i;j++) {
                dp[i] = min(dp[i], (dp[j] + B) + A * (i % j) + C * (i / j));
            }
        }
        cout << dp[n] << '\n';
        return 0;
    }
    for (int i = 1;i <= n;i++) {
        for (int j = i + 1;j <= n;j++) {
            dp[i][j] = (j - i + 1) * A;
        }
    }
    for (int i = 1;i <= n;i++) {
        dp[i][i] = A;
        int cnt = 1;
        for (int j = i + 1;j <= n;j++) {
            if (s[i] == s[j]) {
                cnt++;
                dp[i][j] = min(dp[i][j], A * (j - i + 1 - cnt) + A + B + cnt * C);
            }
        }
    }
    for (int k = 1;k < n;k++) {
        for (int i = k + 1;i <= n;i++) {
            H[i] = val(i - k, i);
        }
        for (int i = 1;i <= n - k;i++) {
            int j = i + k;
            dp[i][j] = min(dp[i][j], A + dp[i + 1][j]);
            dp[i][j] = min(dp[i][j], dp[i][j - 1] + A);
            int cnt = 1, prev = j;
            for (int l = j + k + 1;l <= n;l++) {
                if (H[j] == H[l]) {
                    if (l - prev > k) {
                        cnt++;
                        prev = l;
                    }
                    dp[i][l] = min(dp[i][l], A * (l - i + 1 - cnt * k) + (dp[i][j] + B) + cnt * C);
                }
            }
        }
    }
    cout << dp[1][n] << '\n';
    return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 412 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 352 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 352 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 6 ms 528 KB Output is correct
7 Correct 6 ms 352 KB Output is correct
8 Correct 6 ms 348 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 352 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 352 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 412 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 352 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 352 KB Output is correct
11 Incorrect 1 ms 2392 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 412 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 352 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 352 KB Output is correct
11 Incorrect 1 ms 2392 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 412 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 352 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 352 KB Output is correct
11 Incorrect 1 ms 2392 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 412 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 352 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 352 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 0 ms 356 KB Output is correct
13 Correct 4 ms 348 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 5 ms 348 KB Output is correct
16 Correct 6 ms 528 KB Output is correct
17 Correct 6 ms 352 KB Output is correct
18 Correct 6 ms 348 KB Output is correct
19 Correct 7 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 352 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 352 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Incorrect 1 ms 2392 KB Output isn't correct
29 Halted 0 ms 0 KB -