Submission #1142871

#	Time	Username	Problem	Language	Result	Execution time	Memory
1142871		simplemind_31	Holiday (IOI14_holiday)	C++20	0 / 100	71 ms	131072 KiB

holiday

#include"holiday.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> ATRA;
vector<vector<ll>> dp;
ll maxi=0,N;
ll solve(ll dia, ll posicion){
    if(dia<=0 || posicion<0 || posicion>=N){
        return 0;
    }
    if(dp[dia][posicion]!=0){
        return dp[dia][posicion];
    }
    ll op1=ATRA[posicion]+solve(dia-2,posicion-1);
    ll op2=solve(dia-1,posicion-1);
    ll op3=ATRA[posicion]+solve(dia-2,posicion+1);
    return dp[dia][posicion]=max(op1,max(op2,op3));
}
ll findMaxAttraction(int n,int start,int d,int attraction[]) {
    N=n;
    ATRA.resize(n);
    for(ll i=0;i<n;i++){
        ATRA[i]=attraction[i];
    }
    for(ll i=0;i<n;i++){
        dp.clear();
        dp.assign(d+5,vector<ll>(n+5,0));
        maxi=max(maxi,solve(d-abs(start-i),i));
    }
    return maxi;
}

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