oj.uz

Submission #553070

# Submission time Handle Problem Language Result Execution time Memory
553070 2022-04-24T15:04:27 Z BalintR Copy and Paste 3 (JOI22_copypaste3) C++17
62 / 100
 1367 ms 34148 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize "Ofast"

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef complex<double> cmplx;
template <typename T> using minPq = priority_queue<T, vector<T>, greater<T>>;
#define boost() cin.sync_with_stdio(0); cin.tie(0)
#define ms(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define fs first
#define sn second
#define ALL(v) (v).begin(), (v).end()
#define SZ(v) ((int) (v).size())
#define lbv(v, x) (lower_bound((v).begin(), (v).end(), x) - (v).begin())
#define ubv(v, x) (upper_bound((v).begin(), (v).end(), x) - (v).begin())
template <typename T> inline void UNIQUE(vector<T> &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
#define FR(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define FORR(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x) {cout << #x << ' ' << x << endl;}
#define dbgArr(arr, n) {cout << #arr; FR(_i, n) cout << ' ' << arr[_i]; cout << endl;}

const int MOD = 2e9 + 11;
const int X = 48394;
const int MN = 2505;
int n;
string str;
int aCost, bCost, cCost;
ll pws[MN], hashes[MN];
ll dp[MN][MN];
int len;
vector<pll> vec;
int arr[MN];

void proc(int l, int r){
    ms(arr, INF);
    ll minCost = 0;

    int prv = 0;
    FOR(i, l, r){
        int a = vec[i].sn;
        FOR(j, prv, a+1) arr[j] = a;
        prv = a+1;
        minCost = max(minCost, dp[a][a+len]);
    }
    minCost = (ll) aCost*len - minCost + bCost;

    FOR(i, l, r){
        int a = vec[i].sn;
        int pos = a;
        int cur = 0;
        while(arr[pos] != INF){
            pos = arr[pos] + len;
            cur++;
            assert(pos <= n);
            dp[a][pos] = max(dp[a][pos], (ll) cur*len*aCost - minCost - (ll) cur*cCost);
        }
    }
}

int main(){
    boost();
    cin >> n >> str >> aCost >> bCost >> cCost;
    for(char &ch : str) ch -= 'a';
    pws[0] = 1;
    FR(i, n) pws[i+1] = pws[i] * X % MOD;
    FR(i, n) hashes[i+1] = (hashes[i]*X + str[i]) % MOD;

    for(len = 1; len <= n; len++){
        int num = n-len+1;
        vec.clear();

        FR(i, num){
            ll hash = (hashes[i+len] - hashes[i]*pws[len]) % MOD;
            if(hash < 0) hash += MOD;
            vec.pb({hash, i});
        }

        sort(ALL(vec));
        int l = 0;
        FOR(r, 1, num+1){
            if(r == num || vec[r].fs != vec[r-1].fs){
                proc(l, r);
                l = r;
            }
        }

        FR(i, num){
            if(i) dp[i-1][i+len] = max(dp[i-1][i+len], dp[i][i+len]);
            if(i < num-1) dp[i][i+len+1] = max(dp[i][i+len+1], dp[i][i+len]);
        }
    }

    ll ans = (ll) n*aCost - dp[0][n];
    cout << ans << '\n';
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 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 161 ms 20844 KB Output is correct
4 Correct 192 ms 23660 KB Output is correct
5 Correct 233 ms 26936 KB Output is correct
6 Correct 276 ms 30264 KB Output is correct
7 Correct 315 ms 33876 KB Output is correct
8 Correct 320 ms 33968 KB Output is correct
9 Correct 331 ms 33976 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 352 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 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 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 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 340 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 0 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 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 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 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 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 340 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 0 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 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 2 ms 1236 KB Output is correct
42 Correct 7 ms 1236 KB Output is correct
43 Correct 8 ms 1316 KB Output is correct
44 Correct 8 ms 1312 KB Output is correct
45 Correct 9 ms 1308 KB Output is correct
46 Correct 8 ms 1236 KB Output is correct
47 Correct 4 ms 1236 KB Output is correct
48 Correct 7 ms 1316 KB Output is correct
49 Correct 8 ms 1236 KB Output is correct
50 Correct 6 ms 1304 KB Output is correct
51 Correct 7 ms 1236 KB Output is correct
52 Correct 5 ms 1236 KB Output is correct
53 Correct 7 ms 1296 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 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 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 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 340 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 0 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 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 2 ms 1236 KB Output is correct
42 Correct 7 ms 1236 KB Output is correct
43 Correct 8 ms 1316 KB Output is correct
44 Correct 8 ms 1312 KB Output is correct
45 Correct 9 ms 1308 KB Output is correct
46 Correct 8 ms 1236 KB Output is correct
47 Correct 4 ms 1236 KB Output is correct
48 Correct 7 ms 1316 KB Output is correct
49 Correct 8 ms 1236 KB Output is correct
50 Correct 6 ms 1304 KB Output is correct
51 Correct 7 ms 1236 KB Output is correct
52 Correct 5 ms 1236 KB Output is correct
53 Correct 7 ms 1296 KB Output is correct
54 Correct 36 ms 2920 KB Output is correct
55 Correct 37 ms 8276 KB Output is correct
56 Correct 182 ms 8440 KB Output is correct
57 Correct 204 ms 8316 KB Output is correct
58 Correct 178 ms 8288 KB Output is correct
59 Correct 176 ms 8296 KB Output is correct
60 Correct 188 ms 8456 KB Output is correct
61 Correct 122 ms 8312 KB Output is correct
62 Correct 44 ms 8312 KB Output is correct
63 Correct 154 ms 8276 KB Output is correct
64 Correct 207 ms 8240 KB Output is correct
65 Correct 118 ms 8276 KB Output is correct
66 Correct 120 ms 8308 KB Output is correct
67 Correct 186 ms 8260 KB Output is correct

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 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 161 ms 20844 KB Output is correct
14 Correct 192 ms 23660 KB Output is correct
15 Correct 233 ms 26936 KB Output is correct
16 Correct 276 ms 30264 KB Output is correct
17 Correct 315 ms 33876 KB Output is correct
18 Correct 320 ms 33968 KB Output is correct
19 Correct 331 ms 33976 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 352 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 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 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 0 ms 340 KB Output is correct
53 Correct 0 ms 340 KB Output is correct
54 Correct 0 ms 340 KB Output is correct
55 Correct 0 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 2 ms 596 KB Output is correct
58 Correct 2 ms 1236 KB Output is correct
59 Correct 7 ms 1236 KB Output is correct
60 Correct 8 ms 1316 KB Output is correct
61 Correct 8 ms 1312 KB Output is correct
62 Correct 9 ms 1308 KB Output is correct
63 Correct 8 ms 1236 KB Output is correct
64 Correct 4 ms 1236 KB Output is correct
65 Correct 7 ms 1316 KB Output is correct
66 Correct 8 ms 1236 KB Output is correct
67 Correct 6 ms 1304 KB Output is correct
68 Correct 7 ms 1236 KB Output is correct
69 Correct 5 ms 1236 KB Output is correct
70 Correct 7 ms 1296 KB Output is correct
71 Correct 36 ms 2920 KB Output is correct
72 Correct 37 ms 8276 KB Output is correct
73 Correct 182 ms 8440 KB Output is correct
74 Correct 204 ms 8316 KB Output is correct
75 Correct 178 ms 8288 KB Output is correct
76 Correct 176 ms 8296 KB Output is correct
77 Correct 188 ms 8456 KB Output is correct
78 Correct 122 ms 8312 KB Output is correct
79 Correct 44 ms 8312 KB Output is correct
80 Correct 154 ms 8276 KB Output is correct
81 Correct 207 ms 8240 KB Output is correct
82 Correct 118 ms 8276 KB Output is correct
83 Correct 120 ms 8308 KB Output is correct
84 Correct 186 ms 8260 KB Output is correct
85 Correct 489 ms 16552 KB Output is correct
86 Correct 1311 ms 33960 KB Output is correct
87 Correct 1341 ms 34076 KB Output is correct
88 Correct 1337 ms 34060 KB Output is correct
89 Correct 1345 ms 33968 KB Output is correct
90 Correct 1337 ms 33932 KB Output is correct
91 Correct 446 ms 33880 KB Output is correct
92 Correct 469 ms 33996 KB Output is correct
93 Correct 1139 ms 34044 KB Output is correct
94 Correct 1183 ms 34008 KB Output is correct
95 Correct 995 ms 34008 KB Output is correct
96 Correct 956 ms 33972 KB Output is correct
97 Incorrect 1367 ms 34148 KB Output isn't correct
98 Halted 0 ms 0 KB -