#378911 (C++14) No.884 Eat and Add

• 問題: No.884 Eat and Add
• ユーザー: noshi91
• 提出日時: 2019-09-13 21:53:15
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 2,921 bytes
• コンパイル時間: 547 ms
• コンパイル使用メモリ: 75,928 KB
• 実行使用メモリ: 6,656 KB
• 最終ジャッジ日時: 2024-07-04 04:11:22
• 合計ジャッジ時間: 1,164 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	WA	-
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	8 ms; 6,656 KB
testcase_04	AC	8 ms; 6,656 KB
testcase_05	AC	7 ms; 6,656 KB
testcase_06	WA	-
testcase_07	AC	8 ms; 6,656 KB
testcase_08	WA	-
testcase_09	WA	-
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB

ソースコード

//#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <vector>

namespace n91 {

  using i8 = std::int_fast8_t;
  using i32 = std::int_fast32_t;
  using i64 = std::int_fast64_t;
  using u8 = std::uint_fast8_t;
  using u32 = std::uint_fast32_t;
  using u64 = std::uint_fast64_t;
  using isize = std::ptrdiff_t;
  using usize = std::size_t;

  constexpr usize operator"" _z(unsigned long long x) noexcept {
    return static_cast<usize>(x);
  }

  class rep {
    const usize f, l;

  public:
    class itr {
      friend rep;
      usize i;
      constexpr itr(const usize x) noexcept : i(x) {}

    public:
      void operator++() noexcept { ++i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    constexpr rep(const usize first, const usize last) noexcept
      : f(first), l(last) {}
    constexpr itr begin() const noexcept { return itr(f); }
    constexpr itr end() const noexcept { return itr(l); }
  };
  class revrep {
    const usize f, l;

  public:
    class itr {
      friend revrep;
      usize i;
      constexpr itr(usize x) noexcept : i(x) {}

    public:
      void operator++() noexcept { --i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    constexpr revrep(usize first, usize last) noexcept : f(--first), l(--last) {}
    constexpr itr begin() const noexcept { return itr(l); }
    constexpr itr end() const noexcept { return itr(f); }
  };
  template <class T> using vec_alias = std::vector<T>;
  template <class T> auto md_vec(const usize n, const T& value) {
    return std::vector<T>(n, value);
  }
  template <class... Args> auto md_vec(const usize n, Args... args) {
    return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
  }
  template <class T> constexpr T difference(const T& a, const T& b) {
    return a < b ? b - a : a - b;
  }
  template <class T> T scan() {
    T ret;
    std::cin >> ret;
    return ret;
  }

} // namespace n91

#include <algorithm>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <utility>

namespace n91 {

  void main_() {
    const std::string s = []() {
      std::string s;
      std::cin >> s;
      std::reverse(s.begin(), s.end());
      return std::move(s);
    }();
    const usize n = s.size();
    std::vector<usize> dp0(n + 1_z), dp1(n + 1_z);
    for (const auto i : rep(0_z, n)) {
      if (s[i] == '0') {
        dp0[i + 1_z] = std::min(dp0[i], dp1[i] + 1_z);
        dp1[i + 1_z] = dp1[i] + 1_z;
      }
      else {
        dp0[i + 1_z] = dp0[i] + 1_z;
        dp1[i + 1_z] = std::min(dp0[i] + 1_z, dp1[i]);
      }
    }
    std::cout << std::min(dp0[n], dp1[n] + 1_z) << std::endl;
  }

} // namespace n91

int main() {
  n91::main_();
  return 0;
}