oj.uz

답안 #550745

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
550745 2022-04-19T01:51:35 Z lkh3happy Copy and Paste 3 (JOI22_copypaste3) C++14
6 / 100
 1177 ms 57784 KB 
#include <stdio.h>
#include <algorithm>
#include <map>
#include <queue>
using namespace std;

char S[2501];
long long dp[2501][2501], mod=1e9+7, h[2501], mul=101, nex[2501][2501];

int main(){
    h[0]=1;
    for(int i=1;i<2501;i++) h[i]=h[i-1]*mul%mod;
    int n;
    long long a, b, c;
    scanf("%d%s%lld%lld%lld", &n, S, &a, &b, &c);
    for(int i=0;i<=n;i++) for(int j=i;j<=n;j++) dp[i][j]=(j-i+1)*a+b;
    for(int l=1;l<=n;l++){
        map<long long, long long> m;
        queue<long long> q[2501];
        long long hc=0, cnt=0;
        for(int i=0;i<l;i++) hc=(hc*mul+(S[i]-'a'))%mod;
        m[hc]=++cnt;
        q[cnt].push(0);
        for(int i=l;i<n;i++){
            hc=(hc*mul-h[l]*(S[i-l]-'a')+(S[i]-'a'))%mod;
            if(m.find(hc)==m.end()) m[hc]=++cnt;
            long long x=m[hc];
            while(!q[x].empty() && q[x].front()+l-1<i-l+1) nex[q[x].front()][q[x].front()+l-1]=i-l-q[x].front()+1, q[x].pop();
            q[x].push(i-l+1);
        }
    }
    for(int l=1;l<=n;l++){
        for(int i=0;i<n-l+1;i++){
            int j=i+l-1, k=0, j1=j, cnt=1;
            if(i) dp[i-1][j]=min(dp[i-1][j], dp[i][j]+a);
            if(j+1!=n) dp[i][j+1]=min(dp[i][j+1], dp[i][j]+a);
            while(nex[i+k][j]){
                int x=nex[i+k][j];
                j+=x; k+=x; cnt++;
                dp[i][j]=min(dp[i][j], dp[i][j1]+(j-i+1-l*cnt)*a+b+c*cnt);
            }
        }
    }
    printf("%lld\n", dp[0][n-1]-b);
    return 0;
}

Compilation message

copypaste3.cpp: In function 'int main()':
copypaste3.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     scanf("%d%s%lld%lld%lld", &n, S, &a, &b, &c);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2004 KB Output is correct
2 Correct 2 ms 2004 KB Output is correct
3 Correct 2 ms 2004 KB Output is correct
4 Correct 2 ms 2004 KB Output is correct
5 Correct 2 ms 2004 KB Output is correct
6 Correct 2 ms 2004 KB Output is correct
7 Correct 2 ms 2004 KB Output is correct
8 Correct 2 ms 1916 KB Output is correct
9 Correct 2 ms 2004 KB Output is correct
10 Correct 3 ms 2004 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2004 KB Output is correct
2 Correct 2 ms 2004 KB Output is correct
3 Correct 684 ms 36292 KB Output is correct
4 Correct 758 ms 40840 KB Output is correct
5 Correct 882 ms 45924 KB Output is correct
6 Correct 1048 ms 51656 KB Output is correct
7 Correct 1151 ms 57744 KB Output is correct
8 Correct 1143 ms 57784 KB Output is correct
9 Correct 1177 ms 57744 KB Output is correct
10 Correct 1 ms 2004 KB Output is correct
11 Correct 1 ms 2004 KB Output is correct
12 Correct 2 ms 2004 KB Output is correct
13 Correct 2 ms 2004 KB Output is correct
14 Correct 3 ms 2004 KB Output is correct
15 Correct 3 ms 2004 KB Output is correct
16 Correct 6 ms 2132 KB Output is correct
17 Correct 2 ms 2004 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2004 KB Output is correct
2 Correct 2 ms 2004 KB Output is correct
3 Correct 2 ms 2004 KB Output is correct
4 Correct 2 ms 2004 KB Output is correct
5 Correct 2 ms 2004 KB Output is correct
6 Correct 2 ms 2004 KB Output is correct
7 Correct 2 ms 2004 KB Output is correct
8 Correct 2 ms 1916 KB Output is correct
9 Correct 2 ms 2004 KB Output is correct
10 Correct 3 ms 2004 KB Output is correct
11 Correct 3 ms 2004 KB Output is correct
12 Correct 4 ms 2004 KB Output is correct
13 Correct 4 ms 2132 KB Output is correct
14 Correct 2 ms 2004 KB Output is correct
15 Correct 4 ms 2132 KB Output is correct
16 Correct 4 ms 2004 KB Output is correct
17 Correct 2 ms 2004 KB Output is correct
18 Correct 1 ms 2004 KB Output is correct
19 Correct 5 ms 2004 KB Output is correct
20 Correct 2 ms 2004 KB Output is correct
21 Correct 10 ms 2132 KB Output is correct
22 Correct 10 ms 2132 KB Output is correct
23 Correct 7 ms 2132 KB Output is correct
24 Correct 8 ms 2216 KB Output is correct
25 Correct 8 ms 2132 KB Output is correct
26 Correct 7 ms 2132 KB Output is correct
27 Correct 6 ms 2132 KB Output is correct
28 Incorrect 6 ms 2228 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2004 KB Output is correct
2 Correct 2 ms 2004 KB Output is correct
3 Correct 2 ms 2004 KB Output is correct
4 Correct 2 ms 2004 KB Output is correct
5 Correct 2 ms 2004 KB Output is correct
6 Correct 2 ms 2004 KB Output is correct
7 Correct 2 ms 2004 KB Output is correct
8 Correct 2 ms 1916 KB Output is correct
9 Correct 2 ms 2004 KB Output is correct
10 Correct 3 ms 2004 KB Output is correct
11 Correct 3 ms 2004 KB Output is correct
12 Correct 4 ms 2004 KB Output is correct
13 Correct 4 ms 2132 KB Output is correct
14 Correct 2 ms 2004 KB Output is correct
15 Correct 4 ms 2132 KB Output is correct
16 Correct 4 ms 2004 KB Output is correct
17 Correct 2 ms 2004 KB Output is correct
18 Correct 1 ms 2004 KB Output is correct
19 Correct 5 ms 2004 KB Output is correct
20 Correct 2 ms 2004 KB Output is correct
21 Correct 10 ms 2132 KB Output is correct
22 Correct 10 ms 2132 KB Output is correct
23 Correct 7 ms 2132 KB Output is correct
24 Correct 8 ms 2216 KB Output is correct
25 Correct 8 ms 2132 KB Output is correct
26 Correct 7 ms 2132 KB Output is correct
27 Correct 6 ms 2132 KB Output is correct
28 Incorrect 6 ms 2228 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2004 KB Output is correct
2 Correct 2 ms 2004 KB Output is correct
3 Correct 2 ms 2004 KB Output is correct
4 Correct 2 ms 2004 KB Output is correct
5 Correct 2 ms 2004 KB Output is correct
6 Correct 2 ms 2004 KB Output is correct
7 Correct 2 ms 2004 KB Output is correct
8 Correct 2 ms 1916 KB Output is correct
9 Correct 2 ms 2004 KB Output is correct
10 Correct 3 ms 2004 KB Output is correct
11 Correct 3 ms 2004 KB Output is correct
12 Correct 4 ms 2004 KB Output is correct
13 Correct 4 ms 2132 KB Output is correct
14 Correct 2 ms 2004 KB Output is correct
15 Correct 4 ms 2132 KB Output is correct
16 Correct 4 ms 2004 KB Output is correct
17 Correct 2 ms 2004 KB Output is correct
18 Correct 1 ms 2004 KB Output is correct
19 Correct 5 ms 2004 KB Output is correct
20 Correct 2 ms 2004 KB Output is correct
21 Correct 10 ms 2132 KB Output is correct
22 Correct 10 ms 2132 KB Output is correct
23 Correct 7 ms 2132 KB Output is correct
24 Correct 8 ms 2216 KB Output is correct
25 Correct 8 ms 2132 KB Output is correct
26 Correct 7 ms 2132 KB Output is correct
27 Correct 6 ms 2132 KB Output is correct
28 Incorrect 6 ms 2228 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2004 KB Output is correct
2 Correct 2 ms 2004 KB Output is correct
3 Correct 2 ms 2004 KB Output is correct
4 Correct 2 ms 2004 KB Output is correct
5 Correct 2 ms 2004 KB Output is correct
6 Correct 2 ms 2004 KB Output is correct
7 Correct 2 ms 2004 KB Output is correct
8 Correct 2 ms 1916 KB Output is correct
9 Correct 2 ms 2004 KB Output is correct
10 Correct 3 ms 2004 KB Output is correct
11 Correct 5 ms 2004 KB Output is correct
12 Correct 2 ms 2004 KB Output is correct
13 Correct 684 ms 36292 KB Output is correct
14 Correct 758 ms 40840 KB Output is correct
15 Correct 882 ms 45924 KB Output is correct
16 Correct 1048 ms 51656 KB Output is correct
17 Correct 1151 ms 57744 KB Output is correct
18 Correct 1143 ms 57784 KB Output is correct
19 Correct 1177 ms 57744 KB Output is correct
20 Correct 1 ms 2004 KB Output is correct
21 Correct 1 ms 2004 KB Output is correct
22 Correct 2 ms 2004 KB Output is correct
23 Correct 2 ms 2004 KB Output is correct
24 Correct 3 ms 2004 KB Output is correct
25 Correct 3 ms 2004 KB Output is correct
26 Correct 6 ms 2132 KB Output is correct
27 Correct 2 ms 2004 KB Output is correct
28 Correct 3 ms 2004 KB Output is correct
29 Correct 4 ms 2004 KB Output is correct
30 Correct 4 ms 2132 KB Output is correct
31 Correct 2 ms 2004 KB Output is correct
32 Correct 4 ms 2132 KB Output is correct
33 Correct 4 ms 2004 KB Output is correct
34 Correct 2 ms 2004 KB Output is correct
35 Correct 1 ms 2004 KB Output is correct
36 Correct 5 ms 2004 KB Output is correct
37 Correct 2 ms 2004 KB Output is correct
38 Correct 10 ms 2132 KB Output is correct
39 Correct 10 ms 2132 KB Output is correct
40 Correct 7 ms 2132 KB Output is correct
41 Correct 8 ms 2216 KB Output is correct
42 Correct 8 ms 2132 KB Output is correct
43 Correct 7 ms 2132 KB Output is correct
44 Correct 6 ms 2132 KB Output is correct
45 Incorrect 6 ms 2228 KB Output isn't correct
46 Halted 0 ms 0 KB -