Submission #1144188

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1144188	2025-02-02 19:45:50	aguss	Holiday (IOI14_holiday)	C++20	0 / 100	5094 ms	9280 KiB

holiday

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include"holiday.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
vector<ll> arr;
ll ans = 0;
void backtrackingoesoquedicelachavizadehoyendiayaestoyviejolptm(int curr, int d, ll sum, vector<bool>& vis){
    if(d == 0){
        ans = max(ans, sum);
        return;
    }
    if(!vis[curr]){
        vis[curr] = 1;
        backtrackingoesoquedicelachavizadehoyendiayaestoyviejolptm(curr, d - 1, sum + arr[curr], vis);
        vis[curr] = 0;
    }
    if(curr > 0){
        backtrackingoesoquedicelachavizadehoyendiayaestoyviejolptm(curr - 1, d - 1, sum, vis);
    }
    if(curr < n - 1){
        backtrackingoesoquedicelachavizadehoyendiayaestoyviejolptm(curr + 1, d - 1, sum, vis);
    }
}
long long int findMaxAttraction(int N, int start, int d, int attraction[]) {
    n = N;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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