Submission #400624

#TimeUsernameProblemLanguageResultExecution timeMemory
400624BERNARB01Bali Sculptures (APIO15_sculpture)C++17
21 / 100
8 ms8988 KiB
#include <bits/stdc++.h> using namespace std; const int N = (int) 103; const long long inf = (long long) 4e18; int n, a, b, y[N]; long long dp[N][N][N]; long long sol(int i, int j, int stage, long long sum = 0) { if (i == n) { if (a <= stage && stage <= b) { return sum; } return inf; } long long& ret = dp[i][j][stage]; if (ret != -1) { return ret; } sum += y[i]; ret = sol(i + 1, j, stage, sum); if (stage + 1 <= b && i + 1 < n) { ret = min(ret, sum | sol(i + 1, i + 1, stage + 1)); } return ret; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> a >> b; for (int i = 0; i < n; i++) { cin >> y[i]; } memset(dp, -1, sizeof dp); cout << sol(0, 0, 1) << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...