Submission #1265983

#	Time	Username	Problem	Language	Result	Execution time	Memory
1265983		Tymond	Copy and Paste 3 (JOI22_copypaste3)	C++20	0 / 100	1 ms	328 KiB

copypaste3

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

struct pair_hash{
  size_t operator()(const pair<int,int>&x)const{
    return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
  }
};

const int MAXN = 2507;
const ll INF = (ll)1e18;
const int P = 313;
//const int MOD[2] = {(int)1e9 + 7, (int)1e9 + 9};
const int MOD = 1e9 + 7;
ll dp[MAXN][MAXN];
int nxt[MAXN];
ll Pow[MAXN];//[2];
ll H[MAXN];//[2];
ll val[MAXN];
int v[MAXN];
int n, A, B, C;
string S;

ll getHash(int l, int p){
    return (ll)(H[p] - H[l - 1] + MOD) * Pow[n - l] % MOD;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n;
    cin >> S;
    cin >> A >> B >> C;
    S = "#" + S;
    Pow[0] = 1LL;
    for(int i = 1; i < MAXN; i++){
        Pow[i] = (ll)Pow[i - 1] * P;
        Pow[i] %= MOD;
    }

    for(int i = 0; i < MAXN; i++){
        v[i] = rng() % MOD;
    }

    for(int i = 1; i <= n; i++){
        //for(int j = 0; j < 2; j++){
            H[i] = (ll)H[i - 1] + (ll)v[S[i]] * Pow[i];
            H[i] %= MOD;
        ///}
    }

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            dp[i][j] = INF;
        }
        dp[i][i] = A;
    }

    for(int s = 1; s <= n; s++){
        unordered_map<ll, int> m;
        for(int j = n; j >= s; j--){
            val[j] = getHash(j - s + 1, j);
            nxt[j] = m[val[j]];
            if(j + s - 1 <= n){
                m[val[j + s - 1]] = j + s - 1;
            }
        }

        if(s - 1){
            for(int l = 1; l <= n - s + 1; l++){
                dp[l][l + s - 1] = min({dp[l][l + s - 1], dp[l][l + s - 2] + A, dp[l + 1][l + s - 1] + A});
            }
        }

        for(int l = 1; l <= n - s + 1; l++){
            int curr = nxt[l + s - 1];
            int cnt = 2;
            while(curr){
                dp[l][curr] = min(dp[l][curr], (ll)dp[l][l + s - 1] + B + cnt * C + (ll)A * (curr - l + 1 - cnt * s));
                cnt++;
                curr = nxt[curr];
            }
        }
    }

    // for(int i = 1; i <= n; i++){
    //     for(int j = i; j <= n; j++){
    //         cout << dp[i][j] << ' ';
    //     }
    //     cout << '\n';
    // }

    cout << dp[1][n] << '\n';

    return 0;
}

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