oj.uz

Submission #922103

# Submission time Handle Problem Language Result Execution time Memory
922103 2024-02-05T05:20:22 Z vjudge1 Copy and Paste 3 (JOI22_copypaste3) C++17
30 / 100
 1834 ms 116484 KB 
// I stand with PALESTINE




//#pragma GCC optimize("Ofast,O3")
//#pragma GCC target("avx,avx2")
#include "bits/stdc++.h"

using namespace std;
using ll = long long;
const ll inf = 1e18;
const int mod = 1007173513, coeff = 995269721;

void solve() {
    int n;
    ll A, B, C;
    string s;
    cin >> n >> s >> A >> B >> C;
    vector dp(n, vector(n, inf));
    vector hash(n, vector(n, 0ll));
    map<ll, vector<int>> pos;
    for (int i = 0; i < n; i++) {
        ll val = 0, pw = 1;
        for (int j = i; j < n; j++) {
            val = (val + (s[j] - 'a' + 1) * pw) % mod;
            pw = pw * coeff % mod;
            hash[i][j] = val;
            pos[val].emplace_back(i);
        }
    }
//    set<ll> st;
//    for (int ln = 1; ln <= n; ln++) {
//        for (int i = 0, j = ln - 1; j < n; i++, j++) assert(!st.count(hash[i][j]));
//        for (int i = 0, j = ln - 1; j < n; i++, j++) st.insert(hash[i][j]);
//    }
    for (int i = n - 1; i >= 0; i--) {
        for (int j = i; j < n; j++) {
            dp[i][j] = min(dp[i][j], (j - i + 1) * A);
            if (i != j) {
                dp[i][j] = min(dp[i][j], dp[i + 1][j] + A);
                dp[i][j] = min(dp[i][j], dp[i][j - 1] + A);
            }
            auto &it = pos[hash[i][j]];
            int h = upper_bound(it.begin(), it.end(), j) - it.begin(), cnt = 1;
            int ln = j - i + 1;
//            cout << i << ' ' << j << ' ' << dp[i][j] << endl;
            while (h != it.size()) {
                h = it[h] + ln - 1;
                cnt++;
                dp[i][h] = min(dp[i][h], dp[i][j] + B + cnt * C + (h - i + 1 - ln * cnt) * A);
//                cout << '\t' << i << ' ' << h << ' ' << dp[i][h] << endl;
                h = upper_bound(it.begin(), it.end(), h) - it.begin();
            }
        }
    }
    cout << dp[0][n - 1];
}

int main() {
    cin.tie(0)->sync_with_stdio(false);
#ifdef sunnatov
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    int q = 1;
//    cin >> q;
    while (q--)  {
        solve();
        cout << '\n';
    }
}

Compilation message

copypaste3.cpp: In function 'void solve()':
copypaste3.cpp:48:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |             while (h != it.size()) {
      |                    ~~^~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 865 ms 62376 KB Output is correct
4 Correct 1054 ms 72460 KB Output is correct
5 Correct 1258 ms 85016 KB Output is correct
6 Correct 1532 ms 99052 KB Output is correct
7 Correct 1818 ms 116484 KB Output is correct
8 Correct 1829 ms 116308 KB Output is correct
9 Correct 1834 ms 116480 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 376 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 456 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 2 ms 856 KB Output is correct
41 Correct 5 ms 1116 KB Output is correct
42 Correct 12 ms 3164 KB Output is correct
43 Correct 9 ms 3016 KB Output is correct
44 Correct 9 ms 3248 KB Output is correct
45 Correct 9 ms 3164 KB Output is correct
46 Correct 9 ms 3164 KB Output is correct
47 Correct 5 ms 1628 KB Output is correct
48 Correct 8 ms 2140 KB Output is correct
49 Correct 8 ms 2652 KB Output is correct
50 Correct 8 ms 2652 KB Output is correct
51 Correct 8 ms 2140 KB Output is correct
52 Correct 7 ms 2140 KB Output is correct
53 Correct 9 ms 3164 KB Output is correct

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 376 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 456 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 2 ms 856 KB Output is correct
41 Correct 5 ms 1116 KB Output is correct
42 Correct 12 ms 3164 KB Output is correct
43 Correct 9 ms 3016 KB Output is correct
44 Correct 9 ms 3248 KB Output is correct
45 Correct 9 ms 3164 KB Output is correct
46 Correct 9 ms 3164 KB Output is correct
47 Correct 5 ms 1628 KB Output is correct
48 Correct 8 ms 2140 KB Output is correct
49 Correct 8 ms 2652 KB Output is correct
50 Correct 8 ms 2652 KB Output is correct
51 Correct 8 ms 2140 KB Output is correct
52 Correct 7 ms 2140 KB Output is correct
53 Correct 9 ms 3164 KB Output is correct
54 Correct 90 ms 14164 KB Output is correct
55 Correct 206 ms 18984 KB Output is correct
56 Correct 1014 ms 70216 KB Output is correct
57 Incorrect 1070 ms 70444 KB Output isn't correct
58 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 865 ms 62376 KB Output is correct
14 Correct 1054 ms 72460 KB Output is correct
15 Correct 1258 ms 85016 KB Output is correct
16 Correct 1532 ms 99052 KB Output is correct
17 Correct 1818 ms 116484 KB Output is correct
18 Correct 1829 ms 116308 KB Output is correct
19 Correct 1834 ms 116480 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 376 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 512 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 456 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 2 ms 856 KB Output is correct
58 Correct 5 ms 1116 KB Output is correct
59 Correct 12 ms 3164 KB Output is correct
60 Correct 9 ms 3016 KB Output is correct
61 Correct 9 ms 3248 KB Output is correct
62 Correct 9 ms 3164 KB Output is correct
63 Correct 9 ms 3164 KB Output is correct
64 Correct 5 ms 1628 KB Output is correct
65 Correct 8 ms 2140 KB Output is correct
66 Correct 8 ms 2652 KB Output is correct
67 Correct 8 ms 2652 KB Output is correct
68 Correct 8 ms 2140 KB Output is correct
69 Correct 7 ms 2140 KB Output is correct
70 Correct 9 ms 3164 KB Output is correct
71 Correct 90 ms 14164 KB Output is correct
72 Correct 206 ms 18984 KB Output is correct
73 Correct 1014 ms 70216 KB Output is correct
74 Incorrect 1070 ms 70444 KB Output isn't correct
75 Halted 0 ms 0 KB -