제출 #469671

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
469671		MohamedFaresNebili	휴가 (IOI14_holiday)	C++14	0 / 100	5058 ms	21196 KiB

holiday

#include <bits/stdc++.h>
#include"holiday.h"
 
using namespace std;
 
using ll  = long long;
using ld  = long double;
 
#define pb push_back
#define pp pop_back
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define all(x) (x).begin() , (x).end()
 
const ll MOD = 998244353;
const long double EPS = 0.000000001;
const double PI = 3.14159265358979323846;
const int nx[8] = { 2, 1, -1, -2, -2, -1, 1, 2 };
const int ny[8] = { 1, 2, 2, 1, -1, -2, -2, -1 };
 
bool vis[100005];
long long int solve(int i, int d, int n, int arr[]) {
    if(d==0) return 0;
    long long best;
    if(i==0) {
        if(vis[i]) best=solve(i+1, d-1, n, arr);
        else {
            ll a=solve(i+1, d-1, n, arr);
            vis[i]=1; ll b=arr[i]+solve(i, d-1, n, arr); vis[i]=0;
            best=max(a, b);
        }
        return best;
    }
    if(i==n-1) {
        if(vis[i]) best=solve(i-1, d-1, n, arr);
        else {
            ll a=solve(i-1, d-1, n, arr);
            vis[i]=1; ll b=arr[i]+solve(i, d-1, n, arr); vis[i]=0;
            best=max(a, b);
        }
        return best;
    }
    if(vis[i]) best=max(solve(i-1, d-1, n, arr), solve(i+1, d-1, n, arr));
    else {
        ll a=max(solve(i+1, d-1, n, arr), solve(i-1, d-1, n, arr));
        vis[i]=1; ll b=arr[i]+solve(i, d-1, n, arr); vis[i]=0;
        best=max(a, b);
    }
    return best;
}
long long int findMaxAttraction(int n, int start, int d, int arr[]) {
    memset(vis, false, sizeof vis);
    return solve(start, d, n, arr);
}

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