oj.uz

Submission #721575

# Submission time Handle Problem Language Result Execution time Memory
721575 2023-04-11T04:52:31 Z becaido Copy and Paste 3 (JOI22_copypaste3) C++17
62 / 100
 1124 ms 34380 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout (T t, U...u) {cout << t << (sizeof... (u) ? ", " : ""), dout (u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int base = 137;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const int SIZE = 2505;

int n;
string s;
int A, B, C;
ll dp[SIZE][SIZE];
int nxt[SIZE];

int pro[SIZE], inv[SIZE], pre[SIZE];
int power(int d, int up) {
    int re = 1;
    while (up) {
        if (up & 1) re = 1ll * re * d % MOD;
        d = 1ll * d * d % MOD;
        up >>= 1;
    }
    return re;
}
int cal(int l, int r) {
    int x = pre[r] - pre[l - 1];
    if (x < 0) x += MOD;
    return 1ll * x * inv[l] % MOD;
}

void solve() {
    cin >> n >> s;
    cin >> A >> B >> C;
    s = " " + s;
    pro[0] = inv[0] = 1;
    inv[1] = power(base, MOD - 2);
    FOR (i, 1, n) {
        pro[i] = 1ll * pro[i - 1] * base % MOD;
        inv[i] = 1ll * inv[i - 1] * inv[1] % MOD;
        pre[i] = (pre[i - 1] + 1ll * pro[i] * s[i]) % MOD;
    }
    FOR (i, 1, n) FOR (j, i, n) dp[i][j] = INF;
    FOR (len, 1, n) {
        unordered_map<int, int> pos;
        unordered_map<int, vector<int>> mp;
        for (int l = 1, r = len; r <= n; l++, r++) {
            dp[l][r] = min(dp[l][r], min(dp[l][r - 1], dp[l + 1][r]) + A);
            int val = cal(l, r);
            pos[val] = 0;
            mp[val].pb(l);
        }
        for (int l = 1, r = len; r <= n; l++, r++) {
            int val = cal(l, r);
            while (pos[val] < mp[val].size() && mp[val][pos[val]] <= r) pos[val]++;
            if (pos[val] == mp[val].size()) nxt[l] = n + 1;
            else nxt[l] = mp[val][pos[val]];
        }
        for (int l = 1, r = len; r <= n; l++, r++) {
            int pl = l, pr = r, cnt = 1;
            while (pr <= n) {
                dp[l][pr] = min(dp[l][pr], dp[l][r] + B + 1ll * C * cnt + 1ll * A * (pr - l + 1 - len * cnt));
                pl = nxt[pl];
                pr = pl + len - 1;
                cnt++;
            }
        }
    }
    cout << dp[1][n] << '\n';
}

int main() {
    Waimai;
    solve();
}

Compilation message

copypaste3.cpp: In function 'void solve()':
copypaste3.cpp:72:29: warning: comparison of integer expressions of different signedness: 'std::unordered_map<int, int>::mapped_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |             while (pos[val] < mp[val].size() && mp[val][pos[val]] <= r) pos[val]++;
copypaste3.cpp:73:26: warning: comparison of integer expressions of different signedness: 'std::unordered_map<int, int>::mapped_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |             if (pos[val] == mp[val].size()) nxt[l] = n + 1;

Subtask #1
1.0 / 1.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 354 ms 20788 KB Output is correct
4 Correct 421 ms 23508 KB Output is correct
5 Correct 501 ms 26816 KB Output is correct
6 Correct 595 ms 30156 KB Output is correct
7 Correct 705 ms 33876 KB Output is correct
8 Correct 675 ms 33880 KB Output is correct
9 Correct 682 ms 33996 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 0 ms 324 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 456 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 328 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 2 ms 724 KB Output is correct
41 Correct 5 ms 1320 KB Output is correct
42 Correct 8 ms 1348 KB Output is correct
43 Correct 7 ms 1236 KB Output is correct
44 Correct 8 ms 1236 KB Output is correct
45 Correct 7 ms 1236 KB Output is correct
46 Correct 7 ms 1344 KB Output is correct
47 Correct 6 ms 1236 KB Output is correct
48 Correct 6 ms 1236 KB Output is correct
49 Correct 7 ms 1236 KB Output is correct
50 Correct 6 ms 1220 KB Output is correct
51 Correct 7 ms 1236 KB Output is correct
52 Correct 6 ms 1236 KB Output is correct
53 Correct 7 ms 1220 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 0 ms 324 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 456 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 328 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 2 ms 724 KB Output is correct
41 Correct 5 ms 1320 KB Output is correct
42 Correct 8 ms 1348 KB Output is correct
43 Correct 7 ms 1236 KB Output is correct
44 Correct 8 ms 1236 KB Output is correct
45 Correct 7 ms 1236 KB Output is correct
46 Correct 7 ms 1344 KB Output is correct
47 Correct 6 ms 1236 KB Output is correct
48 Correct 6 ms 1236 KB Output is correct
49 Correct 7 ms 1236 KB Output is correct
50 Correct 6 ms 1220 KB Output is correct
51 Correct 7 ms 1236 KB Output is correct
52 Correct 6 ms 1236 KB Output is correct
53 Correct 7 ms 1220 KB Output is correct
54 Correct 34 ms 3000 KB Output is correct
55 Correct 99 ms 8260 KB Output is correct
56 Correct 180 ms 8448 KB Output is correct
57 Correct 183 ms 8428 KB Output is correct
58 Correct 177 ms 8436 KB Output is correct
59 Correct 179 ms 8444 KB Output is correct
60 Correct 175 ms 8432 KB Output is correct
61 Correct 149 ms 8312 KB Output is correct
62 Correct 98 ms 8276 KB Output is correct
63 Correct 163 ms 8276 KB Output is correct
64 Correct 159 ms 8376 KB Output is correct
65 Correct 148 ms 8276 KB Output is correct
66 Correct 157 ms 8316 KB Output is correct
67 Correct 202 ms 8440 KB Output is correct

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 0 ms 324 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 354 ms 20788 KB Output is correct
14 Correct 421 ms 23508 KB Output is correct
15 Correct 501 ms 26816 KB Output is correct
16 Correct 595 ms 30156 KB Output is correct
17 Correct 705 ms 33876 KB Output is correct
18 Correct 675 ms 33880 KB Output is correct
19 Correct 682 ms 33996 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 328 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 328 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 456 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 1 ms 468 KB Output is correct
48 Correct 1 ms 468 KB Output is correct
49 Correct 1 ms 468 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 328 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 468 KB Output is correct
57 Correct 2 ms 724 KB Output is correct
58 Correct 5 ms 1320 KB Output is correct
59 Correct 8 ms 1348 KB Output is correct
60 Correct 7 ms 1236 KB Output is correct
61 Correct 8 ms 1236 KB Output is correct
62 Correct 7 ms 1236 KB Output is correct
63 Correct 7 ms 1344 KB Output is correct
64 Correct 6 ms 1236 KB Output is correct
65 Correct 6 ms 1236 KB Output is correct
66 Correct 7 ms 1236 KB Output is correct
67 Correct 6 ms 1220 KB Output is correct
68 Correct 7 ms 1236 KB Output is correct
69 Correct 6 ms 1236 KB Output is correct
70 Correct 7 ms 1220 KB Output is correct
71 Correct 34 ms 3000 KB Output is correct
72 Correct 99 ms 8260 KB Output is correct
73 Correct 180 ms 8448 KB Output is correct
74 Correct 183 ms 8428 KB Output is correct
75 Correct 177 ms 8436 KB Output is correct
76 Correct 179 ms 8444 KB Output is correct
77 Correct 175 ms 8432 KB Output is correct
78 Correct 149 ms 8312 KB Output is correct
79 Correct 98 ms 8276 KB Output is correct
80 Correct 163 ms 8276 KB Output is correct
81 Correct 159 ms 8376 KB Output is correct
82 Correct 148 ms 8276 KB Output is correct
83 Correct 157 ms 8316 KB Output is correct
84 Correct 202 ms 8440 KB Output is correct
85 Correct 447 ms 16716 KB Output is correct
86 Correct 1124 ms 34380 KB Output is correct
87 Correct 1119 ms 34252 KB Output is correct
88 Correct 1120 ms 34260 KB Output is correct
89 Incorrect 1113 ms 34276 KB Output isn't correct
90 Halted 0 ms 0 KB -