This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
using namespace std;
const int inf = 1e18;
const int mod = 1e9 + 7;
const int N = 1e5 + 5;
int32_t main(){
ios_base::sync_with_stdio(false), cin.tie();
int n, a, b;
cin>>n>>a>>b;
vector<vector<int> > dp(n+1, vector<int>(n+1, inf));
dp[0][0] = 0;
vector<int> arr(n+1), pre(n+1);
for(int i = 1; i <= n; i++){
cin>>arr[i];
pre[i] = pre[i-1] + arr[i];
}
for(int i = 0; i < n; i++){
for(int j = 0; j <= i; j++){
for(int k = i+1; k <= n; k++){
dp[k][j+1] = min(dp[k][j+1], dp[i][j]|(pre[k] - pre[i]));
}
}
}
int ans = inf;
for(int i = a; i <= b; i++){
ans = min(ans, dp[n][i]);
}
if(ans == inf){
int cnt = 0;
for(int i = 0; i < inf; i++){
cnt++;
}
}
else cout<<ans<<endl;
return 0;
}
| # | 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... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |