oj.uz

Submission #680182

# Submission time Handle Problem Language Result Execution time Memory
680182 2023-01-10T07:19:59 Z fdnfksd Visiting Singapore (NOI20_visitingsingapore) C++17
10 / 100
 140 ms 262144 KB 
#include<bits/stdc++.h>
#define TASKNAME "codeforce"
#define pb push_back
#define pli pair<int,int>
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxN=2e5;
const ll inf=1e18;
const ll mod=1e9+7;
ll mn[5005][5005],mn2[5005][5005],mn1[5005][5005];
void update(ll i,ll j,ll val)
{
    mn1[i][j]=max(mn1[i][j-1],val);
    mn2[i][j]=max(mn2[i-1][j],val);
    mn[i][j]=max({mn[i-1][j],mn[i][j-1],val});
}
ll k,n,m,a,b,s[maxN],v[maxN],t[maxN],dp[5005][5005];
void solve()
{
    cin >> k >> n >> m >> a >> b;
    for(int i=1;i<=k;i++) cin >> v[i];
    for(int i=1;i<=n;i++) cin >> s[i];
    for(int i=1;i<=m;i++) cin >> t[i];
    mn[0][0]=mn1[0][0]=mn2[0][0]=-inf;
    for(int i=1;i<=n;i++)
    {
        mn[i][0]=mn[0][i]=mn1[i][0]=mn1[0][i]=mn2[0][i]=mn2[i][0]=-inf;
    }
    dp[0][0]=0;
    ll ans=-inf;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(s[i]==t[j])
            {
                dp[i][j]=v[s[i]]+(a*(j>1)+b*(j-1));
                //if(i==1&&j==3) cout << dp[i][j]<<'\n';
                ll x;
                x=mn1[i-1][j-1];
                dp[i][j]=max(dp[i][j],x+i*b+j*b-2*b+a+v[s[i]]);
                //if(i==1&&j==3) cout << dp[i][j]<<'\n';
                x=mn2[i-1][j-1];
                dp[i][j]=max(dp[i][j],x+i*b+j*b-2*b+a+v[s[i]]);
                //if(i==1&&j==3) cout << dp[i][j]<<'\n';
                if(i>=2&&j>=2)
                {
                    x=mn[i-2][j-2];
                    dp[i][j]=max(dp[i][j],x+i*b+j*b-2*b+2*a+v[s[i]]);
                }
                if(i>1&&j>1) dp[i][j]=max(dp[i][j],dp[i-1][j-1]+v[s[i]]);
                //if(i==1&&j==3) cout << dp[i][j]<<'\n';
            }
            else
            {
                dp[i][j]=-inf;
            }
            update(i,j,dp[i][j]-b*i-b*j);
            ans=max(ans,dp[i][j]+(a*(m>j)+b*(m-j)));
        }
    }
    cout << ans;
}
int main()
{
    fastio
    //freopen(TASKNAME".INP","r",stdin);
    //freopen(TASKNAME".OUT","w",stdout);
    solve();
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4292 KB Output is correct
2 Correct 26 ms 42264 KB Output is correct
3 Correct 3 ms 4564 KB Output is correct
4 Correct 6 ms 14932 KB Output is correct
5 Correct 3 ms 6356 KB Output is correct
6 Correct 11 ms 20184 KB Output is correct
7 Correct 2 ms 3668 KB Output is correct
8 Correct 5 ms 9812 KB Output is correct
9 Correct 17 ms 27740 KB Output is correct
10 Correct 30 ms 47824 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 8 ms 12372 KB Output is correct
4 Correct 1 ms 1864 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 16 ms 25036 KB Output is correct
7 Correct 15 ms 23508 KB Output is correct
8 Correct 24 ms 35112 KB Output is correct
9 Correct 4 ms 6216 KB Output is correct
10 Correct 30 ms 47808 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 119004 KB Output is correct
2 Correct 33 ms 71704 KB Output is correct
3 Runtime error 140 ms 262144 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 119004 KB Output is correct
2 Correct 33 ms 71704 KB Output is correct
3 Runtime error 140 ms 262144 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 119004 KB Output is correct
2 Correct 33 ms 71704 KB Output is correct
3 Runtime error 140 ms 262144 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1364 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 1 ms 852 KB Output is correct
6 Correct 2 ms 1732 KB Output is correct
7 Correct 2 ms 1108 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 1 ms 1476 KB Output is correct
10 Correct 1 ms 2260 KB Output is correct
11 Correct 1 ms 2244 KB Output is correct
12 Correct 1 ms 2248 KB Output is correct
13 Incorrect 1 ms 2132 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #7
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4292 KB Output is correct
2 Correct 26 ms 42264 KB Output is correct
3 Correct 3 ms 4564 KB Output is correct
4 Correct 6 ms 14932 KB Output is correct
5 Correct 3 ms 6356 KB Output is correct
6 Correct 11 ms 20184 KB Output is correct
7 Correct 2 ms 3668 KB Output is correct
8 Correct 5 ms 9812 KB Output is correct
9 Correct 17 ms 27740 KB Output is correct
10 Correct 30 ms 47824 KB Output is correct
11 Correct 1 ms 852 KB Output is correct
12 Correct 1 ms 584 KB Output is correct
13 Correct 8 ms 12372 KB Output is correct
14 Correct 1 ms 1864 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 16 ms 25036 KB Output is correct
17 Correct 15 ms 23508 KB Output is correct
18 Correct 24 ms 35112 KB Output is correct
19 Correct 4 ms 6216 KB Output is correct
20 Correct 30 ms 47808 KB Output is correct
21 Correct 68 ms 119004 KB Output is correct
22 Correct 33 ms 71704 KB Output is correct
23 Runtime error 140 ms 262144 KB Execution killed with signal 9
24 Halted 0 ms 0 KB -