Submission #922706

#	Time	Username	Problem	Language	Result	Execution time	Memory
922706		huutuan	Copy and Paste 3 (JOI22_copypaste3)	C++14	57 / 100	3095 ms	705156 KiB

copypaste3

#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>

using namespace std;

#define int long long
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define isz(x) ((int)x.size())
#define sumof(x) accumulate(all(x), 0ll)

pair<int, int> mod={(int)1e9+7, (int)1e9+9};
const int base=311;

struct Hash{
   pair<int, int> value;
   Hash (int x=0){
      value={x%mod.first, x%mod.second};
   }
   Hash (int x, int y){
      value={x, y};
   }
   Hash operator-(){
      return Hash((mod.first-value.first)%mod.first, 
                  (mod.second-value.second)%mod.second);
   }
   Hash operator+(Hash b){
      return Hash((value.first+b.value.first)%mod.first, 
                  (value.second+b.value.second)%mod.second);
   }
   Hash operator*(Hash b){
      return Hash(value.first*b.value.first%mod.first, 
                  value.second*b.value.second%mod.second);
   }
   bool operator<(Hash b) const {
      return value<b.value;
   }
   bool operator==(Hash b) const {
      return value==b.value;
   }
};

const int N=2510, LG=12;
int f[N][N], add, cut, paste, n;
vector<pair<int, int>> g[N][N];
Hash pf[N];
Hash pw[N];
string s;

Hash get(int l, int r){
   return pf[r]+(-pf[l-1])*pw[r-l+1];
}

void precalc(){
   pw[0]=1;
   for (int i=1; i<=n; ++i){
      pw[i]=pw[i-1]*base;
   }
   for (int i=1; i<=n; ++i){
      pf[i]=pf[i-1]*base+s[i];
   }
   for (int len=1; len<=n; ++len){
      map<Hash, vector<int>> mp;
      for (int r=len; r<=n; ++r){
         int l=r-len+1;
         mp[get(l, r)].push_back(l);
      }
      for (auto &tmp:mp){
         vector<int> &v=tmp.second;
         vector<int> jump(isz(v));
         for (int i=0, j=0; i<isz(v); ++i){
            while (j<isz(v) && v[j]-v[i]<len) ++j;
            jump[i]=j;
         }
         for (int i=0; i<isz(v); ++i){
            int j=jump[i], cnt=2;
            while (j!=isz(v)){
               g[v[i]][v[j]+len-1].emplace_back(len, cnt);
               j=jump[j];
               ++cnt;
            }
         }
      }
   }
}

int dp(int l, int r){
   if (l>r) return 0;
   if (f[l][r]!=-1) return f[l][r];
   int res=min(dp(l, r-1)+add, dp(l+1, r)+add);
   for (auto &t:g[l][r]){
      res=min(res, dp(l, l+t.first-1)+cut+t.second*paste+add*(r-l+1-t.second*t.first));
   }
   return f[l][r]=res;
}

void solve(){
   memset(f, -1, sizeof f);
   cin >> n >> s;
   s=" "+s;
   precalc();
   cin >> add >> cut >> paste;
   cout << dp(1, n); 
}

int32_t main(){
   #ifdef sus
   freopen("cf.inp", "r", stdin);
   #endif
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   int ntests=1;
   // cin >> ntests;
   for (int i=1; i<=ntests; ++i) solve();
   return 0;
}

• Subtask 1: 1 / 1
• Subtask 2: 0 / 5
• Subtask 3: 14 / 14
• Subtask 4: 10 / 10
• Subtask 5: 32 / 32
• Subtask 6: 0 / 38