제출 #711282

#제출 시각아이디문제언어결과실행 시간메모리
711282kostia244Copy and Paste 3 (JOI22_copypaste3)C++17
30 / 100
3072 ms34052 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], 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'; }
#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...