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;
int main()
{
  int n, a, b;
  cin >> n >> a >> b;
  vector<int> v(n);
  for(int i = 0; i < n; i ++)
    cin >> v[i];
  ll dp[1 + n][1 + b];
  for(int i = 0; i <= n; i ++)
    for(int j = 0; j <= b; j ++)
      dp[i][j] = inf;
  dp[0][0] = 0;
  for(int i = 1; i <= n; i ++)
    for(int j = 1; j <= i && j <= b; j++)
      {
	ll sm = 0; 
	for(int k = i; k >= j; k--)
	  {
	    sm += v[k - 1];
	    dp[i][j] = min(dp[i][j], dp[k - 1][j - 1] | sm);
	  }
      }
  cout << dp[n][b] << 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... |