oj.uz

Submission #547033

# Submission time Handle Problem Language Result Execution time Memory
547033 2022-04-09T09:03:52 Z ngrace Copy and Paste 3 (JOI22_copypaste3) C++14
62 / 100
 3000 ms 1883804 KB 
#include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <string>
using namespace std;
#define v vector
#define ll long long
#define pii pair<int,int>
#define fi first
#define se second
 
int main(){
    int N;
    cin>>N;
    string S;
    cin>>S;
    ll A,B,C;
    cin>>A>>B>>C;
 
    map<string, int> subToInd;
    int pairToInd[N][N+1];
    v<int> indToStarts[N*N+10];
    int subInd=1;
    for(int l=0; l<N; l++){
        string sub;
        for(int r=l; r<N; r++){
            sub.push_back(S[r]);
            int ind=subToInd[sub];
            if(ind==0){
                ind=subInd;
                subToInd[sub]=subInd++;
            }
            pairToInd[l][r-l+1] = ind;
            indToStarts[ind].push_back(l);
        }
    }
 
    v<v<int>> nextOccur(N,v<int>(N+1,N));
    for(int i=N-1; i>=0; i--){
        for(int s=1; s<=N-i; s++){
            int ind=pairToInd[i][s];
            v<int>::iterator next = lower_bound(indToStarts[ind].begin(), indToStarts[ind].end(), i+s);
            if(next!=indToStarts[ind].end()) nextOccur[i][s]=(*next);
        }
    }
 
    
    v<v<ll>> dp(N, v<ll>(N,1e17));
    for(int s=1; s<=N; s++){
        for(int l=N-1; l>=0; l--){
            dp[l][l]=A;
            if(s!=1 && l+s-1<N){
                dp[l][l+s-1] = min(dp[l][l+s-1], A+dp[l+1][l+s-1]);
                dp[l][l+s-1] = min(dp[l][l+s-1], dp[l][l+s-1-1]+A);
            }
            int num=2, nex=nextOccur[l][s];
            while(nex<N){
                int r=nex+s-1;
                dp[l][r] = min(dp[l][r], dp[l][l+s-1]+B+C*num+(r-l+1 - num*s)*A);
                dp[l][r] = min(dp[l][r], A+dp[l+1][r]);
                dp[l][r] = min(dp[l][r], dp[l][r-1]+A);
                nex=nextOccur[nex][s];
                num++;
            }
        }
    }
 
    cout<<dp[0][N-1]<<endl;
}

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 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 878 ms 142408 KB Output is correct
4 Correct 1061 ms 165988 KB Output is correct
5 Correct 1359 ms 194288 KB Output is correct
6 Correct 1691 ms 227108 KB Output is correct
7 Correct 2037 ms 266028 KB Output is correct
8 Correct 2031 ms 265968 KB Output is correct
9 Correct 2067 ms 266100 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct

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 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 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 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 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 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 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 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 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 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 3 ms 980 KB Output is correct
41 Correct 5 ms 2004 KB Output is correct
42 Correct 14 ms 5448 KB Output is correct
43 Correct 15 ms 5460 KB Output is correct
44 Correct 14 ms 5588 KB Output is correct
45 Correct 14 ms 5588 KB Output is correct
46 Correct 15 ms 5588 KB Output is correct
47 Correct 7 ms 2900 KB Output is correct
48 Correct 10 ms 4180 KB Output is correct
49 Correct 12 ms 4788 KB Output is correct
50 Correct 12 ms 4852 KB Output is correct
51 Correct 11 ms 4120 KB Output is correct
52 Correct 12 ms 4180 KB Output is correct
53 Correct 15 ms 5588 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 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 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 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 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 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 3 ms 980 KB Output is correct
41 Correct 5 ms 2004 KB Output is correct
42 Correct 14 ms 5448 KB Output is correct
43 Correct 15 ms 5460 KB Output is correct
44 Correct 14 ms 5588 KB Output is correct
45 Correct 14 ms 5588 KB Output is correct
46 Correct 15 ms 5588 KB Output is correct
47 Correct 7 ms 2900 KB Output is correct
48 Correct 10 ms 4180 KB Output is correct
49 Correct 12 ms 4788 KB Output is correct
50 Correct 12 ms 4852 KB Output is correct
51 Correct 11 ms 4120 KB Output is correct
52 Correct 12 ms 4180 KB Output is correct
53 Correct 15 ms 5588 KB Output is correct
54 Correct 88 ms 34828 KB Output is correct
55 Correct 186 ms 42800 KB Output is correct
56 Correct 614 ms 264736 KB Output is correct
57 Correct 598 ms 265212 KB Output is correct
58 Correct 575 ms 265208 KB Output is correct
59 Correct 566 ms 265384 KB Output is correct
60 Correct 588 ms 265484 KB Output is correct
61 Correct 397 ms 158448 KB Output is correct
62 Correct 177 ms 44508 KB Output is correct
63 Correct 500 ms 234400 KB Output is correct
64 Correct 506 ms 237920 KB Output is correct
65 Correct 447 ms 188800 KB Output is correct
66 Correct 469 ms 188828 KB Output is correct
67 Correct 569 ms 265404 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 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 878 ms 142408 KB Output is correct
14 Correct 1061 ms 165988 KB Output is correct
15 Correct 1359 ms 194288 KB Output is correct
16 Correct 1691 ms 227108 KB Output is correct
17 Correct 2037 ms 266028 KB Output is correct
18 Correct 2031 ms 265968 KB Output is correct
19 Correct 2067 ms 266100 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 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 340 KB Output is correct
45 Correct 1 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 340 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 3 ms 980 KB Output is correct
58 Correct 5 ms 2004 KB Output is correct
59 Correct 14 ms 5448 KB Output is correct
60 Correct 15 ms 5460 KB Output is correct
61 Correct 14 ms 5588 KB Output is correct
62 Correct 14 ms 5588 KB Output is correct
63 Correct 15 ms 5588 KB Output is correct
64 Correct 7 ms 2900 KB Output is correct
65 Correct 10 ms 4180 KB Output is correct
66 Correct 12 ms 4788 KB Output is correct
67 Correct 12 ms 4852 KB Output is correct
68 Correct 11 ms 4120 KB Output is correct
69 Correct 12 ms 4180 KB Output is correct
70 Correct 15 ms 5588 KB Output is correct
71 Correct 88 ms 34828 KB Output is correct
72 Correct 186 ms 42800 KB Output is correct
73 Correct 614 ms 264736 KB Output is correct
74 Correct 598 ms 265212 KB Output is correct
75 Correct 575 ms 265208 KB Output is correct
76 Correct 566 ms 265384 KB Output is correct
77 Correct 588 ms 265484 KB Output is correct
78 Correct 397 ms 158448 KB Output is correct
79 Correct 177 ms 44508 KB Output is correct
80 Correct 500 ms 234400 KB Output is correct
81 Correct 506 ms 237920 KB Output is correct
82 Correct 447 ms 188800 KB Output is correct
83 Correct 469 ms 188828 KB Output is correct
84 Correct 569 ms 265404 KB Output is correct
85 Correct 1763 ms 898968 KB Output is correct
86 Execution timed out 3150 ms 1883804 KB Time limit exceeded
87 Halted 0 ms 0 KB -