Submission #711279

#TimeUsernameProblemLanguageResultExecution timeMemory
711279kostia244Copy and Paste 3 (JOI22_copypaste3)C++17
25 / 100
3078 ms20492 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...