Submission #680182

#	Time	Username	Problem	Language	Result	Execution time	Memory
680182		fdnfksd	Visiting Singapore (NOI20_visitingsingapore)	C++17	10 / 100	140 ms	262144 KiB

VisitingSingapore

#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 / 4
• Subtask 2: 6 / 6
• Subtask 3: 0 / 12
• Subtask 4: 0 / 7
• Subtask 5: 0 / 8
• Subtask 6: 0 / 13
• Subtask 7: 0 / 50