# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1144214 | aguss | Holiday (IOI14_holiday) | C++20 | 5092 ms | 6216 KiB |
#include"holiday.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) x.begin(), x.end()
#define dbg(x) cerr << #x << ": " << x << '\n';
vector<ll> arr;
vector<vector<ll>> dp;
int n;
ll ans = 0;
ll s;
void derecha(int d, int curr, ll sum){
if(d <= 0 or curr >= n){
ans = max(ans, sum);
return;
}
derecha(d - 1, curr + 1, sum);
derecha(d - 2, curr + 1, sum + arr[curr]);
}
void izquierda(int d, int curr, ll sum){
if(d <= 0 or curr < 0){
ans = max(ans, sum);
return;
}
izquierda(d - 1, curr - 1, sum);
izquierda(d - 2, curr - 1, sum + arr[curr]);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |