제출 #1192248

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1192248		julia_08	Bali Sculptures (APIO15_sculpture)	C++20	71 / 100	27 ms	484 KiB

sculpture

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int MAXN = 110;

int y[MAXN], dp[MAXN][MAXN];

ll s[MAXN];

int main(){
  cin.tie(0)->sync_with_stdio(0);

  int n, a, b; cin >> n >> a >> b;

  for(int i=1; i<=n; i++){
    cin >> y[i];
    s[i] = s[i - 1] + y[i];
  }

  ll ans = 0, bits = 0;

  for(int bit=40; bit>=0; bit--){

    bits += (1LL << bit);

    for(int k=0; k<=n; k++){
      for(int i=0; i<=n; i++){
        dp[k][i] = 1;
      }
    }

    dp[0][0] = 0;

    for(int k=1; k<=n; k++){
      for(int i=1; i<=n; i++){
        for(int j=0; j<i; j++){

          ll sum = s[i] - s[j];

          if((sum & bits) != 0) continue;
          dp[k][i] &= dp[k - 1][j];

        }
      }
    }

    bits -= (1LL << bit);

    bool ok = false;
    for(int k=a; k<=b; k++) if(!dp[k][n]) ok = true;

    if(ok){
      bits += (1LL << bit);

    } else ans += (1LL << bit);

  }

  cout << ans << "\n";

  return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 21 / 21
• Subtask 4: 25 / 25
• Subtask 5: 0 / 29