oj.uz

Submission #1060893

# Submission time Handle Problem Language Result Execution time Memory
1060893 2024-08-16T04:09:41 Z sleepntsheep Copy and Paste 3 (JOI22_copypaste3) C++17
15 / 100
 3000 ms 391400 KB 
#pragma GCC optimize("O3,unroll-loops")

#include <iostream>
#include <map>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
template <typename T>
using ve = vector<T>;

const int N = 2001;
const ll B = 137, M = 1000000007,
      B2 = 141, M2 = 1000000009;

int n;
ll dp[N][N], a, b, c;
char s[N];

ll hs[N], bp[N], ibp[N], bp2[B], ibp2[B], hs2[N];

ll bpow(ll a, ll b, ll m) {
    if (!b) return 1;
    ll r { bpow(a, b / 2, m) };
    if (b & 1) return r * r % m * a % m;
    return r * r % m;
}

void do_hash() {
    bp[0] = ibp[0] = bp2[0] = ibp2[0] = 1;
    for (int i = 1; i <= n; ++i) bp[i] = bp[i - 1] * B % M, ibp[i] = bpow(bp[i], M - 2, M);
    for (int i = 1; i <= n; ++i) hs[i] = bp[i] * (s[i] - 'a' + 1) % M, hs[i] = (hs[i] + hs[i - 1]) % M;
    for (int i = 1; i <= n; ++i) bp2[i] = bp2[i - 1] * B2 % M2, ibp2[i] = bpow(bp2[i], M2 - 2, M2);
    for (int i = 1; i <= n; ++i) hs2[i] = bp2[i] * (s[i] - 'a' + 1) % M2, hs2[i] = (hs2[i] + hs2[i - 1]) % M2;
}

pair<ll, ll> get_hash(int l, int r) {
    return {ibp[l] * (hs[r] - hs[l - 1] + M) % M, ibp2[l] * (hs2[r] - hs2[l - 1] + M2) % M2};
}

map<pair<ll, ll>, ve<int>> oo, op[N];

void init() {
    do_hash();
    memset(dp, 63, sizeof dp);

    for (int i = 1; i <= n; ++i) {
        dp[i][i] = a;
        for (int j = i; j <= n; ++j) 
            oo[get_hash(i, j)].push_back(i);
    }

    for (int i = 1; i <= n; ++i) {
        for (int j = i; j <= n; ++j) {
            auto x = get_hash(i, j);
            auto &v = oo[x];
            auto it = lower_bound(v.begin(), v.end(), i);
            while (it != v.end()) {
                op[i][x].push_back(*it);
                it = lower_bound(v.begin(), v.end(), *it + j - i + 1);
            }
        }
    }
}

int main() {
    scanf("%d%s%lld%lld%lld", &n, s + 1, &a, &b, &c);

    init();

    for (int l = 1; l <= n; ++l) {
        for (int i = 1, j = l; j <= n; ++i, ++j) {
            if (i < j) dp[i][j] = min(dp[i][j], dp[i + 1][j] + a);
            if (j > i) dp[i][j] = min(dp[i][j], dp[i][j - 1] + a);
            auto x = get_hash(i, j);

            auto &oc = op[i][x];
            auto it = lower_bound(oc.begin(), oc.end(), i);
            int cnt = 1;
            for (; it != oc.end(); ++it, ++cnt) {
                int jj = *it + l - 1;
                dp[i][jj] = min(dp[i][jj], dp[i][j] + b + cnt * c + (jj - i + 1 - cnt * l) * a);
            }
        }
    }

    printf("%lld", dp[1][n]);
}

Compilation message

copypaste3.cpp: In function 'int main()':
copypaste3.cpp:68:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |     scanf("%d%s%lld%lld%lld", &n, s + 1, &a, &b, &c);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 31836 KB Output is correct
2 Correct 5 ms 31836 KB Output is correct
3 Execution timed out 3038 ms 391400 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 31836 KB Output is correct
2 Correct 4 ms 31836 KB Output is correct
3 Correct 3 ms 31836 KB Output is correct
4 Correct 4 ms 31836 KB Output is correct
5 Correct 3 ms 31836 KB Output is correct
6 Correct 4 ms 31836 KB Output is correct
7 Correct 4 ms 31836 KB Output is correct
8 Correct 4 ms 31836 KB Output is correct
9 Correct 4 ms 31836 KB Output is correct
10 Correct 4 ms 31832 KB Output is correct
11 Correct 4 ms 31836 KB Output is correct
12 Correct 4 ms 31836 KB Output is correct
13 Correct 5 ms 31836 KB Output is correct
14 Correct 4 ms 31836 KB Output is correct
15 Correct 3 ms 31836 KB Output is correct
16 Correct 4 ms 31836 KB Output is correct
17 Correct 4 ms 31832 KB Output is correct
18 Correct 4 ms 31836 KB Output is correct
19 Correct 4 ms 31836 KB Output is correct
20 Correct 3 ms 31836 KB Output is correct
21 Correct 4 ms 31836 KB Output is correct
22 Correct 4 ms 31848 KB Output is correct
23 Correct 4 ms 31836 KB Output is correct
24 Correct 4 ms 31836 KB Output is correct
25 Correct 4 ms 31836 KB Output is correct
26 Correct 4 ms 31836 KB Output is correct
27 Correct 4 ms 31836 KB Output is correct
28 Correct 5 ms 31836 KB Output is correct
29 Correct 4 ms 31832 KB Output is correct
30 Correct 4 ms 31832 KB Output is correct
31 Correct 4 ms 31820 KB Output is correct
32 Correct 4 ms 31836 KB Output is correct
33 Correct 4 ms 31836 KB Output is correct
34 Correct 3 ms 31816 KB Output is correct
35 Correct 4 ms 31836 KB Output is correct
36 Correct 3 ms 31836 KB Output is correct
37 Correct 4 ms 31836 KB Output is correct
38 Correct 3 ms 31836 KB Output is correct
39 Correct 4 ms 31836 KB Output is correct
40 Correct 6 ms 32604 KB Output is correct
41 Incorrect 17 ms 35420 KB Output isn't correct
42 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 31836 KB Output is correct
2 Correct 4 ms 31836 KB Output is correct
3 Correct 3 ms 31836 KB Output is correct
4 Correct 4 ms 31836 KB Output is correct
5 Correct 3 ms 31836 KB Output is correct
6 Correct 4 ms 31836 KB Output is correct
7 Correct 4 ms 31836 KB Output is correct
8 Correct 4 ms 31836 KB Output is correct
9 Correct 4 ms 31836 KB Output is correct
10 Correct 4 ms 31832 KB Output is correct
11 Correct 4 ms 31836 KB Output is correct
12 Correct 4 ms 31836 KB Output is correct
13 Correct 5 ms 31836 KB Output is correct
14 Correct 4 ms 31836 KB Output is correct
15 Correct 3 ms 31836 KB Output is correct
16 Correct 4 ms 31836 KB Output is correct
17 Correct 4 ms 31832 KB Output is correct
18 Correct 4 ms 31836 KB Output is correct
19 Correct 4 ms 31836 KB Output is correct
20 Correct 3 ms 31836 KB Output is correct
21 Correct 4 ms 31836 KB Output is correct
22 Correct 4 ms 31848 KB Output is correct
23 Correct 4 ms 31836 KB Output is correct
24 Correct 4 ms 31836 KB Output is correct
25 Correct 4 ms 31836 KB Output is correct
26 Correct 4 ms 31836 KB Output is correct
27 Correct 4 ms 31836 KB Output is correct
28 Correct 5 ms 31836 KB Output is correct
29 Correct 4 ms 31832 KB Output is correct
30 Correct 4 ms 31832 KB Output is correct
31 Correct 4 ms 31820 KB Output is correct
32 Correct 4 ms 31836 KB Output is correct
33 Correct 4 ms 31836 KB Output is correct
34 Correct 3 ms 31816 KB Output is correct
35 Correct 4 ms 31836 KB Output is correct
36 Correct 3 ms 31836 KB Output is correct
37 Correct 4 ms 31836 KB Output is correct
38 Correct 3 ms 31836 KB Output is correct
39 Correct 4 ms 31836 KB Output is correct
40 Correct 6 ms 32604 KB Output is correct
41 Incorrect 17 ms 35420 KB Output isn't correct
42 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 31836 KB Output is correct
2 Correct 4 ms 31836 KB Output is correct
3 Correct 3 ms 31836 KB Output is correct
4 Correct 4 ms 31836 KB Output is correct
5 Correct 3 ms 31836 KB Output is correct
6 Correct 4 ms 31836 KB Output is correct
7 Correct 4 ms 31836 KB Output is correct
8 Correct 4 ms 31836 KB Output is correct
9 Correct 4 ms 31836 KB Output is correct
10 Correct 4 ms 31832 KB Output is correct
11 Correct 4 ms 31836 KB Output is correct
12 Correct 5 ms 31836 KB Output is correct
13 Execution timed out 3038 ms 391400 KB Time limit exceeded
14 Halted 0 ms 0 KB -