Submission #673639

#	Time	Username	Problem	Language	Result	Execution time	Memory
673639		abysmal	Copy and Paste 3 (JOI22_copypaste3)	C++14	62 / 100	3074 ms	280832 KiB

copypaste3

#include<iostream>
#include<stdio.h>
#include<stdint.h>
#include<vector>
#include<algorithm>
#include<utility>
#include<set>
#include<map>
#include<queue>
#include<stack>

using namespace std;

const int64_t INF = (int64_t) 1e18 + 777;
const int64_t mINF = 2500 + 5;
const int64_t MOD = 1e9 + 9;
const int nbit = 11;
const int ndig = 10;
const int nchar = 26;
const int p1 = 31;
const int p2 = 53;
const int D = 4;
int dr[D] = {0, 1, 0, -1};
int dc[D] = {1, 0, -1, 0};

struct Solution
{
    int n;
    string s;
    int64_t a;
    int64_t b;
    int64_t c;
    vector<vector<int> > nx;
    Solution() {}

    void solve()
    {
        cin >> n >> s >> a >> b >> c;
        map<pair<pair<int, int>, int> , vector<int> > mp;
        for(int i = 0; i < n; i++)
        {
            int t1 = 0;
            int t2 = 0;
            int pow1 = 1;
            int pow2 = 1;
            for(int j = i; j <= n; j++)
            {
                int ch = s[j] - 'a' + 1;

                t1 = modadd(t1, modmul(ch, pow1));
                t2 = modadd(t2, modmul(ch, pow2));
                pow1 = modmul(pow1, p1);
                pow2 = modmul(pow2, p2);

                mp[make_pair(make_pair(t1, t2), j - i)].push_back(i);
            }
        }

        nx.resize(n, vector<int>(n, -1));
        for(map<pair<pair<int, int> , int>, vector<int> >::iterator it = mp.begin(); it != mp.end(); it++)
        {
            pair<pair<int, int>, int> pr = (it)->first;
            int len = pr.second;

            Run(len, (it)->second);
        }

        vector<vector<int64_t> > dp(n, vector<int64_t>(n, INF));
        for(int i = 0; i < n; i++)
        {
            dp[i][i] = a;
        }

        for(int64_t len = 0; len < n; len++)
        {
            for(int64_t i = 0; i < n; i++)
            {
                int64_t j = i + len;
                if(len == 0 || j >= n) break;

                dp[i][j] = min(dp[i][j], dp[i][j - 1] + a);
                if(i != n - 1) dp[i][j] = min(dp[i][j], dp[i + 1][j] + a);
            }

            for(int64_t i = 0; i < n; i++)
            {
                int64_t l = i;
                int64_t j = i + len;

                int64_t cnt = 2;
                while(nx[l][len] != -1)
                {
                    int64_t nl = nx[l][len];
                    int64_t nr = nl + len;

                    int64_t x = nr - i + 1 - cnt * (len + 1);
                    dp[i][nr] = min(dp[i][nr], dp[i][j] + b + c * cnt + a * x);

                    cnt++;
                    l = nl;
                }
            }
        }

//        for(int i = 0; i < n; i++)
//        {
//            for(int j = 0; j < n; j++)
//            {
//                if(dp[i][j] == INF) cout << "I ";
//                else cout << dp[i][j] << " ";
//            }
//            cout << "\n";
//        }

        cout << dp[0][n - 1];
    }

    void Run(int len, vector<int>& pos)
    {
        int k = pos.size();
        int l = k - 2;
        int r = k - 1;

        while(l >= 0)
        {
            while(r - 1 >= 0 && pos[r - 1] > pos[l] + len) r--;

            if(pos[r] > pos[l] + len) nx[pos[l]][len] = pos[r];
            l--;
        }
    }

    int modsub(int t1, int t2)
    {
        int res = t1 - t2;
        if(res < 0) res += MOD;

        return res;
    }

    int modadd(int t1, int t2)
    {
        int res = t1 + t2;
        if(res >= MOD) res -= MOD;

        return res;
    }

    int modmul(int t1, int t2)
    {
        int64_t res = 1LL * t1 * t2;
        return (res % MOD);
    }

    bool BIT(int& mask, int& j)
    {
        return (mask & MASK(j));
    }

    int MASK(int j)
    {
        return (1 << j);
    }
};

void __startup()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

//    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);
}

int main()
{
    __startup();
    int t = 1;
//    cin >> t;

    for(int i = 1; i <= t; i++)
    {
        Solution().solve();
    }

    return 0;
}

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