oj.uz

Submission #224610

# Submission time Handle Problem Language Result Execution time Memory
224610 2020-04-18T13:51:11 Z nabilervatra Visiting Singapore (NOI20_visitingsingapore) C++14
23 / 100
 109 ms 736 KB 
#include <bits/stdc++.h>
using namespace std;
long long k,n,m,a,b,dp[5010][3][3],tab[5010][3][3],ans,arr[1010],s[5010],t[5010];

int main(){
    cin>>k>>n>>m>>a>>b;
    
    for(long long i =1;i<=k;i++){
        cin>>arr[i];
    }
    for(long long i =1;i<=n;i++){
        cin>>s[i];
    }
    for(long long i =1;i<=m;i++){
        cin>>t[i];
    }
    ans = -1e9;
    for(int j =0;j<=m;j++){
        tab[j][0][1]=-1e9;
        tab[j][0][0]=-1e9;
        tab[j][1][0]=-1e9;
        tab[j][1][1]=-1e9;
    }
    for(int i =1;i<=n;i++){
        for(int j =0;j<=m;j++){
            dp[j][0][1]=-1e9;
            dp[j][0][0]=-1e9;
            dp[j][1][0]=-1e9;
            dp[j][1][1]=-1e9;
        }
        tab[0][0][0]=0;
        dp[0][0][0]=0;
        for(int j =1;j<=m;j++){
            if(s[i]==t[j]){
                if(j==1)dp[j][0][0]=arr[t[j]];
                else dp[j][0][0]=max(max(tab[j-1][0][0],tab[j-1][1][0]),max(tab[j-1][0][1],tab[j-1][1][1]))+arr[s[i]];
                // dp[j][0][0] = max(dp[j][0][0],max(max(dp[j-1][0][0],dp[j-1][1][0]),max(dp[j-1][0][1],dp[j-1][1][1]))+arr[s[i]]);
            }
            // if(j==1){
            //     dp[j]
            //     continue;
            // }
            dp[j][1][0]= max(a+b+tab[j][0][0],b+tab[j][1][0]);
            dp[j][0][1]= max(a+b+dp[j-1][0][0],b+dp [j-1][0][1]);
            dp[j][1][1]= max(max(tab[j][0][1]+a+b,dp[j-1][1][0]+a+b),max(tab[j][1][1]+b,dp[j-1][1][1]+b));
        }
        // cout<<dp[m][0][0]<<endl;
        ans = max(ans,max(max(dp[m][0][0],dp[m][1][0]),max(dp[m][0][1],dp[m][1][1])));
        for(int j=0;j<=m;j++){
            tab[j][0][0]=dp[j][0][0];
            tab[j][1][0]=dp[j][1][0];
            tab[j][0][1]=dp[j][0][1];
            tab[j][1][1]=dp[j][1][1];
        }

    }
    cout<<ans<<endl;
    
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 13 ms 512 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 7 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 10 ms 384 KB Output is correct
10 Correct 16 ms 512 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 8 ms 512 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 9 ms 512 KB Output is correct
7 Correct 10 ms 512 KB Output is correct
8 Correct 12 ms 512 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 16 ms 640 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 512 KB Output is correct
2 Correct 16 ms 384 KB Output is correct
3 Incorrect 109 ms 736 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 512 KB Output is correct
2 Correct 16 ms 384 KB Output is correct
3 Incorrect 109 ms 736 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 512 KB Output is correct
2 Correct 16 ms 384 KB Output is correct
3 Incorrect 109 ms 736 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct

Subtask #7
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 13 ms 512 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 7 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 10 ms 384 KB Output is correct
10 Correct 16 ms 512 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 8 ms 512 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 9 ms 512 KB Output is correct
17 Correct 10 ms 512 KB Output is correct
18 Correct 12 ms 512 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 16 ms 640 KB Output is correct
21 Correct 33 ms 512 KB Output is correct
22 Correct 16 ms 384 KB Output is correct
23 Incorrect 109 ms 736 KB Output isn't correct
24 Halted 0 ms 0 KB -