Submission #882850

#TimeUsernameProblemLanguageResultExecution timeMemory
882850OAleksaBali Sculptures (APIO15_sculpture)C++14
0 / 100
1 ms348 KiB
#include<bits/stdc++.h> using namespace std; #define f first #define s second #define int long long const int maxn = 110; const int inf = 1e15; int dp[maxn][maxn], a[maxn], l, r, n; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int tt = 1; //cin >> tt; while (tt--) { cin >> n >> l >> r; for (int i = 1;i <= n;i++) cin >> a[i]; for (int i = 0;i <= n;i++) { for (int j = 0;j <= n;j++) dp[i][j] = inf; } dp[0][0] = 0; for (int i = 1;i <= n;i++) { for (int j = 1;j <= n;j++) { int sm = a[j]; for (int k = j - 1;k >= 0;k--) { dp[i][j] = min(dp[i][j], (dp[i - 1][k] | sm)); sm += a[k]; } } } int ans = inf; for (int i = l;i <= r;i++) ans = min(ans, dp[i][n]); cout << ans; } 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...