oj.uz

Submission #963935

# Submission time Handle Problem Language Result Execution time Memory
963935 2024-04-16T04:25:47 Z GrindMachine Copy and Paste 3 (JOI22_copypaste3) C++17
62 / 100
 3000 ms 254228 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://codeforces.com/blog/entry/101003?#comment-897398

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<int> ps = {5791, 8237, 3067, 6991, 3527};
vector<int> mods = {791139137, 433567597, 271149607, 561259969, 222708581};
ll pows[N][2];

void precalc() {
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

    shuffle(all(ps), rng);
    shuffle(all(mods), rng);

    rep(j, 2) {
        pows[0][j] = 1;
        rep1(i, N - 1) {
            pows[i][j] = pows[i - 1][j] * ps[j] % mods[j];
        }
    }
}

void solve(int test_case)
{
    precalc();

    ll n; cin >> n;
    string s; cin >> s;
    s = "$" + s;
    ll A,B,C; cin >> A >> B >> C;

    map<array<ll,2>,vector<pll>> mp;

    rep1(i,n){
        array<ll,2> hsh = {0,0};
        for(int j = i; j <= n; ++j){
            rep(x,2){
                hsh[x] = (hsh[x]*ps[x]+s[j]-'a'+1)%mods[x];
            }

            mp[hsh].pb({i,j});
        }
    }

    ll nxt[n+5][n+5];
    memset(nxt,-1,sizeof nxt);

    for(auto [hsh,pos] : mp){
        ll ptr = 0;
        pos.pb({inf1,inf1});
        for(auto [i,j] : pos){
            if(i > n) break;
            while(pos[ptr].ff <= j){
                ptr++;
            }

            nxt[i][j] = pos[ptr].ff;
        }
    }

    ll dp[n+5][n+5];
    memset(dp,0x3f,sizeof dp);
    rep1(i,n){
        dp[i][i] = A;
    }

    for(int d = 1; d <= n; ++d){
        rep1(i,n){
            ll j = i+d-1;
            amin(dp[i][j],dp[i+1][j]+A);
            amin(dp[i][j],dp[i][j-1]+A);

            ll l = i, r = j;
            ll paste = 1;

            while(true){
                ll l2 = nxt[l][r];
                ll r2 = l2+j-i;
                l = l2, r = r2;
                if(l > n or l < 1) break;
                paste++;
                ll type = (r2-i+1)-(j-i+1)*paste;
                amin(dp[i][r2],dp[i][j]+B+paste*C+type*A);
            }
        }
    }

    ll ans = dp[1][n];
    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 2 ms 2020 KB Output is correct
4 Correct 2 ms 1884 KB Output is correct
5 Correct 2 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 2 ms 1884 KB Output is correct
8 Correct 3 ms 1884 KB Output is correct
9 Correct 4 ms 1880 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 2 ms 1848 KB Output is correct
3 Correct 391 ms 89208 KB Output is correct
4 Correct 501 ms 103252 KB Output is correct
5 Correct 677 ms 120516 KB Output is correct
6 Correct 719 ms 141552 KB Output is correct
7 Correct 843 ms 165392 KB Output is correct
8 Correct 897 ms 165436 KB Output is correct
9 Correct 836 ms 165432 KB Output is correct
10 Correct 3 ms 1880 KB Output is correct
11 Correct 3 ms 1884 KB Output is correct
12 Correct 3 ms 1884 KB Output is correct
13 Correct 2 ms 1880 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 3 ms 1884 KB Output is correct
16 Correct 3 ms 2024 KB Output is correct
17 Correct 2 ms 1884 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 2 ms 2020 KB Output is correct
4 Correct 2 ms 1884 KB Output is correct
5 Correct 2 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 2 ms 1884 KB Output is correct
8 Correct 3 ms 1884 KB Output is correct
9 Correct 4 ms 1880 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 2 ms 1884 KB Output is correct
12 Correct 2 ms 1884 KB Output is correct
13 Correct 2 ms 1884 KB Output is correct
14 Correct 2 ms 2028 KB Output is correct
15 Correct 2 ms 1884 KB Output is correct
16 Correct 2 ms 2028 KB Output is correct
17 Correct 3 ms 1880 KB Output is correct
18 Correct 3 ms 1880 KB Output is correct
19 Correct 2 ms 1884 KB Output is correct
20 Correct 2 ms 1884 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 2 ms 2044 KB Output is correct
23 Correct 3 ms 2020 KB Output is correct
24 Correct 2 ms 2136 KB Output is correct
25 Correct 3 ms 1884 KB Output is correct
26 Correct 3 ms 1880 KB Output is correct
27 Correct 2 ms 2020 KB Output is correct
28 Correct 3 ms 1884 KB Output is correct
29 Correct 2 ms 1884 KB Output is correct
30 Correct 2 ms 1880 KB Output is correct
31 Correct 2 ms 1884 KB Output is correct
32 Correct 3 ms 2024 KB Output is correct
33 Correct 2 ms 1884 KB Output is correct
34 Correct 2 ms 1884 KB Output is correct
35 Correct 2 ms 1884 KB Output is correct
36 Correct 3 ms 1884 KB Output is correct
37 Correct 3 ms 1880 KB Output is correct
38 Correct 2 ms 1884 KB Output is correct
39 Correct 2 ms 1884 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 2 ms 2020 KB Output is correct
4 Correct 2 ms 1884 KB Output is correct
5 Correct 2 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 2 ms 1884 KB Output is correct
8 Correct 3 ms 1884 KB Output is correct
9 Correct 4 ms 1880 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 2 ms 1884 KB Output is correct
12 Correct 2 ms 1884 KB Output is correct
13 Correct 2 ms 1884 KB Output is correct
14 Correct 2 ms 2028 KB Output is correct
15 Correct 2 ms 1884 KB Output is correct
16 Correct 2 ms 2028 KB Output is correct
17 Correct 3 ms 1880 KB Output is correct
18 Correct 3 ms 1880 KB Output is correct
19 Correct 2 ms 1884 KB Output is correct
20 Correct 2 ms 1884 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 2 ms 2044 KB Output is correct
23 Correct 3 ms 2020 KB Output is correct
24 Correct 2 ms 2136 KB Output is correct
25 Correct 3 ms 1884 KB Output is correct
26 Correct 3 ms 1880 KB Output is correct
27 Correct 2 ms 2020 KB Output is correct
28 Correct 3 ms 1884 KB Output is correct
29 Correct 2 ms 1884 KB Output is correct
30 Correct 2 ms 1880 KB Output is correct
31 Correct 2 ms 1884 KB Output is correct
32 Correct 3 ms 2024 KB Output is correct
33 Correct 2 ms 1884 KB Output is correct
34 Correct 2 ms 1884 KB Output is correct
35 Correct 2 ms 1884 KB Output is correct
36 Correct 3 ms 1884 KB Output is correct
37 Correct 3 ms 1880 KB Output is correct
38 Correct 2 ms 1884 KB Output is correct
39 Correct 2 ms 1884 KB Output is correct
40 Correct 3 ms 2396 KB Output is correct
41 Correct 4 ms 3144 KB Output is correct
42 Correct 9 ms 4696 KB Output is correct
43 Correct 9 ms 4696 KB Output is correct
44 Correct 10 ms 4864 KB Output is correct
45 Correct 11 ms 4840 KB Output is correct
46 Correct 10 ms 4696 KB Output is correct
47 Correct 7 ms 3928 KB Output is correct
48 Correct 8 ms 4188 KB Output is correct
49 Correct 8 ms 4188 KB Output is correct
50 Correct 8 ms 4184 KB Output is correct
51 Correct 8 ms 3932 KB Output is correct
52 Correct 10 ms 4016 KB Output is correct
53 Correct 11 ms 4696 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 2 ms 2020 KB Output is correct
4 Correct 2 ms 1884 KB Output is correct
5 Correct 2 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 2 ms 1884 KB Output is correct
8 Correct 3 ms 1884 KB Output is correct
9 Correct 4 ms 1880 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 2 ms 1884 KB Output is correct
12 Correct 2 ms 1884 KB Output is correct
13 Correct 2 ms 1884 KB Output is correct
14 Correct 2 ms 2028 KB Output is correct
15 Correct 2 ms 1884 KB Output is correct
16 Correct 2 ms 2028 KB Output is correct
17 Correct 3 ms 1880 KB Output is correct
18 Correct 3 ms 1880 KB Output is correct
19 Correct 2 ms 1884 KB Output is correct
20 Correct 2 ms 1884 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 2 ms 2044 KB Output is correct
23 Correct 3 ms 2020 KB Output is correct
24 Correct 2 ms 2136 KB Output is correct
25 Correct 3 ms 1884 KB Output is correct
26 Correct 3 ms 1880 KB Output is correct
27 Correct 2 ms 2020 KB Output is correct
28 Correct 3 ms 1884 KB Output is correct
29 Correct 2 ms 1884 KB Output is correct
30 Correct 2 ms 1880 KB Output is correct
31 Correct 2 ms 1884 KB Output is correct
32 Correct 3 ms 2024 KB Output is correct
33 Correct 2 ms 1884 KB Output is correct
34 Correct 2 ms 1884 KB Output is correct
35 Correct 2 ms 1884 KB Output is correct
36 Correct 3 ms 1884 KB Output is correct
37 Correct 3 ms 1880 KB Output is correct
38 Correct 2 ms 1884 KB Output is correct
39 Correct 2 ms 1884 KB Output is correct
40 Correct 3 ms 2396 KB Output is correct
41 Correct 4 ms 3144 KB Output is correct
42 Correct 9 ms 4696 KB Output is correct
43 Correct 9 ms 4696 KB Output is correct
44 Correct 10 ms 4864 KB Output is correct
45 Correct 11 ms 4840 KB Output is correct
46 Correct 10 ms 4696 KB Output is correct
47 Correct 7 ms 3928 KB Output is correct
48 Correct 8 ms 4188 KB Output is correct
49 Correct 8 ms 4188 KB Output is correct
50 Correct 8 ms 4184 KB Output is correct
51 Correct 8 ms 3932 KB Output is correct
52 Correct 10 ms 4016 KB Output is correct
53 Correct 11 ms 4696 KB Output is correct
54 Correct 58 ms 15824 KB Output is correct
55 Correct 82 ms 28244 KB Output is correct
56 Correct 639 ms 72108 KB Output is correct
57 Correct 616 ms 72192 KB Output is correct
58 Correct 542 ms 72272 KB Output is correct
59 Correct 616 ms 72252 KB Output is correct
60 Correct 602 ms 72552 KB Output is correct
61 Correct 442 ms 51248 KB Output is correct
62 Correct 105 ms 30152 KB Output is correct
63 Correct 585 ms 60988 KB Output is correct
64 Correct 627 ms 61876 KB Output is correct
65 Correct 473 ms 51016 KB Output is correct
66 Correct 476 ms 50808 KB Output is correct
67 Correct 618 ms 72348 KB Output is correct

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 2 ms 2020 KB Output is correct
4 Correct 2 ms 1884 KB Output is correct
5 Correct 2 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 2 ms 1884 KB Output is correct
8 Correct 3 ms 1884 KB Output is correct
9 Correct 4 ms 1880 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 2 ms 1884 KB Output is correct
12 Correct 2 ms 1848 KB Output is correct
13 Correct 391 ms 89208 KB Output is correct
14 Correct 501 ms 103252 KB Output is correct
15 Correct 677 ms 120516 KB Output is correct
16 Correct 719 ms 141552 KB Output is correct
17 Correct 843 ms 165392 KB Output is correct
18 Correct 897 ms 165436 KB Output is correct
19 Correct 836 ms 165432 KB Output is correct
20 Correct 3 ms 1880 KB Output is correct
21 Correct 3 ms 1884 KB Output is correct
22 Correct 3 ms 1884 KB Output is correct
23 Correct 2 ms 1880 KB Output is correct
24 Correct 2 ms 1884 KB Output is correct
25 Correct 3 ms 1884 KB Output is correct
26 Correct 3 ms 2024 KB Output is correct
27 Correct 2 ms 1884 KB Output is correct
28 Correct 2 ms 1884 KB Output is correct
29 Correct 2 ms 1884 KB Output is correct
30 Correct 2 ms 1884 KB Output is correct
31 Correct 2 ms 2028 KB Output is correct
32 Correct 2 ms 1884 KB Output is correct
33 Correct 2 ms 2028 KB Output is correct
34 Correct 3 ms 1880 KB Output is correct
35 Correct 3 ms 1880 KB Output is correct
36 Correct 2 ms 1884 KB Output is correct
37 Correct 2 ms 1884 KB Output is correct
38 Correct 2 ms 1884 KB Output is correct
39 Correct 2 ms 2044 KB Output is correct
40 Correct 3 ms 2020 KB Output is correct
41 Correct 2 ms 2136 KB Output is correct
42 Correct 3 ms 1884 KB Output is correct
43 Correct 3 ms 1880 KB Output is correct
44 Correct 2 ms 2020 KB Output is correct
45 Correct 3 ms 1884 KB Output is correct
46 Correct 2 ms 1884 KB Output is correct
47 Correct 2 ms 1880 KB Output is correct
48 Correct 2 ms 1884 KB Output is correct
49 Correct 3 ms 2024 KB Output is correct
50 Correct 2 ms 1884 KB Output is correct
51 Correct 2 ms 1884 KB Output is correct
52 Correct 2 ms 1884 KB Output is correct
53 Correct 3 ms 1884 KB Output is correct
54 Correct 3 ms 1880 KB Output is correct
55 Correct 2 ms 1884 KB Output is correct
56 Correct 2 ms 1884 KB Output is correct
57 Correct 3 ms 2396 KB Output is correct
58 Correct 4 ms 3144 KB Output is correct
59 Correct 9 ms 4696 KB Output is correct
60 Correct 9 ms 4696 KB Output is correct
61 Correct 10 ms 4864 KB Output is correct
62 Correct 11 ms 4840 KB Output is correct
63 Correct 10 ms 4696 KB Output is correct
64 Correct 7 ms 3928 KB Output is correct
65 Correct 8 ms 4188 KB Output is correct
66 Correct 8 ms 4188 KB Output is correct
67 Correct 8 ms 4184 KB Output is correct
68 Correct 8 ms 3932 KB Output is correct
69 Correct 10 ms 4016 KB Output is correct
70 Correct 11 ms 4696 KB Output is correct
71 Correct 58 ms 15824 KB Output is correct
72 Correct 82 ms 28244 KB Output is correct
73 Correct 639 ms 72108 KB Output is correct
74 Correct 616 ms 72192 KB Output is correct
75 Correct 542 ms 72272 KB Output is correct
76 Correct 616 ms 72252 KB Output is correct
77 Correct 602 ms 72552 KB Output is correct
78 Correct 442 ms 51248 KB Output is correct
79 Correct 105 ms 30152 KB Output is correct
80 Correct 585 ms 60988 KB Output is correct
81 Correct 627 ms 61876 KB Output is correct
82 Correct 473 ms 51016 KB Output is correct
83 Correct 476 ms 50808 KB Output is correct
84 Correct 618 ms 72348 KB Output is correct
85 Correct 1961 ms 176896 KB Output is correct
86 Execution timed out 3098 ms 254228 KB Time limit exceeded
87 Halted 0 ms 0 KB -