Submission #547020

#TimeUsernameProblemLanguageResultExecution timeMemory
547020ngraceCopy and Paste 3 (JOI22_copypaste3)C++14
25 / 100
3088 ms260736 KiB
#include <vector> #include <iostream> #include <utility> #include <algorithm> #include <map> #include <set> #include <string> using namespace std; #define v vector #define ll long long #define pii pair<int,int> #define fi first #define se second int main(){ int N; cin>>N; string S; cin>>S; ll A,B,C; cin>>A>>B>>C; map<pii, ll> pairToHash; map<ll, set<int>> hashToStarts; ll m=1e9+9, p=31; for(int l=0; l<N; l++){ string sub=""; ll hash=0, pow=1; for(int r=l; r<N; r++){ hash = (hash + (S[r]-'a'+1) * pow) % m; pow = (pow * p) % m; pairToHash[{l,r-l+1}] = hash; hashToStarts[pairToHash[{l,r-l+1}]].insert(l); } } v<v<int>> nextOccur(N,v<int>(N+1,N)); for(int i=N-1; i>=0; i--){ for(int s=1; s<=N-i; s++){ int ind=pairToHash[{i,s}]; auto next = hashToStarts[ind].lower_bound(i+s); if(next!=hashToStarts[ind].end()) nextOccur[i][s]=(*next); } } v<v<ll>> dp(N, v<ll>(N,1e17)); for(int s=1; s<=N; s++){ for(int l=N-1; l>=0; l--){ dp[l][l]=A; if(s!=1 && l+s-1<N){ dp[l][l+s-1] = min(dp[l][l+s-1], A+dp[l+1][l+s-1]); dp[l][l+s-1] = min(dp[l][l+s-1], dp[l][l+s-1-1]+A); } int num=2, nex=nextOccur[l][s]; while(nex<N){ int r=nex+s-1; dp[l][r] = min(dp[l][r], dp[l][l+s-1]+B+C*num+(r-l+1 - num*s)*A); dp[l][r] = min(dp[l][r], A+dp[l+1][r]); dp[l][r] = min(dp[l][r], dp[l][r-1]+A); nex=nextOccur[nex][s]; num++; } } } cout<<dp[0][N-1]<<endl; }
#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...