# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
711279 | kostia244 | Copy and Paste 3 (JOI22_copypaste3) | C++17 | 3078 ms | 20492 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;
using ll = long long;
const int N = 2525;
int n;
ll a, b, c;
ll dp[N][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++) {
for(int l = r; l >= 0; l--) {
dp[r][l] = (r > l ? dp[r - 1][l] : 0) + a;
}
for(int l = r; l >= 0; l--) {//copy string
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;
}
dp[r][p] = min(dp[r][p], (r - p + 1 - len * cnt) * a + cnt * c + dp[r][l] + b);
}
}
}
cout << dp[n - 1][0] << '\n';
}
# | 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... |