# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
274231 | 2020-08-19T10:11:36 Z | Halit | Candies (JOI18_candies) | C++17 | 105 ms | 32248 KB |
#include <bits/stdc++.h> using namespace std; int main(){ int n; scanf("%d", &n); vector<long long> v; for(int i = 0;i < n;++i){ long long c; scanf("%lld", &c); v.push_back(c); } vector< vector<long long> > dp(n+5, vector<long long>(n+5,-1)); function<long long(int, int)> DP = [&](int i, int j) -> long long{ if(i >= n || j <= 0) return (j > 0 ? -2 : 0); if(dp[i][j] != -1) return dp[i][j]; long long d = DP(i+1,j); if(j > 0) d = max(DP(i+2, j-1) + v[i], d); return dp[i][j] = d; }; for(int i = 1;i <= (n+1)/2;++i) printf("%lld\n", DP(0,i)); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 105 ms | 32248 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 105 ms | 32248 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |