Submission #1327566

#TimeUsernameProblemLanguageResultExecution timeMemory
1327566JohanBali Sculptures (APIO15_sculpture)C++20
0 / 100
1 ms332 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e2 + 5;
const int INF = 1e18;
int a[N], dp[N][N];
signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, l, r;
  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 k = 1; k <= r; k++){
    for(int i = 1; i <= n; i++){
      int sum = 0;
      for(int j = i; j >= 1; j--){
        sum += a[j];
        dp[i][k] = min(dp[i][k], (int)(dp[j - 1][k - 1] | sum)); 
      }
    }
  }
  int mn = INF;
  for(int i = l; i <= r; i++)
    mn = min(mn, dp[n][i]);
  cout << mn << "\n";
}
/*
6 1 3
8 1 2 1 5 4
*/
#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...