Submission #1192605

#	Time	Username	Problem	Language	Result	Execution time	Memory
1192605		lopkus	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	1096 ms	328 KiB

triusis

#include <bits/stdc++.h>

#define int int64_t

void solve() {
  int n, d;
  std::cin >> n >> d;
  std::vector<int> a(n);
  for(int i = 0; i < n; i++) {
    std::cin >> a[i];
  }
  int ans = n;
  for(int mask = 0; mask < (1LL << n); mask++) {
    int can = 1;
    std::vector<int> b = a;
    for(int i = 1; i < n; i++) {
      if(mask & (1LL << i)) {
        b[i] = (i == 0 ? d : b[i - 1] + d);
      }
    }
    int c = 0;
    for(int i = 0; i < n; i++) {
      can &= (b[i] - c <= d);
      c = b[i];
    }
    if(can) {
      ans = std::min(ans, (int64_t)__builtin_popcount(mask));
    }
  }
  std::cout << ans;
}

signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int t = 1;
  //std::cin >> t;
  while (t--) {
      solve();
  }

  return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37