Submission #711282

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
711282	2023-03-16 13:10:46	kostia244	Copy and Paste 3 (JOI22_copypaste3)	C++17	30 / 100	3072 ms	34052 KiB

copypaste3

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2525;
int n;
ll a, b, c;
ll dp[N][N], best[N];
string s;
int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> s >> a >> b >> c;
    for(int r = 0; r < n; r++) {
        memset(best, 0x3f, sizeof best);
        for(int l = r; l >= 0; l--) {//copy string
            best[l] = min(best[l], best[l + 1]);
            dp[r][l] = min((r > l ? dp[r - 1][l] : 0) + a, (r - l + 1) * a + best[l]);
            int lst = n + 1, len = r - l + 1, cnt = 0;
            for(int p = l; p >= 0; p--) {
                if(p + len - 1 < lst &&
                     s.substr(p, len) == s.substr(l, len)) {
                    cnt++;
                    lst = p;
                    best[p] = min(best[p], (-len * a + c) * cnt + dp[r][l] + b);
                }
            }
        }
    }
    cout << dp[n - 1][0] << '\n';
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 1 / 1
• Subtask 2: 5 / 5
• Subtask 3: 14 / 14
• Subtask 4: 10 / 10
• Subtask 5: 0 / 32
• Subtask 6: 0 / 38