#548186 (C++17) No.1219 Mancala Combo

• 問題: No.1219 Mancala Combo
• ユーザー: jell
• 提出日時: 2020-09-04 23:58:26
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 22 ms / 2,000 ms
• コード長: 9,651 bytes
• コンパイル時間: 3,542 ms
• コンパイル使用メモリ: 258,396 KB
• 実行使用メモリ: 4,384 KB
• 最終ジャッジ日時: 2023-08-17 20:57:07
• 合計ジャッジ時間: 4,687 ms
• ジャッジサーバーID （参考情報）: judge14 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,384 KB
testcase_01	AC	2 ms; 4,376 KB
testcase_02	AC	1 ms; 4,376 KB
testcase_03	AC	2 ms; 4,380 KB
testcase_04	AC	1 ms; 4,380 KB
testcase_05	AC	1 ms; 4,376 KB
testcase_06	AC	2 ms; 4,384 KB
testcase_07	AC	2 ms; 4,376 KB
testcase_08	AC	1 ms; 4,380 KB
testcase_09	AC	2 ms; 4,376 KB
testcase_10	AC	1 ms; 4,380 KB
testcase_11	AC	2 ms; 4,380 KB
testcase_12	AC	1 ms; 4,380 KB
testcase_13	AC	1 ms; 4,380 KB
testcase_14	AC	1 ms; 4,380 KB
testcase_15	AC	1 ms; 4,380 KB
testcase_16	AC	2 ms; 4,380 KB
testcase_17	AC	13 ms; 4,380 KB
testcase_18	AC	16 ms; 4,380 KB
testcase_19	AC	12 ms; 4,380 KB
testcase_20	AC	16 ms; 4,376 KB
testcase_21	AC	10 ms; 4,376 KB
testcase_22	AC	15 ms; 4,380 KB
testcase_23	AC	15 ms; 4,376 KB
testcase_24	AC	12 ms; 4,376 KB
testcase_25	AC	11 ms; 4,380 KB
testcase_26	AC	16 ms; 4,376 KB
testcase_27	AC	18 ms; 4,380 KB
testcase_28	AC	22 ms; 4,380 KB

ソースコード

#line 1 "yu.cpp"
#line 1 "yu.cpp"
#include <bits/extc++.h>

#line 5 "Library\\config.hpp"
namespace config {
const auto start_time{std::chrono::system_clock::now()};
int64_t elapsed() {
  using namespace std::chrono;
  const auto end_time{system_clock::now()};
  return duration_cast<milliseconds>(end_time - start_time).count();
}
__attribute__((constructor)) void setup() {
  using namespace std;
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << fixed << setprecision(15);
#ifdef _buffer_check
  atexit([] {
    ofstream cnsl("CON");
    char bufc;
    if (cin >> bufc)
      cnsl << "\n\033[43m\033[30mwarning: buffer not empty.\033[0m\n\n";
  });
#endif
}
unsigned cases(void), caseid = 1;
template <class C> void main() {
  for (const unsigned total = cases(); caseid <= total; ++caseid) C();
}
}  // namespace config
#line 3 "Library\\gcc_builtin.hpp"
namespace workspace {
constexpr int clz32(const uint32_t &n) noexcept { return __builtin_clz(n); }
constexpr int clz64(const uint64_t &n) noexcept { return __builtin_clzll(n); }
constexpr int ctz(const uint64_t &n) noexcept { return __builtin_ctzll(n); }
constexpr int popcnt(const uint64_t &n) noexcept {
  return __builtin_popcountll(n);
}
}  // namespace workspace
#line 2 "Library\\gcc_option.hpp"
#ifdef ONLINE_JUDGE
#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2")
#pragma GCC optimize("unroll-loops")
#endif
#line 5 "Library\\utils\\binary_search.hpp"
namespace workspace {
// binary search on discrete range.
template <
    class iter_type, class pred_type,
    std::enable_if_t<
        std::is_convertible_v<std::invoke_result_t<pred_type, iter_type>, bool>,
        std::nullptr_t> = nullptr>
iter_type binary_search(iter_type ok, iter_type ng, pred_type pred) {
  assert(ok != ng);
  intmax_t dist(ng - ok);
  while (std::abs(dist) > 1) {
    iter_type mid(ok + dist / 2);
    if (pred(mid))
      ok = mid, dist -= dist / 2;
    else
      ng = mid, dist /= 2;
  }
  return ok;
}
// binary search on real numbers.
template <
    class real_type, class pred_type,
    std::enable_if_t<
        std::is_convertible_v<std::invoke_result_t<pred_type, real_type>, bool>,
        std::nullptr_t> = nullptr>
real_type binary_search(real_type ok, real_type ng, const real_type eps,
                        pred_type pred) {
  assert(ok != ng);
  while (std::abs(ok - ng) > eps) {
    real_type mid{(ok + ng) / 2};
    (pred(mid) ? ok : ng) = mid;
  }
  return ok;
}
}  // namespace workspace
#line 3 "Library\\utils\\casefmt.hpp"
namespace workspace {
std::ostream &casefmt(std::ostream &os) {
  return os << "Case #" << config::caseid << ": ";
}
}  // namespace workspace
#line 3 "Library\\utils\\chval.hpp"
namespace workspace {
template <class T, class Comp = std::less<T>>
bool chle(T &x, const T &y, Comp comp = Comp()) {
  return comp(y, x) ? x = y, true : false;
}
template <class T, class Comp = std::less<T>>
bool chge(T &x, const T &y, Comp comp = Comp()) {
  return comp(x, y) ? x = y, true : false;
}
}  // namespace workspace
#line 3 "Library\\utils\\fixed_point.hpp"
namespace workspace {
// specify the return type of lambda.
template <class lambda_type> class fixed_point {
  lambda_type func;

 public:
  fixed_point(lambda_type &&f) : func(std::move(f)) {}
  template <class... Args> auto operator()(Args &&... args) const {
    return func(*this, std::forward<Args>(args)...);
  }
};
}  // namespace workspace
#line 2 "Library\\utils\\sfinae.hpp"
#include <type_traits>
template <class type, template <class> class trait>
using enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;
template <class Container>
using element_type = std::remove_const_t<std::remove_reference_t<decltype(
    *std::begin(std::declval<Container &>()))>>;
#line 7 "Library\\utils\\hash.hpp"
namespace workspace {
template <class T, class = void> struct hash : std::hash<T> {};
template <class Unique_bits_type>
struct hash<Unique_bits_type,
            enable_if_trait_type<Unique_bits_type,
                                 std::has_unique_object_representations>> {
  size_t operator()(uint64_t x) const {
    static const uint64_t m = std::random_device{}();
    x ^= x >> 23;
    // x *= 0x2127599bf4325c37ULL;
    x ^= m;
    x ^= x >> 47;
    return x - (x >> 32);
  }
};
template <class Key> size_t hash_combine(const size_t &seed, const Key &key) {
  return seed ^
         (hash<Key>()(key) + 0x9e3779b9 /* + (seed << 6) + (seed >> 2) */);
}
template <class T1, class T2> struct hash<std::pair<T1, T2>> {
  size_t operator()(const std::pair<T1, T2> &pair) const {
    return hash_combine(hash<T1>()(pair.first), pair.second);
  }
};
template <class... T> class hash<std::tuple<T...>> {
  template <class Tuple, size_t index = std::tuple_size<Tuple>::value - 1>
  struct tuple_hash {
    static uint64_t apply(const Tuple &t) {
      return hash_combine(tuple_hash<Tuple, index - 1>::apply(t),
                          std::get<index>(t));
    }
  };
  template <class Tuple> struct tuple_hash<Tuple, size_t(-1)> {
    static uint64_t apply(const Tuple &t) { return 0; }
  };

 public:
  uint64_t operator()(const std::tuple<T...> &t) const {
    return tuple_hash<std::tuple<T...>>::apply(t);
  }
};
template <class hash_table> struct hash_table_wrapper : hash_table {
  using key_type = typename hash_table::key_type;
  size_t count(const key_type &key) const {
    return hash_table::find(key) != hash_table::end();
  }
  template <class... Args> auto emplace(Args &&... args) {
    return hash_table::insert(typename hash_table::value_type(args...));
  }
};
template <class Key, class Mapped = __gnu_pbds::null_type>
using cc_hash_table =
    hash_table_wrapper<__gnu_pbds::cc_hash_table<Key, Mapped, hash<Key>>>;
template <class Key, class Mapped = __gnu_pbds::null_type>
using gp_hash_table =
    hash_table_wrapper<__gnu_pbds::gp_hash_table<Key, Mapped, hash<Key>>>;
template <class Key, class Mapped>
using unordered_map = std::unordered_map<Key, Mapped, hash<Key>>;
template <class Key> using unordered_set = std::unordered_set<Key, hash<Key>>;
}  // namespace workspace
#line 3 "Library\\utils\\iostream_overload.hpp"
namespace std {
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
  return is >> p.first >> p.second;
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  return os << p.first << ' ' << p.second;
}
template <class tuple_t, size_t index> struct tuple_is {
  static istream &apply(istream &is, tuple_t &t) {
    tuple_is<tuple_t, index - 1>::apply(is, t);
    return is >> get<index>(t);
  }
};
template <class tuple_t> struct tuple_is<tuple_t, SIZE_MAX> {
  static istream &apply(istream &is, tuple_t &t) { return is; }
};
template <class... T> istream &operator>>(istream &is, tuple<T...> &t) {
  return tuple_is<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is,
                                                                          t);
}
template <class tuple_t, size_t index> struct tuple_os {
  static ostream &apply(ostream &os, const tuple_t &t) {
    tuple_os<tuple_t, index - 1>::apply(os, t);
    return os << ' ' << get<index>(t);
  }
};
template <class tuple_t> struct tuple_os<tuple_t, 0> {
  static ostream &apply(ostream &os, const tuple_t &t) {
    return os << get<0>(t);
  }
};
template <class tuple_t> struct tuple_os<tuple_t, SIZE_MAX> {
  static ostream &apply(ostream &os, const tuple_t &t) { return os; }
};
template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) {
  return tuple_os<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os,
                                                                          t);
}
template <class Container, typename Value = typename Container::value_type,
          enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> =
              nullptr>
istream &operator>>(istream &is, Container &cont) {
  for (auto &&e : cont) is >> e;
  return is;
}
template <class Container, typename Value = typename Container::value_type,
          enable_if_t<!is_same<decay_t<Container>, string>::value, nullptr_t> =
              nullptr>
ostream &operator<<(ostream &os, const Container &cont) {
  bool flag = 1;
  for (auto &&e : cont) flag ? flag = 0 : (os << ' ', 0), os << e;
  return os;
}
}  // namespace std
#line 3 "Library\\utils\\read.hpp"
namespace workspace {
// read with std::cin.
template <class T = void> struct read {
  typename std::remove_const<T>::type value;
  template <class... types> read(types... args) : value(args...) {
    std::cin >> value;
  }
  operator T() const { return value; }
};
template <> struct read<void> {
  template <class T> operator T() const {
    T value;
    std::cin >> value;
    return value;
  }
};
}  // namespace workspace
#line 13 "yu.cpp"

namespace workspace {
constexpr char eol = '\n';
using namespace std;
using i64 = int_least64_t;
using p32 = pair<int, int>;
using p64 = pair<i64, i64>;
template <class T, class Comp = std::less<T>>
using priority_queue = std::priority_queue<T, std::vector<T>, Comp>;
template <class T> using stack = std::stack<T, std::vector<T>>;
struct solver;
}  // namespace workspace
int main() { config::main<workspace::solver>(); }
unsigned config::cases() {
  // return -1; // not specify
  // int t; std::cin >> t; return t; // given
  return 1;
}

struct workspace::solver {
  solver() {
    // start here!
    int n = read();
    vector<int> a(n);
    cin >> a;
    i64 sum = 0;
    for (int i = n; i; i--) {
      if ((a[i - 1] + sum) % i) {
        cout << "No\n";
        return;
      }
      sum += (sum + a[i - 1]) / i;
    }
    cout << "Yes\n";
  }
};