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>
using namespace std;
typedef long long ll;
const ll inf=(1e18)+10;
int main(){
ll n, a, b, i, j, h;
cin>>n>>a>>b;
vector<ll> v(n+1, 0);
for(i=1; i<=n; i++){
cin>>v[i];
}
vector<vector<ll>> dp(n+1, vector<ll>(b+1, inf));
vector<ll> pre(n+1, 0);
for(i=1; i<=n; i++){
pre[i]=pre[i-1]+v[i];
}
for(i=1; i<=n; i++){
dp[i][1]=pre[i];
}
for(i=1; i<=n; i++){
for(j=1; j<=b; j++){
for(h=1; h<i; h++){
if(dp[h][j-1]==inf) continue;
dp[i][j]=min(dp[i][j], (dp[h][j-1] | (pre[i]-pre[h])));
}
}
}
ll mn=inf;
for(i=1; i<=b; i++) mn=min(mn, dp[n][i]);
cout<<mn;
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... |