#567978 (C++17) No.1260 たくさんの多項式

提出ソース

結果

問題	No.1260 たくさんの多項式
ユーザー	KoD
提出日時	2020-10-16 22:54:46
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	187 ms / 2,000 ms
コード長	7,602 bytes
コンパイル時間	541 ms
コンパイル使用メモリ	78,424 KB
実行使用メモリ	4,384 KB
最終ジャッジ日時	2023-09-28 04:43:11
合計ジャッジ時間	8,308 ms
ジャッジサーバーID （参考情報）	judge11 / judge13

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	3 ms 4,376 KB
testcase_01	AC	3 ms 4,376 KB
testcase_02	AC	3 ms 4,376 KB
testcase_03	AC	2 ms 4,376 KB
testcase_04	AC	2 ms 4,376 KB
testcase_05	AC	3 ms 4,380 KB
testcase_06	AC	2 ms 4,376 KB
testcase_07	AC	3 ms 4,376 KB
testcase_08	AC	3 ms 4,380 KB
testcase_09	AC	3 ms 4,376 KB
testcase_10	AC	3 ms 4,380 KB
testcase_11	AC	3 ms 4,376 KB
testcase_12	AC	3 ms 4,376 KB
testcase_13	AC	3 ms 4,380 KB
testcase_14	AC	3 ms 4,376 KB
testcase_15	AC	3 ms 4,380 KB
testcase_16	AC	2 ms 4,376 KB
testcase_17	AC	3 ms 4,376 KB
testcase_18	AC	3 ms 4,376 KB
testcase_19	AC	3 ms 4,380 KB
testcase_20	AC	180 ms 4,380 KB
testcase_21	AC	51 ms 4,376 KB
testcase_22	AC	152 ms 4,376 KB
testcase_23	AC	127 ms 4,376 KB
testcase_24	AC	129 ms 4,380 KB
testcase_25	AC	104 ms 4,376 KB
testcase_26	AC	124 ms 4,380 KB
testcase_27	AC	100 ms 4,376 KB
testcase_28	AC	172 ms 4,376 KB
testcase_29	AC	127 ms 4,376 KB
testcase_30	AC	81 ms 4,376 KB
testcase_31	AC	130 ms 4,380 KB
testcase_32	AC	130 ms 4,376 KB
testcase_33	AC	108 ms 4,380 KB
testcase_34	AC	168 ms 4,380 KB
testcase_35	AC	76 ms 4,376 KB
testcase_36	AC	69 ms 4,380 KB
testcase_37	AC	129 ms 4,380 KB
testcase_38	AC	142 ms 4,376 KB
testcase_39	AC	166 ms 4,376 KB
testcase_40	AC	128 ms 4,384 KB
testcase_41	AC	161 ms 4,380 KB
testcase_42	AC	118 ms 4,376 KB
testcase_43	AC	169 ms 4,376 KB
testcase_44	AC	110 ms 4,380 KB
testcase_45	AC	103 ms 4,376 KB
testcase_46	AC	94 ms 4,376 KB
testcase_47	AC	119 ms 4,376 KB
testcase_48	AC	25 ms 4,376 KB
testcase_49	AC	90 ms 4,380 KB
testcase_50	AC	48 ms 4,376 KB
testcase_51	AC	169 ms 4,380 KB
testcase_52	AC	59 ms 4,380 KB
testcase_53	AC	80 ms 4,376 KB
testcase_54	AC	174 ms 4,380 KB
testcase_55	AC	186 ms 4,380 KB
testcase_56	AC	83 ms 4,376 KB
testcase_57	AC	122 ms 4,376 KB
testcase_58	AC	77 ms 4,376 KB
testcase_59	AC	134 ms 4,376 KB
testcase_60	AC	187 ms 4,376 KB

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

ソースコード

raw source code

#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>

#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/chmin_chmax.cpp"

template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) { lhs = rhs; return true; }
  return false;
}

template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) { lhs = rhs; return true; }
  return false;
}

/**
 * @title Chmin/Chmax
 */
#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp"

class range {
public:
  class iterator {
  private:
    int64_t M_position;

  public:
    constexpr iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { ++M_position; }
    constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }
  };

  class reverse_iterator {
  private:
    int64_t M_position;
  
  public:
    constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { --M_position; }
    constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }
  };
  
private:
  const iterator M_first, M_last;

public:
  constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { }
  constexpr iterator begin() const noexcept { return M_first; }
  constexpr iterator end() const noexcept { return M_last; }
  constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } 
  constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } 
};

/**
 * @title Range
 */
#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/algebraic/modular.cpp"

#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/algebraic/mod_inv.cpp"

#line 4 "/Users/kodamankod/Desktop/cpp_programming/Library/algebraic/mod_inv.cpp"
#include <cstdint>

constexpr std::pair<int64_t, int64_t> mod_inv(int64_t a, int64_t b) {
  if ((a %= b) == 0) return { b, 0 };
  int64_t s = b, t = (a < 0 ? a + b : a);
  int64_t m0 = 0, m1 = 1, tmp = 0;
  while (t > 0) {
    const auto u = s / t;
    s -= t * u; m0 -= m1 * u;
    tmp = s; s = t; t = tmp; tmp = m0; m0 = m1; m1 = tmp;
  }
  return { s, (m0 < 0 ? m0 + b / s : m0) };
}

/**
 * @title Extended GCD
 */
#line 4 "/Users/kodamankod/Desktop/cpp_programming/Library/algebraic/modular.cpp"

#line 8 "/Users/kodamankod/Desktop/cpp_programming/Library/algebraic/modular.cpp"
#include <type_traits>

template <class Modulus>
class modular {
public:
  using value_type = uint32_t;
  using cover_type = uint64_t;
 
  static constexpr uint32_t mod() { return Modulus::mod(); }
  template <class T>
  static constexpr value_type normalize(T value_) noexcept {
    if (value_ < 0) {
      value_ = -value_;
      value_ %= mod();
      if (value_ == 0) return 0;
      return mod() - value_;
    }
    return value_ % mod();
  }

private:
  value_type value;

  template <bool IsPrime, std::enable_if_t<IsPrime>* = nullptr>
  constexpr modular inverse_helper() const noexcept { return power(*this, mod() - 2); }
  template <bool IsPrime, std::enable_if_t<!IsPrime>* = nullptr>
  constexpr modular inverse_helper() const noexcept {
    const auto tmp = mod_inv(value, mod());
    assert(tmp.first == 1);
    return modular(tmp.second);
  }

public:
  constexpr modular() noexcept : value(0) { }
  template <class T>
  explicit constexpr modular(T value_) noexcept : value(normalize(value_)) { }
  template <class T>
  explicit constexpr operator T() const noexcept { return static_cast<T>(value); }
 
  constexpr value_type get() const noexcept { return value; }
  constexpr value_type &extract() noexcept { return value; }
  constexpr modular operator - () const noexcept { return modular(mod() - value); }
  constexpr modular operator ~ () const noexcept { return inverse(*this); }
 
  constexpr modular operator + (const modular &rhs) const noexcept { return modular(*this) += rhs; }
  constexpr modular& operator += (const modular &rhs) noexcept { 
    if ((value += rhs.value) >= mod()) value -= mod(); 
    return *this; 
  }
 
  constexpr modular operator - (const modular &rhs) const noexcept { return modular(*this) -= rhs; }
  constexpr modular& operator -= (const modular &rhs) noexcept { 
    if ((value += mod() - rhs.value) >= mod()) value -= mod(); 
    return *this; 
  }
 
  constexpr modular operator * (const modular &rhs) const noexcept { return modular(*this) *= rhs; }
  constexpr modular& operator *= (const modular &rhs) noexcept { 
    value = (cover_type) value * rhs.value % mod();
    return *this;
  }
 
  constexpr modular operator / (const modular &rhs) const noexcept { return modular(*this) /= rhs; }
  constexpr modular& operator /= (const modular &rhs) noexcept { return (*this) *= inverse(rhs); }
 
  constexpr bool zero() const noexcept { return value == 0; }
  constexpr bool operator == (const modular &rhs) const noexcept { return value == rhs.value; }
  constexpr bool operator != (const modular &rhs) const noexcept { return value != rhs.value; }
 
  friend std::ostream& operator << (std::ostream &stream, const modular &rhs) { return stream << rhs.value; }
  friend constexpr modular inverse(const modular &val) noexcept { return val.inverse_helper<Modulus::is_prime>(); }
  friend constexpr modular power(modular val, cover_type exp) noexcept { 
    modular res(1);
    for (; exp > 0; exp >>= 1, val *= val) if (exp & 1) res *= val;
    return res;
  }
 
};
 
template <uint32_t Mod, bool IsPrime = true>
struct static_modulus { 
  static constexpr uint32_t mod() noexcept { return Mod; } 
  static constexpr bool is_prime = IsPrime;
};

template <uint32_t Id = 0, bool IsPrime = false>
struct dynamic_modulus {
  static uint32_t &mod() noexcept { static uint32_t val = 0; return val; }
  static constexpr bool is_prime = IsPrime;
};

template <uint32_t Mod, bool IsPrime = true>
using mint32_t = modular<static_modulus<Mod, IsPrime>>;
using rmint32_t = modular<dynamic_modulus<>>;

/*
 * @title Modint
 */
#line 17 "main.cpp"

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

using m32 = mint32_t<1000000007>;

i64 naive(i64 N) {
  i64 ans = 0;
  for (auto i: range(2, N + 1)) {
    i64 x = N;
    while (x > 0) {
      ans += x % i;
      ans %= 1000000007;
      x /= i;
    }
  }
  std::cout << ans << '\n';
  return ans;
}

int main() {
  i64 N;
  std::cin >> N;
  m32 ans;
  i64 step = 2;
  for (; step * step <= N; ++step) {
    i64 x = N;
    while (x > 0) {
      ans += m32(x % step);
      x /= step;
    }
  }
  // std::cout << step << ' ' << ans << '\n';
  i64 last = N / step;
  while (--step) {
    i64 tmp = N / step;
    i64 cnt = tmp - last;
    last = tmp;
    // std::cout << step << ' ' << tmp << ' ' << cnt << '\n';
    if (__int128_t(tmp) * tmp > N) {
      ans += m32(step) * m32(cnt);
      ans += m32(N % tmp + N % tmp + (cnt - 1) * step) * m32(cnt) / m32(2); 
    }
  }
  std::cout << ans << '\n';
  // naive(N);
  return 0;
}

yukicoder

結果

テストケース

ソースコード