Submission #429999

#	Time	Username	Problem	Language	Result	Execution time	Memory
429999		Rouge_Hugo	Holiday (IOI14_holiday)	C++14	0 / 100	18 ms	2068 KiB

holiday

#include<bits/stdc++.h>
#include"holiday.h"
#define ll long long
#define fi first
#define se second
#define pb push_back
using namespace std;
const int M=30;
ll INF=-1e9;
ll dp[M][M][2],a[M];
int n,s;
ll d(int x,int y,int z)
{
    if(y<0)return INF;
    if(x==-1||x==n)return 0;
    if(y==0)return 0;
    ll &u=dp[x][y][z];
    if(u!=-1)return u;
    u=a[x];
    if(z==0)
    {
        u=d(x-1,y-2,z)+a[x];
        u=max(d(x-1,y-1,z),u);
        u=max(u,d(s+1,y-(s-x),1));
        u=max(u,d(s+1,y-(s-x)-1,1)+a[x]);
        return u;
    }
    u=d(x+1,y-1,z);
    u=max(u,d(x+1,y-2,z)+a[x]);
    return u;
}
ll d1(int x,int y,int z)
{
    if(y<0)return INF;
    if(x==-1||x==n)return 0;
    if(y==0)return 0;
    ll &u=dp[x][y][z];
    if(u!=-1)return u;
    if(z==0)
    {
        u=d1(x+1,y-2,z)+a[x];
        u=max(d1(x+1,y-1,z),u);
        u=max(u,d1(s-1,y-abs(s-x),1));
        u=max(u,d1(s-1,y-abs(s-x)-1,1)+a[x]);
        return u;
    }
    u=d1(x-1,y-1,z);
    u=max(u,d1(x-1,y-2,z)+a[x]);
    return u;
}
long long  findMaxAttraction(int N, int start, int D, int A[])
{
    for(int i=0;i<10;i++)
    {
        for(int j=0;j<10;j++)
        {
            dp[i][j][0]=-1;
            dp[i][j][1]=-1;
        }
    }
    s=start;
    n=N;
    for(int i=0;i<n;i++)
    {
        a[i]=A[i];
    }
    ll u= d(start,D,0);
    //memset(dp,-1,sizeof dp);
    for(int i=0;i<10;i++)
    {
        for(int j=0;j<10;j++)
        {
            dp[i][j][0]=-1;
            dp[i][j][1]=-1;
        }
    }
    u=max(u,d1(start,D,0));
    return u;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 23
• Subtask 3: 0 / 17
• Subtask 4: 0 / 53