#379237 (C++14) No.886 Direct

提出ソース

結果

問題	No.886 Direct
ユーザー	noshi91
提出日時	2019-09-13 23:07:53
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,521 bytes
コンパイル時間	816 ms
コンパイル使用メモリ	82,320 KB
実行使用メモリ	144,348 KB
最終ジャッジ日時	2023-09-17 15:14:27
合計ジャッジ時間	11,977 ms
ジャッジサーバーID （参考情報）	judge13 / judge11

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,376 KB
testcase_01	AC	1 ms 4,376 KB
testcase_02	WA	-
testcase_03	WA	-
testcase_04	AC	1 ms 4,380 KB
testcase_05	WA	-
testcase_06	WA	-
testcase_07	AC	1 ms 4,376 KB
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

/*

線分ではなく直線で解いていた、供養

*/


//#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 <cstdint>

namespace n91 {

constexpr std::uint_fast64_t totient(std::uint_fast64_t x) noexcept {
  using u64 = std::uint_fast64_t;
  u64 ret = x;
  for (u64 i = static_cast<u64>(2); i * i <= x; ++i) {
    if (x % i == static_cast<u64>(0)) {
      ret -= ret / i;
      x /= i;
      while (x % i == static_cast<u64>(0)) {
        x /= i;
      }
    }
  }
  if (x != static_cast<u64>(1)) {
    ret -= ret / x;
  }
  return ret;
}

template <std::uint_fast64_t Modulus,
          std::uint_fast64_t InverseExp =
              totient(Modulus) - static_cast<std::uint_fast64_t>(1)>
class modint {
  using u64 = std::uint_fast64_t;

  static_assert(Modulus < static_cast<u64>(1) << static_cast<u64>(32),
                "Modulus must be less than 2**32");

  u64 a;

  constexpr modint &negate() noexcept {
    if (a != static_cast<u64>(0)) {
      a = Modulus - a;
    }
    return *this;
  }

public:
  constexpr modint(const u64 x = static_cast<u64>(0)) noexcept
      : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+() const noexcept { return modint(*this); }
  constexpr modint operator-() const noexcept { return modint(*this).negate(); }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
    u64 exp = InverseExp;
    while (exp) {
      if (exp % static_cast<u64>(2) != static_cast<u64>(0)) {
        *this *= rhs;
      }
      rhs *= rhs;
      exp /= static_cast<u64>(2);
    }
    return *this;
  }
  constexpr bool operator==(const modint rhs) const noexcept {
    return a == rhs.a;
  }
  constexpr bool operator!=(const modint rhs) const noexcept {
    return a != rhs.a;
  }
};

template <class T, std::uint_fast64_t v> class modint_constant {
public:
  static constexpr T value = static_cast<T>(v);

  using value_type = T;
};

} // namespace n91

template <class T> void multiple_transform(::std::vector<T> &a) {
  int n = a.size();
  ::std::vector<bool> sieve(n, true);
  for (int p = 2; p < n; ++p) {
    if (sieve[p]) {
      for (int k = (n - 1) / p; k != 0; --k) {
        sieve[k * p] = false;
        a[k] += a[k * p];
      }
    }
  }
  for (int i = 0; ++i != n;) {
    a[i] += a[0];
  }
}

template <class T> void inverse_multiple_transform(::std::vector<T> &a) {
  int n = a.size();
  ::std::vector<bool> sieve(n, true);
  for (int i = 0; ++i != n;) {
    a[i] -= a[0];
  }
  for (int p = 2; p < n; ++p) {
    if (sieve[p]) {
      for (int k = 1; k * p < n; ++k) {
        sieve[k * p] = false;
        a[k] -= a[k * p];
      }
    }
  }
}

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

namespace n91 {

constexpr usize lm(const usize a, const usize b) {
  if (b < a) {
    return a - b;
  } else {
    return 0_z;
  }
}

void main_() {
  using mint = modint<static_cast<u64>(1000000007)>;
  const usize h = scan<usize>();
  const usize w = scan<usize>();
  const usize n = std::max({h, w, 2_z});
  std::vector<mint> a012(n), a01(n), a1(n), b012(n), b01(n), b1(n);
  for (const auto i : rep(1_z, n)) {
    {
      const mint t012 = static_cast<mint>(lm(h, i));
      const mint t0 = static_cast<mint>(lm(h, i * 3_z));
      usize l = std::max(i * 2_z, h), u = std::min(h + i, i * 3_z);
      const mint t2 = static_cast<mint>(lm(u, l));
      a012[i] = t012;
      a01[i] = t012 - t2;
      a1[i] = t012 - t0 - t2;
    }
    {
      const mint t012 = static_cast<mint>(lm(w, i));
      const mint t0 = static_cast<mint>(lm(w, i * 3_z));
      usize l = std::max(i * 2_z, w), u = std::min(w + i, i * 3_z);
      const mint t2 = static_cast<mint>(lm(u, l));
      b012[i] = t012;
      b01[i] = t012 - t2;
      b1[i] = t012 - t0 - t2;
    }
  }
  mint ans = static_cast<mint>(0);
  {
    multiple_transform(a012);
    multiple_transform(b012);
    for (const auto i : rep(0_z, n)) {
      a012[i] *= b012[i];
    }
    inverse_multiple_transform(a012);
    ans += a012[1_z] * static_cast<mint>(2);
  }
  {
    multiple_transform(a01);
    multiple_transform(b01);
    for (const auto i : rep(0_z, n)) {
      a01[i] *= b01[i];
    }
    inverse_multiple_transform(a01);
    ans -= a01[1_z] * static_cast<mint>(2);
  }
  {
    multiple_transform(a1);
    multiple_transform(b1);
    for (const auto i : rep(0_z, n)) {
      a1[i] *= b1[i];
    }
    inverse_multiple_transform(a1);
    ans += a1[1_z];
  }
  if (h == 2_z) {
    ans += static_cast<mint>(w);
  }
  if (w == 2_z) {
    ans += static_cast<mint>(h);
  }
  std::cout << ans.value() << std::endl;
}

} // namespace n91

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

yukicoder

結果

テストケース

ソースコード