제출 #1192266

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1192266		lucaskojima	Bali Sculptures (APIO15_sculpture)	C++17	21 / 100	10 ms	1096 KiB

sculpture

#include "bits/stdc++.h"
#define sz(x) (int)size(x)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)

using namespace std;
using ll = long long;
using pii = pair<int, int>;

const char nl = '\n';
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;

void chmin(int &a, int b) { if (b < a) a = b; }

int32_t main() {
  ios::sync_with_stdio(0), cin.tie(0);

  int n, a, b; cin >> n >> a >> b;
  vector<int> y(n); for (auto &x : y) cin >> x;

  vector<int> p(n); p[0] = y[0];
  for (int i = 1; i < n; i++)
    p[i] = p[i - 1] + y[i];

  int c = *max_element(all(y)) * n;
  vector dp(n, vector<int>(c + 1, INF));

  for (int i = 0; i < n; i++)
    dp[i][p[i]] = 1;

  for (int i = 0; i < n; i++)
    for (int v = 0; v <= c; v++)
      for (int j = i + 1; j < n; j++)
        chmin(dp[j][v | (p[j] - p[i])], dp[i][v] + 1);

  int ans = INF;
  for (int v = 0; v <= c; v++)
    if (dp[n - 1][v] <= b)
      ans = min(ans, v);

  cout << ans << nl;
  return 0;
}

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