oj.uz

Submission #680197

# Submission time Handle Problem Language Result Execution time Memory
680197 2023-01-10T07:48:56 Z fdnfksd Visiting Singapore (NOI20_visitingsingapore) C++14
23 / 100
 241 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=int;
const ll maxN=5005;
const ll inf=1e9;
ll mn2[5005][5005],mn1[5005][5005];
ll k,n,m,a,b,s[maxN],v[maxN],t[maxN];
ll dp[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);
    dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
    dp[i][j]=max(dp[i][j],val);
}
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];
    dp[0][0]=mn1[0][0]=mn2[0][0]=-inf;
    for(int i=1;i<=n;i++)
    {
        dp[i][0]=dp[0][i]=mn1[i][0]=mn1[0][i]=mn2[0][i]=mn2[i][0]=-inf;
    }
    ll ans=-inf;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(s[i]==t[j])
            {
                if(i<=1||j<=1) dp[i][j]=-inf;
                dp[i][j]=max(dp[i][j],v[s[i]]+(a*(j>1)+b*(j-1)));
                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]]);
                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>=2&&j>=2)
                {
                    x=dp[i-2][j-2];
                    dp[i][j]=max(dp[i][j],x+i*b+j*b-2*b+2*a+v[s[i]]);
                }
            }
            else
            {
                dp[i][j]=-inf;
            }
            dp[i+1][j+1]=dp[i][j]+v[s[i+1]];
            ans=max(ans,dp[i][j]+(a*(m>j)+b*(m-j)));
            update(i,j,dp[i][j]-b*i-b*j);
        }
    }
    cout << max(ans,a+b*m);
}
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 3156 KB Output is correct
2 Correct 21 ms 21688 KB Output is correct
3 Correct 2 ms 3284 KB Output is correct
4 Correct 5 ms 11092 KB Output is correct
5 Correct 2 ms 4720 KB Output is correct
6 Correct 10 ms 12372 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 5 ms 6484 KB Output is correct
9 Correct 13 ms 15316 KB Output is correct
10 Correct 28 ms 24148 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 6 ms 6656 KB Output is correct
4 Correct 1 ms 1316 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 12 ms 13200 KB Output is correct
7 Correct 12 ms 12060 KB Output is correct
8 Correct 17 ms 18216 KB Output is correct
9 Correct 3 ms 3924 KB Output is correct
10 Correct 25 ms 24188 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 60724 KB Output is correct
2 Correct 27 ms 42332 KB Output is correct
3 Correct 121 ms 142600 KB Output is correct
4 Runtime error 241 ms 262144 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 60724 KB Output is correct
2 Correct 27 ms 42332 KB Output is correct
3 Correct 121 ms 142600 KB Output is correct
4 Runtime error 241 ms 262144 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 60724 KB Output is correct
2 Correct 27 ms 42332 KB Output is correct
3 Correct 121 ms 142600 KB Output is correct
4 Runtime error 241 ms 262144 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 1236 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1620 KB Output is correct
11 Correct 1 ms 1672 KB Output is correct
12 Correct 1 ms 1620 KB Output is correct
13 Correct 1 ms 1620 KB Output is correct
14 Correct 1 ms 1620 KB Output is correct
15 Correct 1 ms 1632 KB Output is correct

Subtask #7
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3156 KB Output is correct
2 Correct 21 ms 21688 KB Output is correct
3 Correct 2 ms 3284 KB Output is correct
4 Correct 5 ms 11092 KB Output is correct
5 Correct 2 ms 4720 KB Output is correct
6 Correct 10 ms 12372 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 5 ms 6484 KB Output is correct
9 Correct 13 ms 15316 KB Output is correct
10 Correct 28 ms 24148 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 6 ms 6656 KB Output is correct
14 Correct 1 ms 1316 KB Output is correct
15 Correct 2 ms 3028 KB Output is correct
16 Correct 12 ms 13200 KB Output is correct
17 Correct 12 ms 12060 KB Output is correct
18 Correct 17 ms 18216 KB Output is correct
19 Correct 3 ms 3924 KB Output is correct
20 Correct 25 ms 24188 KB Output is correct
21 Correct 40 ms 60724 KB Output is correct
22 Correct 27 ms 42332 KB Output is correct
23 Correct 121 ms 142600 KB Output is correct
24 Runtime error 241 ms 262144 KB Execution killed with signal 9
25 Halted 0 ms 0 KB -