oj.uz

Submission #951797

# Submission time Handle Problem Language Result Execution time Memory
951797 2024-03-22T16:29:01 Z EJIC_B_KEDAX Copy and Paste 3 (JOI22_copypaste3) C++17
62 / 100
 1539 ms 514920 KB 
#ifdef LOCAL
    #define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>

#ifndef LOCAL
    // #pragma GCC optimize("O3")
    // #pragma GCC optimize("Ofast")
    // #pragma GCC optimize("unroll-loops")
    // #pragma GCC target("avx,avx2,bmi,bmi2,popcnt,lzcnt")
#endif
using namespace std;
using ll = long long;
using ld = long double;
#define x first
#define y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

mt19937_64 mt(time(0));

void solve();
void init();

int32_t main() {
#ifndef LOCAL
    cin.tie(nullptr)->sync_with_stdio(false);
#endif
    cout << fixed << setprecision(30);
    init();
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}

#define int ll

const int N = 2525, mod = 1000000321, p = 31;
ll dp[N][N], save[N][N], mn[N];
int to[N][N], nw[N][N], hsh[N], pdeg[N], pinv[N];
vector<pair<int, int>> upd[N];

int add(int a, int b) {
    return a + b >= mod ? a + b - mod : a + b;
}

int sub(int a, int b) {
    return a >= b ? a - b : a - b + mod;
}

int mul(int a, int b) {
    return 1ll * a * b % mod;
}

int bin_pow(int a, int x) {
    int res = 1;
    while (x) {
        if (x & 1) {
            res = mul(res, a);
        }
        a = mul(a, a);
        x >>= 1;
    }
    return res;
}

int inv(int a) {
    return bin_pow(a, mod - 2);
}

void init() {
    pdeg[0] = 1;
    pdeg[1] = p;
    pinv[0] = 1;
    pinv[1] = inv(p);
    for (int i = 2; i < N; i++) {
        pdeg[i] = mul(pdeg[i - 1], p);
        pinv[i] = mul(pinv[i - 1], pinv[1]);
    }
}

int get_hash(int l, int r) {
    return mul(sub(hsh[r + 1], hsh[l]), pinv[l]);
}

void solve() {
    int n;
    cin >> n;
    string s;
    cin >> s;
    int a, b, c;
    cin >> a >> b >> c;
    hsh[0] = 0;
    for (int i = 0; i < n; i++) {
        hsh[i + 1] = add(hsh[i], mul(s[i] - 'a' + 1, pdeg[i]));
        upd[i].reserve(40 * N);
    }
    for (int l = 0; l < n; l++) {
        unordered_map<int, int> mp;
        for (int i = 0; i < n - l; i++) {
            int j = i + l;
            int nw = get_hash(i, j);
            if (mp.find(nw) == mp.end()) {
                to[i][j] = -1;
            } else {
                to[i][j] = mp[nw];
            }
            if (i >= l) {
                mp[get_hash(i - l, i)] = i - l;
            }
        }
    }
    for (int i = 0; i < n; i++) {
        dp[i][i] = a;
        save[i][i] = b + c;
        mn[i] = min(mn[i], save[i][i]);
        nw[i][i] = to[i][i];
        if (to[i][i] != -1) {
            upd[i - to[i][i]].emplace_back(i, i);
        }
    }
    for (int l = 1; l < n; l++) {
        for (auto [i, j] : upd[l]) {
            int nxt = to[nw[i][j]][nw[i][j] + j - i];
            nw[i][j] = nxt;
            if (nxt >= 0) {
                upd[j - nxt].emplace_back(i, j);
            }
            save[j][i] += c - 1ll * (j - i + 1) * a;
            mn[j] = min(mn[j], save[j][i]);
        }
        for (int i = 0; i < n - l; i++) {
            int j = i + l;
            dp[i][j] = min(1ll * (j - i + 1) * a + mn[j], dp[i][j - 1] + a);
            save[j][i] += dp[i][j] + b + c - 1ll * (j - i + 1) * a;
            mn[j] = min(mn[j], save[j][i]);
            nw[i][j] = to[i][j];
            if (nw[i][j] != -1) {
                upd[j - nw[i][j]].emplace_back(i, j);
            }
        }
    }
    cout << dp[0][n - 1] << '\n';
}

Subtask #1
1.0 / 1.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 700 ms 309348 KB Output is correct
4 Correct 803 ms 346884 KB Output is correct
5 Correct 987 ms 389972 KB Output is correct
6 Correct 1258 ms 442572 KB Output is correct
7 Correct 1515 ms 514836 KB Output is correct
8 Correct 1539 ms 514920 KB Output is correct
9 Correct 1478 ms 514776 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4696 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 1 ms 8796 KB Output is correct
15 Correct 1 ms 8796 KB Output is correct
16 Correct 1 ms 9052 KB Output is correct
17 Correct 1 ms 4696 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4696 KB Output is correct
2 Correct 2 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 1 ms 4696 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 1 ms 8796 KB Output is correct
14 Correct 1 ms 8796 KB Output is correct
15 Correct 2 ms 8796 KB Output is correct
16 Correct 2 ms 8852 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 8796 KB Output is correct
20 Correct 2 ms 6748 KB Output is correct
21 Correct 2 ms 9052 KB Output is correct
22 Correct 2 ms 9052 KB Output is correct
23 Correct 1 ms 9052 KB Output is correct
24 Correct 2 ms 9052 KB Output is correct
25 Correct 1 ms 9052 KB Output is correct
26 Correct 2 ms 9052 KB Output is correct
27 Correct 2 ms 9052 KB Output is correct
28 Correct 2 ms 9052 KB Output is correct
29 Correct 2 ms 9048 KB Output is correct
30 Correct 2 ms 9052 KB Output is correct
31 Correct 2 ms 9052 KB Output is correct
32 Correct 2 ms 9052 KB Output is correct
33 Correct 2 ms 9052 KB Output is correct
34 Correct 1 ms 4696 KB Output is correct
35 Correct 1 ms 4700 KB Output is correct
36 Correct 1 ms 6748 KB Output is correct
37 Correct 1 ms 8792 KB Output is correct
38 Correct 1 ms 8796 KB Output is correct
39 Correct 1 ms 9052 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4696 KB Output is correct
2 Correct 2 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 1 ms 4696 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 1 ms 8796 KB Output is correct
14 Correct 1 ms 8796 KB Output is correct
15 Correct 2 ms 8796 KB Output is correct
16 Correct 2 ms 8852 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 8796 KB Output is correct
20 Correct 2 ms 6748 KB Output is correct
21 Correct 2 ms 9052 KB Output is correct
22 Correct 2 ms 9052 KB Output is correct
23 Correct 1 ms 9052 KB Output is correct
24 Correct 2 ms 9052 KB Output is correct
25 Correct 1 ms 9052 KB Output is correct
26 Correct 2 ms 9052 KB Output is correct
27 Correct 2 ms 9052 KB Output is correct
28 Correct 2 ms 9052 KB Output is correct
29 Correct 2 ms 9048 KB Output is correct
30 Correct 2 ms 9052 KB Output is correct
31 Correct 2 ms 9052 KB Output is correct
32 Correct 2 ms 9052 KB Output is correct
33 Correct 2 ms 9052 KB Output is correct
34 Correct 1 ms 4696 KB Output is correct
35 Correct 1 ms 4700 KB Output is correct
36 Correct 1 ms 6748 KB Output is correct
37 Correct 1 ms 8792 KB Output is correct
38 Correct 1 ms 8796 KB Output is correct
39 Correct 1 ms 9052 KB Output is correct
40 Correct 3 ms 13660 KB Output is correct
41 Correct 6 ms 23544 KB Output is correct
42 Correct 5 ms 22616 KB Output is correct
43 Correct 5 ms 22620 KB Output is correct
44 Correct 5 ms 22484 KB Output is correct
45 Correct 5 ms 22620 KB Output is correct
46 Correct 5 ms 22620 KB Output is correct
47 Correct 5 ms 22620 KB Output is correct
48 Correct 5 ms 22616 KB Output is correct
49 Correct 5 ms 22620 KB Output is correct
50 Correct 5 ms 22708 KB Output is correct
51 Correct 5 ms 22616 KB Output is correct
52 Correct 6 ms 22620 KB Output is correct
53 Correct 6 ms 22620 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4696 KB Output is correct
2 Correct 2 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 1 ms 4696 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 1 ms 8796 KB Output is correct
14 Correct 1 ms 8796 KB Output is correct
15 Correct 2 ms 8796 KB Output is correct
16 Correct 2 ms 8852 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 8796 KB Output is correct
20 Correct 2 ms 6748 KB Output is correct
21 Correct 2 ms 9052 KB Output is correct
22 Correct 2 ms 9052 KB Output is correct
23 Correct 1 ms 9052 KB Output is correct
24 Correct 2 ms 9052 KB Output is correct
25 Correct 1 ms 9052 KB Output is correct
26 Correct 2 ms 9052 KB Output is correct
27 Correct 2 ms 9052 KB Output is correct
28 Correct 2 ms 9052 KB Output is correct
29 Correct 2 ms 9048 KB Output is correct
30 Correct 2 ms 9052 KB Output is correct
31 Correct 2 ms 9052 KB Output is correct
32 Correct 2 ms 9052 KB Output is correct
33 Correct 2 ms 9052 KB Output is correct
34 Correct 1 ms 4696 KB Output is correct
35 Correct 1 ms 4700 KB Output is correct
36 Correct 1 ms 6748 KB Output is correct
37 Correct 1 ms 8792 KB Output is correct
38 Correct 1 ms 8796 KB Output is correct
39 Correct 1 ms 9052 KB Output is correct
40 Correct 3 ms 13660 KB Output is correct
41 Correct 6 ms 23544 KB Output is correct
42 Correct 5 ms 22616 KB Output is correct
43 Correct 5 ms 22620 KB Output is correct
44 Correct 5 ms 22484 KB Output is correct
45 Correct 5 ms 22620 KB Output is correct
46 Correct 5 ms 22620 KB Output is correct
47 Correct 5 ms 22620 KB Output is correct
48 Correct 5 ms 22616 KB Output is correct
49 Correct 5 ms 22620 KB Output is correct
50 Correct 5 ms 22708 KB Output is correct
51 Correct 5 ms 22616 KB Output is correct
52 Correct 6 ms 22620 KB Output is correct
53 Correct 6 ms 22620 KB Output is correct
54 Correct 17 ms 45400 KB Output is correct
55 Correct 159 ms 133376 KB Output is correct
56 Correct 79 ms 97360 KB Output is correct
57 Correct 65 ms 93776 KB Output is correct
58 Correct 61 ms 91988 KB Output is correct
59 Correct 56 ms 91996 KB Output is correct
60 Correct 53 ms 91996 KB Output is correct
61 Correct 54 ms 95576 KB Output is correct
62 Correct 134 ms 124960 KB Output is correct
63 Correct 55 ms 94292 KB Output is correct
64 Correct 63 ms 96080 KB Output is correct
65 Correct 106 ms 109396 KB Output is correct
66 Correct 106 ms 109328 KB Output is correct
67 Correct 56 ms 91972 KB Output is correct

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4696 KB Output is correct
2 Correct 2 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 1 ms 4696 KB Output is correct
11 Correct 1 ms 8796 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 700 ms 309348 KB Output is correct
14 Correct 803 ms 346884 KB Output is correct
15 Correct 987 ms 389972 KB Output is correct
16 Correct 1258 ms 442572 KB Output is correct
17 Correct 1515 ms 514836 KB Output is correct
18 Correct 1539 ms 514920 KB Output is correct
19 Correct 1478 ms 514776 KB Output is correct
20 Correct 1 ms 4700 KB Output is correct
21 Correct 1 ms 4700 KB Output is correct
22 Correct 1 ms 4696 KB Output is correct
23 Correct 1 ms 6748 KB Output is correct
24 Correct 1 ms 8796 KB Output is correct
25 Correct 1 ms 8796 KB Output is correct
26 Correct 1 ms 9052 KB Output is correct
27 Correct 1 ms 4696 KB Output is correct
28 Correct 2 ms 8796 KB Output is correct
29 Correct 2 ms 8796 KB Output is correct
30 Correct 1 ms 8796 KB Output is correct
31 Correct 1 ms 8796 KB Output is correct
32 Correct 2 ms 8796 KB Output is correct
33 Correct 2 ms 8852 KB Output is correct
34 Correct 1 ms 6748 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 8796 KB Output is correct
37 Correct 2 ms 6748 KB Output is correct
38 Correct 2 ms 9052 KB Output is correct
39 Correct 2 ms 9052 KB Output is correct
40 Correct 1 ms 9052 KB Output is correct
41 Correct 2 ms 9052 KB Output is correct
42 Correct 1 ms 9052 KB Output is correct
43 Correct 2 ms 9052 KB Output is correct
44 Correct 2 ms 9052 KB Output is correct
45 Correct 2 ms 9052 KB Output is correct
46 Correct 2 ms 9048 KB Output is correct
47 Correct 2 ms 9052 KB Output is correct
48 Correct 2 ms 9052 KB Output is correct
49 Correct 2 ms 9052 KB Output is correct
50 Correct 2 ms 9052 KB Output is correct
51 Correct 1 ms 4696 KB Output is correct
52 Correct 1 ms 4700 KB Output is correct
53 Correct 1 ms 6748 KB Output is correct
54 Correct 1 ms 8792 KB Output is correct
55 Correct 1 ms 8796 KB Output is correct
56 Correct 1 ms 9052 KB Output is correct
57 Correct 3 ms 13660 KB Output is correct
58 Correct 6 ms 23544 KB Output is correct
59 Correct 5 ms 22616 KB Output is correct
60 Correct 5 ms 22620 KB Output is correct
61 Correct 5 ms 22484 KB Output is correct
62 Correct 5 ms 22620 KB Output is correct
63 Correct 5 ms 22620 KB Output is correct
64 Correct 5 ms 22620 KB Output is correct
65 Correct 5 ms 22616 KB Output is correct
66 Correct 5 ms 22620 KB Output is correct
67 Correct 5 ms 22708 KB Output is correct
68 Correct 5 ms 22616 KB Output is correct
69 Correct 6 ms 22620 KB Output is correct
70 Correct 6 ms 22620 KB Output is correct
71 Correct 17 ms 45400 KB Output is correct
72 Correct 159 ms 133376 KB Output is correct
73 Correct 79 ms 97360 KB Output is correct
74 Correct 65 ms 93776 KB Output is correct
75 Correct 61 ms 91988 KB Output is correct
76 Correct 56 ms 91996 KB Output is correct
77 Correct 53 ms 91996 KB Output is correct
78 Correct 54 ms 95576 KB Output is correct
79 Correct 134 ms 124960 KB Output is correct
80 Correct 55 ms 94292 KB Output is correct
81 Correct 63 ms 96080 KB Output is correct
82 Correct 106 ms 109396 KB Output is correct
83 Correct 106 ms 109328 KB Output is correct
84 Correct 56 ms 91972 KB Output is correct
85 Correct 197 ms 158292 KB Output is correct
86 Correct 511 ms 241264 KB Output is correct
87 Correct 414 ms 219756 KB Output is correct
88 Correct 362 ms 205756 KB Output is correct
89 Correct 328 ms 200788 KB Output is correct
90 Incorrect 321 ms 200824 KB Output isn't correct
91 Halted 0 ms 0 KB -