Submission #1305319

#TimeUsernameProblemLanguageResultExecution timeMemory
1305319snasibov05Bali Sculptures (APIO15_sculpture)C++20
0 / 100
1 ms576 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define oo 1000000000000000000ll signed main() { int n, a, b; cin >> n >> a >> b; vector<int> y(n+1); for (int i = 1; i <= n; ++i) cin >> y[i]; vector<vector<int>> dp(n+1, vector<int>(b+1, oo)); dp[0][0] = 0; for (int i = 1; i <= n; ++i){ for (int j = 1; j <= min(i, b); ++j){ int sm = 0; for (int prev = i-1; prev >= 0; --prev){ sm += y[prev + 1]; dp[i][j] = min(dp[i][j], dp[prev][j-1] | sm); } } } int ans = oo; for (int j = a; j <= b; ++j) ans = min(ans, dp[n][j]); cout << ans << "\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...