# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
719638 | lam | Copy and Paste 3 (JOI22_copypaste3) | C++14 | 80 ms | 81772 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>
#define int long long
using namespace std;
int n,a,b,c;
string s;
const int maxn = 5010;
int dp[maxn][maxn];
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
cin>>n;
cin>>s;
cin>>a>>b>>c;
for (int i=0; i<=n; i++)
for (int j=0; j<=n; j++) dp[i][j] = 1e18;
dp[0][0] = 0;
for (int i=0; i<n; i++)
for (int len=0; len<=n; len++)
{
if (dp[i][len]==1e18) continue;
dp[i][i] = min(dp[i][i],dp[i][len] + b+c);
dp[i+len][len] = min(dp[i+len][len],dp[i][len] + c);
dp[i+1][len] = min(dp[i+1][len],dp[i][len] + a);
}
int ans = 1e18;
for (int len=0; len<=n; len++) ans=min(ans,dp[n][len]); cout<<ans<<'\n';
}
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... |