#369464 (C++17(clang)) No.868 ハイパー部分和問題

• 問題: No.868 ハイパー部分和問題
• ユーザー: noshi91
• 提出日時: 2019-08-16 22:20:29
• 言語: C++17(clang) (17.0.6 + boost 1.83.0)
• 結果: AC
• 実行時間: 584 ms / 7,000 ms
• コード長: 3,427 bytes
• コンパイル時間: 1,081 ms
• コンパイル使用メモリ: 130,288 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-05-07 19:21:14
• 合計ジャッジ時間: 10,160 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,816 KB
testcase_01	AC	2 ms; 6,940 KB
testcase_02	AC	1 ms; 6,944 KB
testcase_03	AC	1 ms; 6,944 KB
testcase_04	AC	2 ms; 6,944 KB
testcase_05	AC	1 ms; 6,940 KB
testcase_06	AC	1 ms; 6,940 KB
testcase_07	AC	1 ms; 6,944 KB
testcase_08	AC	1 ms; 6,944 KB
testcase_09	AC	1 ms; 6,944 KB
testcase_10	AC	1 ms; 6,940 KB
testcase_11	AC	1 ms; 6,940 KB
testcase_12	AC	2 ms; 6,940 KB
testcase_13	AC	2 ms; 6,940 KB
testcase_14	AC	346 ms; 6,940 KB
testcase_15	AC	348 ms; 6,944 KB
testcase_16	AC	347 ms; 6,940 KB
testcase_17	AC	343 ms; 6,944 KB
testcase_18	AC	338 ms; 6,944 KB
testcase_19	AC	230 ms; 6,944 KB
testcase_20	AC	235 ms; 6,944 KB
testcase_21	AC	235 ms; 6,940 KB
testcase_22	AC	236 ms; 6,944 KB
testcase_23	AC	238 ms; 6,940 KB
testcase_24	AC	239 ms; 6,944 KB
testcase_25	AC	235 ms; 6,940 KB
testcase_26	AC	233 ms; 6,940 KB
testcase_27	AC	238 ms; 6,940 KB
testcase_28	AC	241 ms; 6,944 KB
testcase_29	AC	201 ms; 6,944 KB
testcase_30	AC	197 ms; 6,940 KB
testcase_31	AC	208 ms; 6,940 KB
testcase_32	AC	360 ms; 6,944 KB
testcase_33	AC	357 ms; 6,940 KB
testcase_34	AC	565 ms; 6,944 KB
testcase_35	AC	584 ms; 6,940 KB
testcase_36	AC	387 ms; 6,940 KB
testcase_37	AC	367 ms; 6,940 KB
testcase_38	AC	2 ms; 6,940 KB
testcase_39	AC	2 ms; 6,940 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 <utility>

namespace n91 {

void main_() {
  const auto n = scan<usize>();
  const auto k = scan<usize>();
  std::vector<usize> a(n);
  for (auto &e : a) {
    std::cin >> e;
  }

  static constexpr u64 Mod =
      (static_cast<u64>(1) << static_cast<u64>(63)) - static_cast<u64>(91);

  const auto add = [](u64 &lhs, const u64 rhs) {
    lhs += rhs;
    if (lhs >= Mod) {
      lhs -= Mod;
    }
  };
  const auto sub = [](u64 &lhs, const u64 rhs) {
    if (lhs < rhs) {
      lhs += Mod;
    }
    lhs -= rhs;
  };

  std::vector<u64> dp(k + 1_z, static_cast<u64>(0));
  dp[0_z] = static_cast<u64>(1);

  for (const auto e : a) {
    if (e != 0_z && e <= k) {
      for (const auto i : revrep(e, k + 1_z)) {
        add(dp[i], dp[i - e]);
      }
    }
  }

  const auto q = scan<usize>();

  for (const auto loop : rep(0_z, q)) {
    const auto x = scan<usize>() - 1_z;
    const auto v = scan<usize>();

    const usize old = a[x];

    if (old != 0_z && old <= k) {
      for (const auto i : rep(old, k + 1_z)) {
        sub(dp[i], dp[i - old]);
      }
    }
    a[x] = v;
    if (v != 0_z && v <= k) {
      for (const auto i : revrep(v, k + 1_z)) {
        add(dp[i], dp[i - v]);
      }
    }

    std::cout << (dp[k] != static_cast<u64>(0) ? "1" : "0") << std::endl;
  }
}

} // namespace n91

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