oj.uz

답안 #567790

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
567790 2022-05-24T08:04:20 Z tqbfjotld Copy and Paste 3 (JOI22_copypaste3) C++14
62 / 100
 1807 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[15];
    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<15; 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 = 14; 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

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25812 KB Output is correct
2 Correct 11 ms 25812 KB Output is correct
3 Correct 12 ms 25812 KB Output is correct
4 Correct 14 ms 25812 KB Output is correct
5 Correct 12 ms 25828 KB Output is correct
6 Correct 11 ms 25840 KB Output is correct
7 Correct 11 ms 25824 KB Output is correct
8 Correct 10 ms 25824 KB Output is correct
9 Correct 11 ms 25940 KB Output is correct
10 Correct 15 ms 25812 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 25908 KB Output is correct
2 Correct 15 ms 25812 KB Output is correct
3 Correct 375 ms 121672 KB Output is correct
4 Correct 419 ms 134208 KB Output is correct
5 Correct 498 ms 153684 KB Output is correct
6 Correct 566 ms 179364 KB Output is correct
7 Correct 739 ms 207476 KB Output is correct
8 Correct 794 ms 207648 KB Output is correct
9 Correct 696 ms 207584 KB Output is correct
10 Correct 11 ms 25812 KB Output is correct
11 Correct 11 ms 25812 KB Output is correct
12 Correct 11 ms 25812 KB Output is correct
13 Correct 12 ms 25904 KB Output is correct
14 Correct 11 ms 25940 KB Output is correct
15 Correct 11 ms 25940 KB Output is correct
16 Correct 13 ms 26052 KB Output is correct
17 Correct 12 ms 25912 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25812 KB Output is correct
2 Correct 11 ms 25812 KB Output is correct
3 Correct 12 ms 25812 KB Output is correct
4 Correct 14 ms 25812 KB Output is correct
5 Correct 12 ms 25828 KB Output is correct
6 Correct 11 ms 25840 KB Output is correct
7 Correct 11 ms 25824 KB Output is correct
8 Correct 10 ms 25824 KB Output is correct
9 Correct 11 ms 25940 KB Output is correct
10 Correct 15 ms 25812 KB Output is correct
11 Correct 12 ms 25940 KB Output is correct
12 Correct 12 ms 25944 KB Output is correct
13 Correct 12 ms 26068 KB Output is correct
14 Correct 14 ms 25940 KB Output is correct
15 Correct 12 ms 26068 KB Output is correct
16 Correct 15 ms 26036 KB Output is correct
17 Correct 11 ms 25844 KB Output is correct
18 Correct 11 ms 25892 KB Output is correct
19 Correct 12 ms 25940 KB Output is correct
20 Correct 11 ms 25816 KB Output is correct
21 Correct 14 ms 26068 KB Output is correct
22 Correct 13 ms 26324 KB Output is correct
23 Correct 15 ms 26384 KB Output is correct
24 Correct 13 ms 26412 KB Output is correct
25 Correct 13 ms 26476 KB Output is correct
26 Correct 13 ms 26520 KB Output is correct
27 Correct 12 ms 26068 KB Output is correct
28 Correct 15 ms 26048 KB Output is correct
29 Correct 12 ms 26324 KB Output is correct
30 Correct 11 ms 26312 KB Output is correct
31 Correct 12 ms 26324 KB Output is correct
32 Correct 12 ms 26324 KB Output is correct
33 Correct 12 ms 26452 KB Output is correct
34 Correct 11 ms 25812 KB Output is correct
35 Correct 11 ms 25812 KB Output is correct
36 Correct 12 ms 25904 KB Output is correct
37 Correct 13 ms 25940 KB Output is correct
38 Correct 15 ms 25940 KB Output is correct
39 Correct 12 ms 26040 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25812 KB Output is correct
2 Correct 11 ms 25812 KB Output is correct
3 Correct 12 ms 25812 KB Output is correct
4 Correct 14 ms 25812 KB Output is correct
5 Correct 12 ms 25828 KB Output is correct
6 Correct 11 ms 25840 KB Output is correct
7 Correct 11 ms 25824 KB Output is correct
8 Correct 10 ms 25824 KB Output is correct
9 Correct 11 ms 25940 KB Output is correct
10 Correct 15 ms 25812 KB Output is correct
11 Correct 12 ms 25940 KB Output is correct
12 Correct 12 ms 25944 KB Output is correct
13 Correct 12 ms 26068 KB Output is correct
14 Correct 14 ms 25940 KB Output is correct
15 Correct 12 ms 26068 KB Output is correct
16 Correct 15 ms 26036 KB Output is correct
17 Correct 11 ms 25844 KB Output is correct
18 Correct 11 ms 25892 KB Output is correct
19 Correct 12 ms 25940 KB Output is correct
20 Correct 11 ms 25816 KB Output is correct
21 Correct 14 ms 26068 KB Output is correct
22 Correct 13 ms 26324 KB Output is correct
23 Correct 15 ms 26384 KB Output is correct
24 Correct 13 ms 26412 KB Output is correct
25 Correct 13 ms 26476 KB Output is correct
26 Correct 13 ms 26520 KB Output is correct
27 Correct 12 ms 26068 KB Output is correct
28 Correct 15 ms 26048 KB Output is correct
29 Correct 12 ms 26324 KB Output is correct
30 Correct 11 ms 26312 KB Output is correct
31 Correct 12 ms 26324 KB Output is correct
32 Correct 12 ms 26324 KB Output is correct
33 Correct 12 ms 26452 KB Output is correct
34 Correct 11 ms 25812 KB Output is correct
35 Correct 11 ms 25812 KB Output is correct
36 Correct 12 ms 25904 KB Output is correct
37 Correct 13 ms 25940 KB Output is correct
38 Correct 15 ms 25940 KB Output is correct
39 Correct 12 ms 26040 KB Output is correct
40 Correct 17 ms 29732 KB Output is correct
41 Correct 16 ms 27860 KB Output is correct
42 Correct 40 ms 47524 KB Output is correct
43 Correct 38 ms 47948 KB Output is correct
44 Correct 42 ms 48368 KB Output is correct
45 Correct 40 ms 48512 KB Output is correct
46 Correct 41 ms 48612 KB Output is correct
47 Correct 25 ms 32060 KB Output is correct
48 Correct 36 ms 39636 KB Output is correct
49 Correct 36 ms 42756 KB Output is correct
50 Correct 35 ms 43060 KB Output is correct
51 Correct 32 ms 38364 KB Output is correct
52 Correct 31 ms 38484 KB Output is correct
53 Correct 38 ms 48680 KB Output is correct

Subtask #5
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25812 KB Output is correct
2 Correct 11 ms 25812 KB Output is correct
3 Correct 12 ms 25812 KB Output is correct
4 Correct 14 ms 25812 KB Output is correct
5 Correct 12 ms 25828 KB Output is correct
6 Correct 11 ms 25840 KB Output is correct
7 Correct 11 ms 25824 KB Output is correct
8 Correct 10 ms 25824 KB Output is correct
9 Correct 11 ms 25940 KB Output is correct
10 Correct 15 ms 25812 KB Output is correct
11 Correct 12 ms 25940 KB Output is correct
12 Correct 12 ms 25944 KB Output is correct
13 Correct 12 ms 26068 KB Output is correct
14 Correct 14 ms 25940 KB Output is correct
15 Correct 12 ms 26068 KB Output is correct
16 Correct 15 ms 26036 KB Output is correct
17 Correct 11 ms 25844 KB Output is correct
18 Correct 11 ms 25892 KB Output is correct
19 Correct 12 ms 25940 KB Output is correct
20 Correct 11 ms 25816 KB Output is correct
21 Correct 14 ms 26068 KB Output is correct
22 Correct 13 ms 26324 KB Output is correct
23 Correct 15 ms 26384 KB Output is correct
24 Correct 13 ms 26412 KB Output is correct
25 Correct 13 ms 26476 KB Output is correct
26 Correct 13 ms 26520 KB Output is correct
27 Correct 12 ms 26068 KB Output is correct
28 Correct 15 ms 26048 KB Output is correct
29 Correct 12 ms 26324 KB Output is correct
30 Correct 11 ms 26312 KB Output is correct
31 Correct 12 ms 26324 KB Output is correct
32 Correct 12 ms 26324 KB Output is correct
33 Correct 12 ms 26452 KB Output is correct
34 Correct 11 ms 25812 KB Output is correct
35 Correct 11 ms 25812 KB Output is correct
36 Correct 12 ms 25904 KB Output is correct
37 Correct 13 ms 25940 KB Output is correct
38 Correct 15 ms 25940 KB Output is correct
39 Correct 12 ms 26040 KB Output is correct
40 Correct 17 ms 29732 KB Output is correct
41 Correct 16 ms 27860 KB Output is correct
42 Correct 40 ms 47524 KB Output is correct
43 Correct 38 ms 47948 KB Output is correct
44 Correct 42 ms 48368 KB Output is correct
45 Correct 40 ms 48512 KB Output is correct
46 Correct 41 ms 48612 KB Output is correct
47 Correct 25 ms 32060 KB Output is correct
48 Correct 36 ms 39636 KB Output is correct
49 Correct 36 ms 42756 KB Output is correct
50 Correct 35 ms 43060 KB Output is correct
51 Correct 32 ms 38364 KB Output is correct
52 Correct 31 ms 38484 KB Output is correct
53 Correct 38 ms 48680 KB Output is correct
54 Correct 143 ms 134632 KB Output is correct
55 Correct 114 ms 55996 KB Output is correct
56 Correct 685 ms 572984 KB Output is correct
57 Correct 659 ms 576588 KB Output is correct
58 Correct 700 ms 579060 KB Output is correct
59 Correct 653 ms 580200 KB Output is correct
60 Correct 714 ms 580944 KB Output is correct
61 Correct 538 ms 266980 KB Output is correct
62 Correct 115 ms 60132 KB Output is correct
63 Correct 597 ms 442800 KB Output is correct
64 Correct 634 ms 447412 KB Output is correct
65 Correct 697 ms 303464 KB Output is correct
66 Correct 683 ms 303360 KB Output is correct
67 Correct 700 ms 580772 KB Output is correct

Subtask #6
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25812 KB Output is correct
2 Correct 11 ms 25812 KB Output is correct
3 Correct 12 ms 25812 KB Output is correct
4 Correct 14 ms 25812 KB Output is correct
5 Correct 12 ms 25828 KB Output is correct
6 Correct 11 ms 25840 KB Output is correct
7 Correct 11 ms 25824 KB Output is correct
8 Correct 10 ms 25824 KB Output is correct
9 Correct 11 ms 25940 KB Output is correct
10 Correct 15 ms 25812 KB Output is correct
11 Correct 12 ms 25908 KB Output is correct
12 Correct 15 ms 25812 KB Output is correct
13 Correct 375 ms 121672 KB Output is correct
14 Correct 419 ms 134208 KB Output is correct
15 Correct 498 ms 153684 KB Output is correct
16 Correct 566 ms 179364 KB Output is correct
17 Correct 739 ms 207476 KB Output is correct
18 Correct 794 ms 207648 KB Output is correct
19 Correct 696 ms 207584 KB Output is correct
20 Correct 11 ms 25812 KB Output is correct
21 Correct 11 ms 25812 KB Output is correct
22 Correct 11 ms 25812 KB Output is correct
23 Correct 12 ms 25904 KB Output is correct
24 Correct 11 ms 25940 KB Output is correct
25 Correct 11 ms 25940 KB Output is correct
26 Correct 13 ms 26052 KB Output is correct
27 Correct 12 ms 25912 KB Output is correct
28 Correct 12 ms 25940 KB Output is correct
29 Correct 12 ms 25944 KB Output is correct
30 Correct 12 ms 26068 KB Output is correct
31 Correct 14 ms 25940 KB Output is correct
32 Correct 12 ms 26068 KB Output is correct
33 Correct 15 ms 26036 KB Output is correct
34 Correct 11 ms 25844 KB Output is correct
35 Correct 11 ms 25892 KB Output is correct
36 Correct 12 ms 25940 KB Output is correct
37 Correct 11 ms 25816 KB Output is correct
38 Correct 14 ms 26068 KB Output is correct
39 Correct 13 ms 26324 KB Output is correct
40 Correct 15 ms 26384 KB Output is correct
41 Correct 13 ms 26412 KB Output is correct
42 Correct 13 ms 26476 KB Output is correct
43 Correct 13 ms 26520 KB Output is correct
44 Correct 12 ms 26068 KB Output is correct
45 Correct 15 ms 26048 KB Output is correct
46 Correct 12 ms 26324 KB Output is correct
47 Correct 11 ms 26312 KB Output is correct
48 Correct 12 ms 26324 KB Output is correct
49 Correct 12 ms 26324 KB Output is correct
50 Correct 12 ms 26452 KB Output is correct
51 Correct 11 ms 25812 KB Output is correct
52 Correct 11 ms 25812 KB Output is correct
53 Correct 12 ms 25904 KB Output is correct
54 Correct 13 ms 25940 KB Output is correct
55 Correct 15 ms 25940 KB Output is correct
56 Correct 12 ms 26040 KB Output is correct
57 Correct 17 ms 29732 KB Output is correct
58 Correct 16 ms 27860 KB Output is correct
59 Correct 40 ms 47524 KB Output is correct
60 Correct 38 ms 47948 KB Output is correct
61 Correct 42 ms 48368 KB Output is correct
62 Correct 40 ms 48512 KB Output is correct
63 Correct 41 ms 48612 KB Output is correct
64 Correct 25 ms 32060 KB Output is correct
65 Correct 36 ms 39636 KB Output is correct
66 Correct 36 ms 42756 KB Output is correct
67 Correct 35 ms 43060 KB Output is correct
68 Correct 32 ms 38364 KB Output is correct
69 Correct 31 ms 38484 KB Output is correct
70 Correct 38 ms 48680 KB Output is correct
71 Correct 143 ms 134632 KB Output is correct
72 Correct 114 ms 55996 KB Output is correct
73 Correct 685 ms 572984 KB Output is correct
74 Correct 659 ms 576588 KB Output is correct
75 Correct 700 ms 579060 KB Output is correct
76 Correct 653 ms 580200 KB Output is correct
77 Correct 714 ms 580944 KB Output is correct
78 Correct 538 ms 266980 KB Output is correct
79 Correct 115 ms 60132 KB Output is correct
80 Correct 597 ms 442800 KB Output is correct
81 Correct 634 ms 447412 KB Output is correct
82 Correct 697 ms 303464 KB Output is correct
83 Correct 683 ms 303360 KB Output is correct
84 Correct 700 ms 580772 KB Output is correct
85 Correct 1807 ms 1396636 KB Output is correct
86 Runtime error 1322 ms 2097152 KB Execution killed with signal 9
87 Halted 0 ms 0 KB -