# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
567889 | dantoh000 | Copy and Paste 3 (JOI22_copypaste3) | C++14 | 1 ms | 596 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;
typedef long long ll;
int n;
string s;
int a,b,c;
ll mem[205][205];
ll dp(int i, int j){
if (i == j){
return a;
}
else if (mem[i][j] != -1) return mem[i][j];
ll ans = min(dp(i+1,j) + a, dp(i, j-1) + a);
for (int k = i; k < j; k++){
int len = k-i+1;
int cur = k+1;
ll cons = dp(i,k);
ll C = cons + b;
while (cur+len <= j){
bool can = true;
for (int L = 0; L < len; L++){
if (s[cur+L] != s[i+L]) can = false;
}
if (can){
C += c;
cur += len;
}
else{
C += a;
cur++;
}
}
C += (ll)(j-cur+1)*a;
ans = min(ans,C);
}
return mem[i][j] = ans;
}
int main(){
scanf("%d",&n);
cin >> s;
scanf("%d%d%d",&a,&b,&c);
memset(mem,-1,sizeof(mem));
printf("%d\n",dp(0,n-1));
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |