oj.uz

Submission #715989

# Submission time Handle Problem Language Result Execution time Memory
715989 2023-03-28T17:47:21 Z Darren0724 Copy and Paste 3 (JOI22_copypaste3) C++17
57 / 100
 3000 ms 72140 KB 
#pragma GCC optimize("Ofast","O3","unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(),x.end()
#define x first
#define y second
#define endl '\n'
const int K=29,mod=1234567891,INF=1e18;
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;cin>>n;
    vector<char> v(n+1);
    for(int i=1;i<=n;i++){
        cin>>v[i];
    }
    int A,B,C;cin>>A>>B>>C;
    vector<vector<int>> h(n+2,vector<int>(n+2));
    for(int i=1;i<=n;i++){
        for(int j=i;j<=n;j++){
            h[i][j]=h[i][j-1]*K+v[j]-'a'+1;
            h[i][j]%=mod;
        }
    }
    vector<vector<int>> dp(n+2,vector<int>(n+2,INF));
    for(int i=1;i<=n;i++){
        dp[i][i]=A;
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j+i-1<=n;j++){
            int k=j+i-1;
            dp[j][k]=min({dp[j+1][k]+A,dp[j][k-1]+A,dp[j][k]});
            int cnt=1,cnt1=0;
            int j1=k+1;
            while(j1<=n){
                if(j1+i-1<=n&&h[j][k]==h[j1][j1+i-1]){
                    for(int j2=j1;j2<j1+i-1;j2++){
                        //cout<<"---"<<endl;
                        //cout<<j<<' '<<k<<' '<<j2<<endl;
                        cnt1++;
                        dp[j][j2]=min(dp[j][j2],dp[j][k]+A*cnt1+B+C*cnt);
                        //cnt1++;
                    }
                    cnt1-=i-1;
                    cnt++;
                    dp[j][j1+i-1]=min(dp[j][j1+i-1],dp[j][k]+A*cnt1+B+C*cnt);
                    j1=j1+i;
                }
                else{
                    cnt1++;
                    //cout<<j<<' '<<k<<' '<<j1<<endl;
                    dp[j][j1]=min(dp[j][j1],dp[j][k]+A*cnt1+B+C*cnt);
                    j1++;
                }
            }
        }
    }
    /*for(int i=1;i<=n;i++){
        for(int j=i;j<=n;j++){
            cout<<dp[i][j]<<' ';
        }
        cout<<endl;
    }*/
    cout<<dp[1][n]<<endl;
    return 0;
}
/*
10 20 30 40 50 49 59 51 59 69 79
10 20 30 40 39 49 41 49 59 69
10 20 30 29 39 31 41 49 59
10 20 30 40 39 49 49 59
10 20 30 40 39 49 59
10 20 30 29 39 49
10 20 30 40 50
10 20 30 40
10 20 30
10 20
10
*/

Subtask #1
1.0 / 1.0

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

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2008 ms 52888 KB Output is correct
4 Correct 2473 ms 61756 KB Output is correct
5 Execution timed out 3054 ms 72140 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 316 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 320 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 324 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 212 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 320 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 316 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 320 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 324 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 212 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 320 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 320 KB Output is correct
41 Correct 4 ms 964 KB Output is correct
42 Correct 5 ms 852 KB Output is correct
43 Correct 5 ms 980 KB Output is correct
44 Correct 5 ms 852 KB Output is correct
45 Correct 6 ms 852 KB Output is correct
46 Correct 5 ms 980 KB Output is correct
47 Correct 4 ms 852 KB Output is correct
48 Correct 4 ms 852 KB Output is correct
49 Correct 5 ms 852 KB Output is correct
50 Correct 4 ms 852 KB Output is correct
51 Correct 4 ms 852 KB Output is correct
52 Correct 4 ms 852 KB Output is correct
53 Correct 4 ms 960 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 316 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 320 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 324 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 212 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 320 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 320 KB Output is correct
41 Correct 4 ms 964 KB Output is correct
42 Correct 5 ms 852 KB Output is correct
43 Correct 5 ms 980 KB Output is correct
44 Correct 5 ms 852 KB Output is correct
45 Correct 6 ms 852 KB Output is correct
46 Correct 5 ms 980 KB Output is correct
47 Correct 4 ms 852 KB Output is correct
48 Correct 4 ms 852 KB Output is correct
49 Correct 5 ms 852 KB Output is correct
50 Correct 4 ms 852 KB Output is correct
51 Correct 4 ms 852 KB Output is correct
52 Correct 4 ms 852 KB Output is correct
53 Correct 4 ms 960 KB Output is correct
54 Correct 43 ms 3488 KB Output is correct
55 Correct 280 ms 16116 KB Output is correct
56 Correct 421 ms 16108 KB Output is correct
57 Correct 428 ms 16108 KB Output is correct
58 Correct 426 ms 16108 KB Output is correct
59 Correct 418 ms 16084 KB Output is correct
60 Correct 438 ms 16104 KB Output is correct
61 Correct 382 ms 16032 KB Output is correct
62 Correct 297 ms 16156 KB Output is correct
63 Correct 395 ms 16108 KB Output is correct
64 Correct 417 ms 16204 KB Output is correct
65 Correct 387 ms 16120 KB Output is correct
66 Correct 365 ms 16084 KB Output is correct
67 Correct 458 ms 16112 KB Output is correct

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 2008 ms 52888 KB Output is correct
14 Correct 2473 ms 61756 KB Output is correct
15 Execution timed out 3054 ms 72140 KB Time limit exceeded
16 Halted 0 ms 0 KB -