oj.uz

Submission #567791

# Submission time Handle Problem Language Result Execution time Memory
567791 2022-05-24T08:06:42 Z tqbfjotld Copy and Paste 3 (JOI22_copypaste3) C++14
62 / 100
 1434 ms 2097152 KB 
#include <bits/stdc++.h>
using namespace std;

char arr[2505];
long long A,B,C;
long long mem[2505*1305];
int ct = 1;

struct node{
    int nid;
    short len;
    vector<short> vals;
    node*ch[26];
    vector<short> decomp[12];
    node(int _len){
        nid = ct++;
        len = _len;
        for (int x = 0; x<26; x++){
            ch[x] = 0;
        }
    }
    void construct(){
        //printf("call construct len %lld\n",len);
        for (int x = 0; x<vals.size(); x++){
            decomp[0].push_back(lower_bound(vals.begin(),vals.end(),vals[x]+len)-vals.begin());
        }
        decomp[0].push_back(vals.size());
        for (int x = 1; x<12; x++){
            for (int y = 0; y<=vals.size(); y++){
                decomp[x].push_back(decomp[x-1][decomp[x-1][y]]);
            }
        }
    }
    void constructall(){
        construct();
        for (int x = 0; x<26; x++){
            if (ch[x]!=0){
                ch[x]->constructall();
            }
        }
    }
    int cntocc(int st, int en){
        //printf("call cntocc %lld %lld, len %lld\n",st,en,len);
        int cur = lower_bound(vals.begin(),vals.end(),st)-vals.begin();
        int ans = 1;
        int r = upper_bound(vals.begin(),vals.end(),en-len)-vals.begin();
        for (int x = 11; x>=0; x--){
            if (decomp[x][cur]<r){
                ans += (1<<x);
                cur = decomp[x][cur];
            }
        }
        return ans;
    }
}*rt;

node* pt[2505][2505];

int cntocc(int a, int b, int st, int en){
    return pt[a][b]->cntocc(st,en);
}


long long func(int a, int b){
    if (a==b) return 0;
    if (mem[pt[a][b]->nid]!=-1) return mem[pt[a][b]->nid];
    long long ans = func(a+1,b)+A;
    for (int x = 1; x<b-a; x++){
        long long t = func(a,a+x);
        int t2 = cntocc(a,a+x,a,b);
        ans = min(ans,t+B+t2*C+(b-a-x*t2)*A);
        if (t2==1) break;
    }
    //printf("func %lld %lld = %lld\n",a,b,ans);
    return mem[pt[a][b]->nid] = ans;
}

main(){
    int n;
    scanf("%d",&n);
    for (int x = 0; x<n; x++){
        scanf(" %c",&arr[x]);
    }
    scanf("%lld%lld%lld",&A,&B,&C);
    memset(mem,-1,sizeof(mem));
    for (int x = 0; x<n; x++){
        if (rt==0){
            rt = new node(0);
        }
        node *cur = rt;
        for (int y = x+1; y<=n; y++){
            if (cur->ch[arr[y-1]-'a']==0){
                cur->ch[arr[y-1]-'a'] = new node(y-x);
            }
            cur = cur->ch[arr[y-1]-'a'];
            cur->vals.push_back(x);
            pt[x][y] = cur;
        }
    }
    rt->constructall();
    printf("%lld",func(0,n));
}

Compilation message

copypaste3.cpp: In member function 'void node::construct()':
copypaste3.cpp:24:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |         for (int x = 0; x<vals.size(); x++){
      |                         ~^~~~~~~~~~~~
copypaste3.cpp:29:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |             for (int y = 0; y<=vals.size(); y++){
      |                             ~^~~~~~~~~~~~~
copypaste3.cpp: At global scope:
copypaste3.cpp:78:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   78 | main(){
      | ^~~~
copypaste3.cpp: In function 'int main()':
copypaste3.cpp:80:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
copypaste3.cpp:82:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |         scanf(" %c",&arr[x]);
      |         ~~~~~^~~~~~~~~~~~~~~
copypaste3.cpp:84:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |     scanf("%lld%lld%lld",&A,&B,&C);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 25916 KB Output is correct
2 Correct 11 ms 25912 KB Output is correct
3 Correct 11 ms 25848 KB Output is correct
4 Correct 11 ms 25828 KB Output is correct
5 Correct 11 ms 25812 KB Output is correct
6 Correct 11 ms 25872 KB Output is correct
7 Correct 11 ms 25888 KB Output is correct
8 Correct 10 ms 25812 KB Output is correct
9 Correct 11 ms 25812 KB Output is correct
10 Correct 11 ms 25812 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 25932 KB Output is correct
2 Correct 13 ms 25804 KB Output is correct
3 Correct 336 ms 107668 KB Output is correct
4 Correct 388 ms 118420 KB Output is correct
5 Correct 469 ms 134772 KB Output is correct
6 Correct 566 ms 156332 KB Output is correct
7 Correct 653 ms 179996 KB Output is correct
8 Correct 595 ms 180044 KB Output is correct
9 Correct 643 ms 179948 KB Output is correct
10 Correct 11 ms 25812 KB Output is correct
11 Correct 12 ms 25812 KB Output is correct
12 Correct 13 ms 25844 KB Output is correct
13 Correct 11 ms 25812 KB Output is correct
14 Correct 12 ms 25916 KB Output is correct
15 Correct 11 ms 25940 KB Output is correct
16 Correct 11 ms 26004 KB Output is correct
17 Correct 11 ms 25812 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 25916 KB Output is correct
2 Correct 11 ms 25912 KB Output is correct
3 Correct 11 ms 25848 KB Output is correct
4 Correct 11 ms 25828 KB Output is correct
5 Correct 11 ms 25812 KB Output is correct
6 Correct 11 ms 25872 KB Output is correct
7 Correct 11 ms 25888 KB Output is correct
8 Correct 10 ms 25812 KB Output is correct
9 Correct 11 ms 25812 KB Output is correct
10 Correct 11 ms 25812 KB Output is correct
11 Correct 10 ms 25940 KB Output is correct
12 Correct 12 ms 25940 KB Output is correct
13 Correct 11 ms 26008 KB Output is correct
14 Correct 11 ms 25940 KB Output is correct
15 Correct 12 ms 26068 KB Output is correct
16 Correct 11 ms 25972 KB Output is correct
17 Correct 11 ms 25812 KB Output is correct
18 Correct 14 ms 25812 KB Output is correct
19 Correct 12 ms 25940 KB Output is correct
20 Correct 11 ms 25812 KB Output is correct
21 Correct 12 ms 26068 KB Output is correct
22 Correct 11 ms 26292 KB Output is correct
23 Correct 11 ms 26324 KB Output is correct
24 Correct 11 ms 26324 KB Output is correct
25 Correct 12 ms 26324 KB Output is correct
26 Correct 12 ms 26452 KB Output is correct
27 Correct 11 ms 26068 KB Output is correct
28 Correct 12 ms 26068 KB Output is correct
29 Correct 12 ms 26280 KB Output is correct
30 Correct 12 ms 26320 KB Output is correct
31 Correct 11 ms 26324 KB Output is correct
32 Correct 14 ms 26220 KB Output is correct
33 Correct 12 ms 26428 KB Output is correct
34 Correct 12 ms 25812 KB Output is correct
35 Correct 12 ms 25812 KB Output is correct
36 Correct 12 ms 25812 KB Output is correct
37 Correct 11 ms 25940 KB Output is correct
38 Correct 13 ms 25980 KB Output is correct
39 Correct 13 ms 26036 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 25916 KB Output is correct
2 Correct 11 ms 25912 KB Output is correct
3 Correct 11 ms 25848 KB Output is correct
4 Correct 11 ms 25828 KB Output is correct
5 Correct 11 ms 25812 KB Output is correct
6 Correct 11 ms 25872 KB Output is correct
7 Correct 11 ms 25888 KB Output is correct
8 Correct 10 ms 25812 KB Output is correct
9 Correct 11 ms 25812 KB Output is correct
10 Correct 11 ms 25812 KB Output is correct
11 Correct 10 ms 25940 KB Output is correct
12 Correct 12 ms 25940 KB Output is correct
13 Correct 11 ms 26008 KB Output is correct
14 Correct 11 ms 25940 KB Output is correct
15 Correct 12 ms 26068 KB Output is correct
16 Correct 11 ms 25972 KB Output is correct
17 Correct 11 ms 25812 KB Output is correct
18 Correct 14 ms 25812 KB Output is correct
19 Correct 12 ms 25940 KB Output is correct
20 Correct 11 ms 25812 KB Output is correct
21 Correct 12 ms 26068 KB Output is correct
22 Correct 11 ms 26292 KB Output is correct
23 Correct 11 ms 26324 KB Output is correct
24 Correct 11 ms 26324 KB Output is correct
25 Correct 12 ms 26324 KB Output is correct
26 Correct 12 ms 26452 KB Output is correct
27 Correct 11 ms 26068 KB Output is correct
28 Correct 12 ms 26068 KB Output is correct
29 Correct 12 ms 26280 KB Output is correct
30 Correct 12 ms 26320 KB Output is correct
31 Correct 11 ms 26324 KB Output is correct
32 Correct 14 ms 26220 KB Output is correct
33 Correct 12 ms 26428 KB Output is correct
34 Correct 12 ms 25812 KB Output is correct
35 Correct 12 ms 25812 KB Output is correct
36 Correct 12 ms 25812 KB Output is correct
37 Correct 11 ms 25940 KB Output is correct
38 Correct 13 ms 25980 KB Output is correct
39 Correct 13 ms 26036 KB Output is correct
40 Correct 17 ms 29288 KB Output is correct
41 Correct 14 ms 27732 KB Output is correct
42 Correct 37 ms 44508 KB Output is correct
43 Correct 44 ms 44984 KB Output is correct
44 Correct 36 ms 45260 KB Output is correct
45 Correct 35 ms 45388 KB Output is correct
46 Correct 32 ms 45536 KB Output is correct
47 Correct 21 ms 31240 KB Output is correct
48 Correct 28 ms 37844 KB Output is correct
49 Correct 35 ms 40592 KB Output is correct
50 Correct 31 ms 40788 KB Output is correct
51 Correct 39 ms 36700 KB Output is correct
52 Correct 30 ms 36840 KB Output is correct
53 Correct 33 ms 45524 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 25916 KB Output is correct
2 Correct 11 ms 25912 KB Output is correct
3 Correct 11 ms 25848 KB Output is correct
4 Correct 11 ms 25828 KB Output is correct
5 Correct 11 ms 25812 KB Output is correct
6 Correct 11 ms 25872 KB Output is correct
7 Correct 11 ms 25888 KB Output is correct
8 Correct 10 ms 25812 KB Output is correct
9 Correct 11 ms 25812 KB Output is correct
10 Correct 11 ms 25812 KB Output is correct
11 Correct 10 ms 25940 KB Output is correct
12 Correct 12 ms 25940 KB Output is correct
13 Correct 11 ms 26008 KB Output is correct
14 Correct 11 ms 25940 KB Output is correct
15 Correct 12 ms 26068 KB Output is correct
16 Correct 11 ms 25972 KB Output is correct
17 Correct 11 ms 25812 KB Output is correct
18 Correct 14 ms 25812 KB Output is correct
19 Correct 12 ms 25940 KB Output is correct
20 Correct 11 ms 25812 KB Output is correct
21 Correct 12 ms 26068 KB Output is correct
22 Correct 11 ms 26292 KB Output is correct
23 Correct 11 ms 26324 KB Output is correct
24 Correct 11 ms 26324 KB Output is correct
25 Correct 12 ms 26324 KB Output is correct
26 Correct 12 ms 26452 KB Output is correct
27 Correct 11 ms 26068 KB Output is correct
28 Correct 12 ms 26068 KB Output is correct
29 Correct 12 ms 26280 KB Output is correct
30 Correct 12 ms 26320 KB Output is correct
31 Correct 11 ms 26324 KB Output is correct
32 Correct 14 ms 26220 KB Output is correct
33 Correct 12 ms 26428 KB Output is correct
34 Correct 12 ms 25812 KB Output is correct
35 Correct 12 ms 25812 KB Output is correct
36 Correct 12 ms 25812 KB Output is correct
37 Correct 11 ms 25940 KB Output is correct
38 Correct 13 ms 25980 KB Output is correct
39 Correct 13 ms 26036 KB Output is correct
40 Correct 17 ms 29288 KB Output is correct
41 Correct 14 ms 27732 KB Output is correct
42 Correct 37 ms 44508 KB Output is correct
43 Correct 44 ms 44984 KB Output is correct
44 Correct 36 ms 45260 KB Output is correct
45 Correct 35 ms 45388 KB Output is correct
46 Correct 32 ms 45536 KB Output is correct
47 Correct 21 ms 31240 KB Output is correct
48 Correct 28 ms 37844 KB Output is correct
49 Correct 35 ms 40592 KB Output is correct
50 Correct 31 ms 40788 KB Output is correct
51 Correct 39 ms 36700 KB Output is correct
52 Correct 30 ms 36840 KB Output is correct
53 Correct 33 ms 45524 KB Output is correct
54 Correct 131 ms 119556 KB Output is correct
55 Correct 100 ms 51872 KB Output is correct
56 Correct 558 ms 495952 KB Output is correct
57 Correct 583 ms 499200 KB Output is correct
58 Correct 540 ms 501348 KB Output is correct
59 Correct 572 ms 502252 KB Output is correct
60 Correct 620 ms 502644 KB Output is correct
61 Correct 424 ms 233576 KB Output is correct
62 Correct 107 ms 55396 KB Output is correct
63 Correct 518 ms 384228 KB Output is correct
64 Correct 536 ms 388172 KB Output is correct
65 Correct 581 ms 264804 KB Output is correct
66 Correct 565 ms 264784 KB Output is correct
67 Correct 583 ms 502740 KB Output is correct

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 25916 KB Output is correct
2 Correct 11 ms 25912 KB Output is correct
3 Correct 11 ms 25848 KB Output is correct
4 Correct 11 ms 25828 KB Output is correct
5 Correct 11 ms 25812 KB Output is correct
6 Correct 11 ms 25872 KB Output is correct
7 Correct 11 ms 25888 KB Output is correct
8 Correct 10 ms 25812 KB Output is correct
9 Correct 11 ms 25812 KB Output is correct
10 Correct 11 ms 25812 KB Output is correct
11 Correct 13 ms 25932 KB Output is correct
12 Correct 13 ms 25804 KB Output is correct
13 Correct 336 ms 107668 KB Output is correct
14 Correct 388 ms 118420 KB Output is correct
15 Correct 469 ms 134772 KB Output is correct
16 Correct 566 ms 156332 KB Output is correct
17 Correct 653 ms 179996 KB Output is correct
18 Correct 595 ms 180044 KB Output is correct
19 Correct 643 ms 179948 KB Output is correct
20 Correct 11 ms 25812 KB Output is correct
21 Correct 12 ms 25812 KB Output is correct
22 Correct 13 ms 25844 KB Output is correct
23 Correct 11 ms 25812 KB Output is correct
24 Correct 12 ms 25916 KB Output is correct
25 Correct 11 ms 25940 KB Output is correct
26 Correct 11 ms 26004 KB Output is correct
27 Correct 11 ms 25812 KB Output is correct
28 Correct 10 ms 25940 KB Output is correct
29 Correct 12 ms 25940 KB Output is correct
30 Correct 11 ms 26008 KB Output is correct
31 Correct 11 ms 25940 KB Output is correct
32 Correct 12 ms 26068 KB Output is correct
33 Correct 11 ms 25972 KB Output is correct
34 Correct 11 ms 25812 KB Output is correct
35 Correct 14 ms 25812 KB Output is correct
36 Correct 12 ms 25940 KB Output is correct
37 Correct 11 ms 25812 KB Output is correct
38 Correct 12 ms 26068 KB Output is correct
39 Correct 11 ms 26292 KB Output is correct
40 Correct 11 ms 26324 KB Output is correct
41 Correct 11 ms 26324 KB Output is correct
42 Correct 12 ms 26324 KB Output is correct
43 Correct 12 ms 26452 KB Output is correct
44 Correct 11 ms 26068 KB Output is correct
45 Correct 12 ms 26068 KB Output is correct
46 Correct 12 ms 26280 KB Output is correct
47 Correct 12 ms 26320 KB Output is correct
48 Correct 11 ms 26324 KB Output is correct
49 Correct 14 ms 26220 KB Output is correct
50 Correct 12 ms 26428 KB Output is correct
51 Correct 12 ms 25812 KB Output is correct
52 Correct 12 ms 25812 KB Output is correct
53 Correct 12 ms 25812 KB Output is correct
54 Correct 11 ms 25940 KB Output is correct
55 Correct 13 ms 25980 KB Output is correct
56 Correct 13 ms 26036 KB Output is correct
57 Correct 17 ms 29288 KB Output is correct
58 Correct 14 ms 27732 KB Output is correct
59 Correct 37 ms 44508 KB Output is correct
60 Correct 44 ms 44984 KB Output is correct
61 Correct 36 ms 45260 KB Output is correct
62 Correct 35 ms 45388 KB Output is correct
63 Correct 32 ms 45536 KB Output is correct
64 Correct 21 ms 31240 KB Output is correct
65 Correct 28 ms 37844 KB Output is correct
66 Correct 35 ms 40592 KB Output is correct
67 Correct 31 ms 40788 KB Output is correct
68 Correct 39 ms 36700 KB Output is correct
69 Correct 30 ms 36840 KB Output is correct
70 Correct 33 ms 45524 KB Output is correct
71 Correct 131 ms 119556 KB Output is correct
72 Correct 100 ms 51872 KB Output is correct
73 Correct 558 ms 495952 KB Output is correct
74 Correct 583 ms 499200 KB Output is correct
75 Correct 540 ms 501348 KB Output is correct
76 Correct 572 ms 502252 KB Output is correct
77 Correct 620 ms 502644 KB Output is correct
78 Correct 424 ms 233576 KB Output is correct
79 Correct 107 ms 55396 KB Output is correct
80 Correct 518 ms 384228 KB Output is correct
81 Correct 536 ms 388172 KB Output is correct
82 Correct 581 ms 264804 KB Output is correct
83 Correct 565 ms 264784 KB Output is correct
84 Correct 583 ms 502740 KB Output is correct
85 Correct 1359 ms 1203196 KB Output is correct
86 Runtime error 1434 ms 2097152 KB Execution killed with signal 9
87 Halted 0 ms 0 KB -