oj.uz

Submission #963938

# Submission time Handle Problem Language Result Execution time Memory
963938 2024-04-16T04:28:59 Z GrindMachine Copy and Paste 3 (JOI22_copypaste3) C++17
100 / 100
 1296 ms 198260 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;

    vector<array<ll,4>> hashes;

    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];
            }

            hashes.pb({hsh[0],hsh[1],i,j});
        }
    }

    sort(all(hashes));
    hashes.pb({inf2,inf2,-1,-1});

    ll nxt[n+5][n+5];
    memset(nxt,-1,sizeof nxt);
    vector<pll> pos;

    rep(i,sz(hashes)){
        if(i and (hashes[i][0] != hashes[i-1][0] or hashes[i][1] != hashes[i-1][1])){
            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;
            }

            pos.clear();
        }

        pos.pb({hashes[i][2],hashes[i][3]});
    }

    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 2024 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 2 ms 2024 KB Output is correct
4 Correct 2 ms 1888 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 3 ms 1784 KB Output is correct
10 Correct 3 ms 1884 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1880 KB Output is correct
2 Correct 2 ms 2024 KB Output is correct
3 Correct 571 ms 106904 KB Output is correct
4 Correct 700 ms 124720 KB Output is correct
5 Correct 938 ms 145396 KB Output is correct
6 Correct 1028 ms 169512 KB Output is correct
7 Correct 1296 ms 198248 KB Output is correct
8 Correct 1253 ms 198208 KB Output is correct
9 Correct 1234 ms 198092 KB Output is correct
10 Correct 2 ms 2040 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 1884 KB Output is correct
15 Correct 2 ms 1884 KB Output is correct
16 Correct 3 ms 1884 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 2024 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 2 ms 2024 KB Output is correct
4 Correct 2 ms 1888 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 3 ms 1784 KB Output is correct
10 Correct 3 ms 1884 KB Output is correct
11 Correct 2 ms 1880 KB Output is correct
12 Correct 2 ms 1884 KB Output is correct
13 Correct 3 ms 2028 KB Output is correct
14 Correct 2 ms 1880 KB Output is correct
15 Correct 3 ms 1884 KB Output is correct
16 Correct 3 ms 1884 KB Output is correct
17 Correct 2 ms 1884 KB Output is correct
18 Correct 2 ms 1880 KB Output is correct
19 Correct 3 ms 2196 KB Output is correct
20 Correct 2 ms 1896 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 3 ms 1884 KB Output is correct
23 Correct 2 ms 1884 KB Output is correct
24 Correct 2 ms 1884 KB Output is correct
25 Correct 2 ms 2016 KB Output is correct
26 Correct 2 ms 1884 KB Output is correct
27 Correct 2 ms 1884 KB Output is correct
28 Correct 2 ms 1880 KB Output is correct
29 Correct 2 ms 2024 KB Output is correct
30 Correct 2 ms 1884 KB Output is correct
31 Correct 3 ms 2016 KB Output is correct
32 Correct 2 ms 1884 KB Output is correct
33 Correct 2 ms 1884 KB Output is correct
34 Correct 2 ms 1884 KB Output is correct
35 Correct 3 ms 2024 KB Output is correct
36 Correct 2 ms 1884 KB Output is correct
37 Correct 2 ms 2028 KB Output is correct
38 Correct 2 ms 1884 KB Output is correct
39 Correct 3 ms 1880 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2024 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 2 ms 2024 KB Output is correct
4 Correct 2 ms 1888 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 3 ms 1784 KB Output is correct
10 Correct 3 ms 1884 KB Output is correct
11 Correct 2 ms 1880 KB Output is correct
12 Correct 2 ms 1884 KB Output is correct
13 Correct 3 ms 2028 KB Output is correct
14 Correct 2 ms 1880 KB Output is correct
15 Correct 3 ms 1884 KB Output is correct
16 Correct 3 ms 1884 KB Output is correct
17 Correct 2 ms 1884 KB Output is correct
18 Correct 2 ms 1880 KB Output is correct
19 Correct 3 ms 2196 KB Output is correct
20 Correct 2 ms 1896 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 3 ms 1884 KB Output is correct
23 Correct 2 ms 1884 KB Output is correct
24 Correct 2 ms 1884 KB Output is correct
25 Correct 2 ms 2016 KB Output is correct
26 Correct 2 ms 1884 KB Output is correct
27 Correct 2 ms 1884 KB Output is correct
28 Correct 2 ms 1880 KB Output is correct
29 Correct 2 ms 2024 KB Output is correct
30 Correct 2 ms 1884 KB Output is correct
31 Correct 3 ms 2016 KB Output is correct
32 Correct 2 ms 1884 KB Output is correct
33 Correct 2 ms 1884 KB Output is correct
34 Correct 2 ms 1884 KB Output is correct
35 Correct 3 ms 2024 KB Output is correct
36 Correct 2 ms 1884 KB Output is correct
37 Correct 2 ms 2028 KB Output is correct
38 Correct 2 ms 1884 KB Output is correct
39 Correct 3 ms 1880 KB Output is correct
40 Correct 3 ms 2280 KB Output is correct
41 Correct 6 ms 3288 KB Output is correct
42 Correct 7 ms 3284 KB Output is correct
43 Correct 5 ms 3284 KB Output is correct
44 Correct 7 ms 3284 KB Output is correct
45 Correct 5 ms 3288 KB Output is correct
46 Correct 5 ms 3288 KB Output is correct
47 Correct 6 ms 3288 KB Output is correct
48 Correct 7 ms 3288 KB Output is correct
49 Correct 6 ms 3432 KB Output is correct
50 Correct 7 ms 3288 KB Output is correct
51 Correct 6 ms 3428 KB Output is correct
52 Correct 6 ms 3316 KB Output is correct
53 Correct 5 ms 3288 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2024 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 2 ms 2024 KB Output is correct
4 Correct 2 ms 1888 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 3 ms 1784 KB Output is correct
10 Correct 3 ms 1884 KB Output is correct
11 Correct 2 ms 1880 KB Output is correct
12 Correct 2 ms 1884 KB Output is correct
13 Correct 3 ms 2028 KB Output is correct
14 Correct 2 ms 1880 KB Output is correct
15 Correct 3 ms 1884 KB Output is correct
16 Correct 3 ms 1884 KB Output is correct
17 Correct 2 ms 1884 KB Output is correct
18 Correct 2 ms 1880 KB Output is correct
19 Correct 3 ms 2196 KB Output is correct
20 Correct 2 ms 1896 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 3 ms 1884 KB Output is correct
23 Correct 2 ms 1884 KB Output is correct
24 Correct 2 ms 1884 KB Output is correct
25 Correct 2 ms 2016 KB Output is correct
26 Correct 2 ms 1884 KB Output is correct
27 Correct 2 ms 1884 KB Output is correct
28 Correct 2 ms 1880 KB Output is correct
29 Correct 2 ms 2024 KB Output is correct
30 Correct 2 ms 1884 KB Output is correct
31 Correct 3 ms 2016 KB Output is correct
32 Correct 2 ms 1884 KB Output is correct
33 Correct 2 ms 1884 KB Output is correct
34 Correct 2 ms 1884 KB Output is correct
35 Correct 3 ms 2024 KB Output is correct
36 Correct 2 ms 1884 KB Output is correct
37 Correct 2 ms 2028 KB Output is correct
38 Correct 2 ms 1884 KB Output is correct
39 Correct 3 ms 1880 KB Output is correct
40 Correct 3 ms 2280 KB Output is correct
41 Correct 6 ms 3288 KB Output is correct
42 Correct 7 ms 3284 KB Output is correct
43 Correct 5 ms 3284 KB Output is correct
44 Correct 7 ms 3284 KB Output is correct
45 Correct 5 ms 3288 KB Output is correct
46 Correct 5 ms 3288 KB Output is correct
47 Correct 6 ms 3288 KB Output is correct
48 Correct 7 ms 3288 KB Output is correct
49 Correct 6 ms 3432 KB Output is correct
50 Correct 7 ms 3288 KB Output is correct
51 Correct 6 ms 3428 KB Output is correct
52 Correct 6 ms 3316 KB Output is correct
53 Correct 5 ms 3288 KB Output is correct
54 Correct 21 ms 8372 KB Output is correct
55 Correct 138 ms 33436 KB Output is correct
56 Correct 107 ms 33436 KB Output is correct
57 Correct 106 ms 33432 KB Output is correct
58 Correct 113 ms 33432 KB Output is correct
59 Correct 109 ms 33432 KB Output is correct
60 Correct 106 ms 33436 KB Output is correct
61 Correct 107 ms 33456 KB Output is correct
62 Correct 133 ms 33432 KB Output is correct
63 Correct 112 ms 33528 KB Output is correct
64 Correct 121 ms 33436 KB Output is correct
65 Correct 139 ms 33436 KB Output is correct
66 Correct 124 ms 33432 KB Output is correct
67 Correct 106 ms 33436 KB Output is correct

Subtask #6
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2024 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 2 ms 2024 KB Output is correct
4 Correct 2 ms 1888 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 3 ms 1784 KB Output is correct
10 Correct 3 ms 1884 KB Output is correct
11 Correct 2 ms 1880 KB Output is correct
12 Correct 2 ms 2024 KB Output is correct
13 Correct 571 ms 106904 KB Output is correct
14 Correct 700 ms 124720 KB Output is correct
15 Correct 938 ms 145396 KB Output is correct
16 Correct 1028 ms 169512 KB Output is correct
17 Correct 1296 ms 198248 KB Output is correct
18 Correct 1253 ms 198208 KB Output is correct
19 Correct 1234 ms 198092 KB Output is correct
20 Correct 2 ms 2040 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 2 ms 1884 KB Output is correct
23 Correct 2 ms 1884 KB Output is correct
24 Correct 2 ms 1884 KB Output is correct
25 Correct 2 ms 1884 KB Output is correct
26 Correct 3 ms 1884 KB Output is correct
27 Correct 2 ms 1884 KB Output is correct
28 Correct 2 ms 1880 KB Output is correct
29 Correct 2 ms 1884 KB Output is correct
30 Correct 3 ms 2028 KB Output is correct
31 Correct 2 ms 1880 KB Output is correct
32 Correct 3 ms 1884 KB Output is correct
33 Correct 3 ms 1884 KB Output is correct
34 Correct 2 ms 1884 KB Output is correct
35 Correct 2 ms 1880 KB Output is correct
36 Correct 3 ms 2196 KB Output is correct
37 Correct 2 ms 1896 KB Output is correct
38 Correct 2 ms 1884 KB Output is correct
39 Correct 3 ms 1884 KB Output is correct
40 Correct 2 ms 1884 KB Output is correct
41 Correct 2 ms 1884 KB Output is correct
42 Correct 2 ms 2016 KB Output is correct
43 Correct 2 ms 1884 KB Output is correct
44 Correct 2 ms 1884 KB Output is correct
45 Correct 2 ms 1880 KB Output is correct
46 Correct 2 ms 2024 KB Output is correct
47 Correct 2 ms 1884 KB Output is correct
48 Correct 3 ms 2016 KB Output is correct
49 Correct 2 ms 1884 KB Output is correct
50 Correct 2 ms 1884 KB Output is correct
51 Correct 2 ms 1884 KB Output is correct
52 Correct 3 ms 2024 KB Output is correct
53 Correct 2 ms 1884 KB Output is correct
54 Correct 2 ms 2028 KB Output is correct
55 Correct 2 ms 1884 KB Output is correct
56 Correct 3 ms 1880 KB Output is correct
57 Correct 3 ms 2280 KB Output is correct
58 Correct 6 ms 3288 KB Output is correct
59 Correct 7 ms 3284 KB Output is correct
60 Correct 5 ms 3284 KB Output is correct
61 Correct 7 ms 3284 KB Output is correct
62 Correct 5 ms 3288 KB Output is correct
63 Correct 5 ms 3288 KB Output is correct
64 Correct 6 ms 3288 KB Output is correct
65 Correct 7 ms 3288 KB Output is correct
66 Correct 6 ms 3432 KB Output is correct
67 Correct 7 ms 3288 KB Output is correct
68 Correct 6 ms 3428 KB Output is correct
69 Correct 6 ms 3316 KB Output is correct
70 Correct 5 ms 3288 KB Output is correct
71 Correct 21 ms 8372 KB Output is correct
72 Correct 138 ms 33436 KB Output is correct
73 Correct 107 ms 33436 KB Output is correct
74 Correct 106 ms 33432 KB Output is correct
75 Correct 113 ms 33432 KB Output is correct
76 Correct 109 ms 33432 KB Output is correct
77 Correct 106 ms 33436 KB Output is correct
78 Correct 107 ms 33456 KB Output is correct
79 Correct 133 ms 33432 KB Output is correct
80 Correct 112 ms 33528 KB Output is correct
81 Correct 121 ms 33436 KB Output is correct
82 Correct 139 ms 33436 KB Output is correct
83 Correct 124 ms 33432 KB Output is correct
84 Correct 106 ms 33436 KB Output is correct
85 Correct 374 ms 80480 KB Output is correct
86 Correct 1151 ms 198260 KB Output is correct
87 Correct 1047 ms 198200 KB Output is correct
88 Correct 1081 ms 198092 KB Output is correct
89 Correct 1098 ms 198092 KB Output is correct
90 Correct 1014 ms 198124 KB Output is correct
91 Correct 1016 ms 198084 KB Output is correct
92 Correct 1130 ms 198048 KB Output is correct
93 Correct 1002 ms 198088 KB Output is correct
94 Correct 1008 ms 198048 KB Output is correct
95 Correct 1183 ms 198044 KB Output is correct
96 Correct 1148 ms 198092 KB Output is correct
97 Correct 1050 ms 198052 KB Output is correct