oj.uz

Submission #555652

# Submission time Handle Problem Language Result Execution time Memory
555652 2022-05-01T10:08:16 Z Koosha_mv Copy and Paste 3 (JOI22_copypaste3) C++14
100 / 100
 1341 ms 67656 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 ll MOD = 1e16 + 61;
    const int X = 48394;
    const int MN = 2505;
    int n;
    string str;
    int aCost, bCost, cCost;
    ll hashes[MN][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';
        FR(i, n) FOR(j, i, n) hashes[i][j+1] = (hashes[i][j]*X + str[j]) % MOD;
     
        for(len = 1; len <= n; len++){
            int num = n-len+1;
            vec.clear();
     
            FR(i, num) vec.pb({hashes[i][i+len], 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 0 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 1 ms 340 KB Output is correct
6 Correct 1 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 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 468 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 173 ms 41256 KB Output is correct
4 Correct 200 ms 46872 KB Output is correct
5 Correct 242 ms 53288 KB Output is correct
6 Correct 284 ms 60072 KB Output is correct
7 Correct 334 ms 67400 KB Output is correct
8 Correct 338 ms 67352 KB Output is correct
9 Correct 333 ms 67444 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 596 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 0 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 1 ms 340 KB Output is correct
6 Correct 1 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 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 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 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 468 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 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 596 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 588 KB Output is correct
33 Correct 1 ms 588 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 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 596 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 0 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 1 ms 340 KB Output is correct
6 Correct 1 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 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 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 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 468 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 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 596 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 588 KB Output is correct
33 Correct 1 ms 588 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 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 596 KB Output is correct
40 Correct 2 ms 980 KB Output is correct
41 Correct 2 ms 2260 KB Output is correct
42 Correct 8 ms 2260 KB Output is correct
43 Correct 8 ms 2260 KB Output is correct
44 Correct 8 ms 2260 KB Output is correct
45 Correct 8 ms 2260 KB Output is correct
46 Correct 7 ms 2260 KB Output is correct
47 Correct 4 ms 2260 KB Output is correct
48 Correct 5 ms 2272 KB Output is correct
49 Correct 6 ms 2248 KB Output is correct
50 Correct 7 ms 2268 KB Output is correct
51 Correct 6 ms 2260 KB Output is correct
52 Correct 7 ms 2248 KB Output is correct
53 Correct 7 ms 2260 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 0 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 1 ms 340 KB Output is correct
6 Correct 1 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 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 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 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 468 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 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 596 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 588 KB Output is correct
33 Correct 1 ms 588 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 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 596 KB Output is correct
40 Correct 2 ms 980 KB Output is correct
41 Correct 2 ms 2260 KB Output is correct
42 Correct 8 ms 2260 KB Output is correct
43 Correct 8 ms 2260 KB Output is correct
44 Correct 8 ms 2260 KB Output is correct
45 Correct 8 ms 2260 KB Output is correct
46 Correct 7 ms 2260 KB Output is correct
47 Correct 4 ms 2260 KB Output is correct
48 Correct 5 ms 2272 KB Output is correct
49 Correct 6 ms 2248 KB Output is correct
50 Correct 7 ms 2268 KB Output is correct
51 Correct 6 ms 2260 KB Output is correct
52 Correct 7 ms 2248 KB Output is correct
53 Correct 7 ms 2260 KB Output is correct
54 Correct 36 ms 5460 KB Output is correct
55 Correct 40 ms 16212 KB Output is correct
56 Correct 183 ms 16324 KB Output is correct
57 Correct 185 ms 16248 KB Output is correct
58 Correct 185 ms 16328 KB Output is correct
59 Correct 177 ms 16232 KB Output is correct
60 Correct 185 ms 16212 KB Output is correct
61 Correct 118 ms 16144 KB Output is correct
62 Correct 49 ms 16164 KB Output is correct
63 Correct 156 ms 16212 KB Output is correct
64 Correct 158 ms 16348 KB Output is correct
65 Correct 124 ms 16212 KB Output is correct
66 Correct 125 ms 16252 KB Output is correct
67 Correct 180 ms 16208 KB Output is correct

Subtask #6
38.0 / 38.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 0 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 0 ms 340 KB Output is correct
8 Correct 0 ms 340 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 468 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 173 ms 41256 KB Output is correct
14 Correct 200 ms 46872 KB Output is correct
15 Correct 242 ms 53288 KB Output is correct
16 Correct 284 ms 60072 KB Output is correct
17 Correct 334 ms 67400 KB Output is correct
18 Correct 338 ms 67352 KB Output is correct
19 Correct 333 ms 67444 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 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 468 KB Output is correct
39 Correct 1 ms 596 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 596 KB Output is correct
42 Correct 1 ms 596 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 596 KB Output is correct
47 Correct 1 ms 468 KB Output is correct
48 Correct 1 ms 596 KB Output is correct
49 Correct 1 ms 588 KB Output is correct
50 Correct 1 ms 588 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 0 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 596 KB Output is correct
57 Correct 2 ms 980 KB Output is correct
58 Correct 2 ms 2260 KB Output is correct
59 Correct 8 ms 2260 KB Output is correct
60 Correct 8 ms 2260 KB Output is correct
61 Correct 8 ms 2260 KB Output is correct
62 Correct 8 ms 2260 KB Output is correct
63 Correct 7 ms 2260 KB Output is correct
64 Correct 4 ms 2260 KB Output is correct
65 Correct 5 ms 2272 KB Output is correct
66 Correct 6 ms 2248 KB Output is correct
67 Correct 7 ms 2268 KB Output is correct
68 Correct 6 ms 2260 KB Output is correct
69 Correct 7 ms 2248 KB Output is correct
70 Correct 7 ms 2260 KB Output is correct
71 Correct 36 ms 5460 KB Output is correct
72 Correct 40 ms 16212 KB Output is correct
73 Correct 183 ms 16324 KB Output is correct
74 Correct 185 ms 16248 KB Output is correct
75 Correct 185 ms 16328 KB Output is correct
76 Correct 177 ms 16232 KB Output is correct
77 Correct 185 ms 16212 KB Output is correct
78 Correct 118 ms 16144 KB Output is correct
79 Correct 49 ms 16164 KB Output is correct
80 Correct 156 ms 16212 KB Output is correct
81 Correct 158 ms 16348 KB Output is correct
82 Correct 124 ms 16212 KB Output is correct
83 Correct 125 ms 16252 KB Output is correct
84 Correct 180 ms 16208 KB Output is correct
85 Correct 486 ms 32716 KB Output is correct
86 Correct 1312 ms 67444 KB Output is correct
87 Correct 1323 ms 67428 KB Output is correct
88 Correct 1302 ms 67548 KB Output is correct
89 Correct 1341 ms 67564 KB Output is correct
90 Correct 1323 ms 67444 KB Output is correct
91 Correct 471 ms 67656 KB Output is correct
92 Correct 436 ms 67404 KB Output is correct
93 Correct 1121 ms 67500 KB Output is correct
94 Correct 1140 ms 67580 KB Output is correct
95 Correct 959 ms 67444 KB Output is correct
96 Correct 955 ms 67444 KB Output is correct
97 Correct 1295 ms 67468 KB Output is correct