oj.uz

Submission #893260

# Submission time Handle Problem Language Result Execution time Memory
893260 2023-12-26T18:46:39 Z serifefedartar Copy and Paste 3 (JOI22_copypaste3) C++17
20 / 100
 331 ms 119012 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define fast ios::sync_with_stdio(0);cin.tie(0);
typedef long long ll;
#define f first
#define s second
#define LOGN 21
const ll MAXN = 2550;

const ll P = 37;
const ll P2 = 31;
const ll MOD1 = 1e9 + 9;
const ll MOD2 = 998244353;
#define int long long

ll N, A, B, C;
string s;
ll hashes1[MAXN], hashes2[MAXN], to[MAXN][MAXN], dp[MAXN][MAXN], powP1[MAXN], powP2[MAXN];
pair<ll, ll> f(int l, int r) {
    ll h = (hashes1[r] - powP1[r-l+1] * hashes1[l - 1] % MOD1) % MOD1;
    ll h2 = (hashes2[r] - powP2[r-l+1] * hashes2[l - 1] % MOD2) % MOD2;
    if (h < 0)
        h += MOD1;
    if (h2 < 0)
        h2 += MOD2;
    return {h, h2};
}

vector<int> occ[MAXN];
map<pair<ll,ll>, deque<int>> mp;

signed main() {
    fast
    cin >> N >> s >> A >> B >> C;
    s = "#" + s; 

    powP1[0] = powP2[0] = 1;
    for (int i = 1; i <= N; i++)
        powP1[i] = (powP1[i-1] * P) % MOD1;
    for (int i = 1; i <= N; i++)
        powP2[i] = (powP2[i-1] * P2) % MOD2;
    for (int i = 1; i <= N; i++)
        hashes1[i] = (hashes1[i-1] * P + (s[i] - 'a' + 1)) % MOD1;
    for (int i = 1; i <= N; i++)
        hashes2[i] = (hashes2[i-1] * P2 + (s[i] - 'a' + 1)) % MOD2;

    for (int len = 1; len <= N; len++) {
        mp.clear();
        for (int j = N-len+1; j >= 1; j--) {
            pair<ll, ll> h = f(j, j + len - 1);
            while (mp[h].size() >= 2 && mp[h][1] > j + len - 1)
                mp[h].pop_front();

            to[j][len] = (mp[h].size() == 0 ? 0 : mp[h].front());
            if (to[j][len] <= j + len - 1)
                to[j][len] = 0;

            if (to[j][len])
                occ[j].push_back(len);
            mp[h].push_back(j);
        }
    }

    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= N; j++)
            dp[i][j] = 1e14;
    }

    for (int l = N; l >= 1; l--) {
        dp[l][l] = A;
        for (int r = l+1; r <= N; r++)
            dp[l][r] = min(dp[l][r], min(dp[l+1][r] + A, dp[l][r-1] + A));

        for (auto len : occ[l]) {
            int cnt = 1;
            int now = to[l][len];
            ll base = dp[l][l+len-1];
            while (now != 0) {
                int total = now - l - cnt * len;
                dp[l][now + len - 1] = min(dp[l][now + len - 1], total * A + B + C * (cnt + 1) + base);
                cnt++;
                now = to[now][len];
            }
        }

        for (int r = l+1; r <= N; r++)
            dp[l][r] = min(dp[l][r], min(dp[l+1][r] + A, dp[l][r-1] + A));
    }
    cout << dp[1][N] << "\n";
}

Subtask #1
1.0 / 1.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 164 ms 85844 KB Output is correct
4 Correct 185 ms 95256 KB Output is correct
5 Correct 220 ms 101188 KB Output is correct
6 Correct 275 ms 111952 KB Output is correct
7 Correct 320 ms 118832 KB Output is correct
8 Correct 331 ms 119012 KB Output is correct
9 Correct 325 ms 118868 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4660 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4664 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6488 KB Output is correct
24 Correct 1 ms 6744 KB Output is correct
25 Correct 1 ms 6488 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 1 ms 6488 KB Output is correct
28 Correct 1 ms 6744 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 6492 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4660 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4664 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6488 KB Output is correct
24 Correct 1 ms 6744 KB Output is correct
25 Correct 1 ms 6488 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 1 ms 6488 KB Output is correct
28 Correct 1 ms 6744 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 6492 KB Output is correct
40 Correct 2 ms 6748 KB Output is correct
41 Correct 2 ms 10844 KB Output is correct
42 Correct 7 ms 10844 KB Output is correct
43 Correct 7 ms 10844 KB Output is correct
44 Correct 7 ms 10948 KB Output is correct
45 Correct 7 ms 10844 KB Output is correct
46 Correct 7 ms 10840 KB Output is correct
47 Correct 4 ms 10844 KB Output is correct
48 Correct 6 ms 11096 KB Output is correct
49 Correct 6 ms 10844 KB Output is correct
50 Correct 6 ms 10844 KB Output is correct
51 Correct 6 ms 10844 KB Output is correct
52 Incorrect 5 ms 10972 KB Output isn't correct
53 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4660 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4664 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6488 KB Output is correct
24 Correct 1 ms 6744 KB Output is correct
25 Correct 1 ms 6488 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 1 ms 6488 KB Output is correct
28 Correct 1 ms 6744 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 6492 KB Output is correct
40 Correct 2 ms 6748 KB Output is correct
41 Correct 2 ms 10844 KB Output is correct
42 Correct 7 ms 10844 KB Output is correct
43 Correct 7 ms 10844 KB Output is correct
44 Correct 7 ms 10948 KB Output is correct
45 Correct 7 ms 10844 KB Output is correct
46 Correct 7 ms 10840 KB Output is correct
47 Correct 4 ms 10844 KB Output is correct
48 Correct 6 ms 11096 KB Output is correct
49 Correct 6 ms 10844 KB Output is correct
50 Correct 6 ms 10844 KB Output is correct
51 Correct 6 ms 10844 KB Output is correct
52 Incorrect 5 ms 10972 KB Output isn't correct
53 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 164 ms 85844 KB Output is correct
14 Correct 185 ms 95256 KB Output is correct
15 Correct 220 ms 101188 KB Output is correct
16 Correct 275 ms 111952 KB Output is correct
17 Correct 320 ms 118832 KB Output is correct
18 Correct 331 ms 119012 KB Output is correct
19 Correct 325 ms 118868 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4660 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4664 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 2392 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 6492 KB Output is correct
39 Correct 1 ms 6492 KB Output is correct
40 Correct 1 ms 6488 KB Output is correct
41 Correct 1 ms 6744 KB Output is correct
42 Correct 1 ms 6488 KB Output is correct
43 Correct 1 ms 6492 KB Output is correct
44 Correct 1 ms 6488 KB Output is correct
45 Correct 1 ms 6744 KB Output is correct
46 Correct 1 ms 6492 KB Output is correct
47 Correct 1 ms 6492 KB Output is correct
48 Correct 1 ms 6492 KB Output is correct
49 Correct 1 ms 6492 KB Output is correct
50 Correct 1 ms 6492 KB Output is correct
51 Correct 1 ms 2396 KB Output is correct
52 Correct 1 ms 2396 KB Output is correct
53 Correct 1 ms 4444 KB Output is correct
54 Correct 1 ms 4444 KB Output is correct
55 Correct 1 ms 4444 KB Output is correct
56 Correct 1 ms 6492 KB Output is correct
57 Correct 2 ms 6748 KB Output is correct
58 Correct 2 ms 10844 KB Output is correct
59 Correct 7 ms 10844 KB Output is correct
60 Correct 7 ms 10844 KB Output is correct
61 Correct 7 ms 10948 KB Output is correct
62 Correct 7 ms 10844 KB Output is correct
63 Correct 7 ms 10840 KB Output is correct
64 Correct 4 ms 10844 KB Output is correct
65 Correct 6 ms 11096 KB Output is correct
66 Correct 6 ms 10844 KB Output is correct
67 Correct 6 ms 10844 KB Output is correct
68 Correct 6 ms 10844 KB Output is correct
69 Incorrect 5 ms 10972 KB Output isn't correct
70 Halted 0 ms 0 KB -