結果

問題 No.2798 Multiple Chain
ユーザー risujirohrisujiroh
提出日時 2024-06-28 22:12:13
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,708 bytes
コンパイル時間 2,994 ms
コンパイル使用メモリ 271,556 KB
実行使用メモリ 8,832 KB
最終ジャッジ日時 2024-06-28 22:12:22
合計ジャッジ時間 4,513 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 11 ms
5,376 KB
testcase_02 AC 8 ms
8,704 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 1 ms
5,376 KB
testcase_05 AC 8 ms
8,704 KB
testcase_06 AC 7 ms
8,704 KB
testcase_07 AC 8 ms
8,704 KB
testcase_08 AC 7 ms
8,704 KB
testcase_09 AC 7 ms
8,704 KB
testcase_10 AC 7 ms
8,704 KB
testcase_11 AC 7 ms
8,704 KB
testcase_12 AC 7 ms
8,704 KB
testcase_13 AC 7 ms
8,704 KB
testcase_14 AC 8 ms
8,704 KB
testcase_15 AC 7 ms
8,576 KB
testcase_16 AC 8 ms
8,704 KB
testcase_17 AC 7 ms
8,704 KB
testcase_18 AC 8 ms
8,704 KB
testcase_19 AC 7 ms
8,704 KB
testcase_20 AC 8 ms
5,376 KB
testcase_21 AC 7 ms
5,376 KB
testcase_22 AC 11 ms
5,376 KB
testcase_23 AC 11 ms
5,376 KB
testcase_24 AC 9 ms
5,376 KB
testcase_25 AC 7 ms
8,576 KB
testcase_26 AC 7 ms
8,704 KB
testcase_27 AC 7 ms
8,704 KB
testcase_28 AC 7 ms
8,704 KB
testcase_29 AC 7 ms
8,576 KB
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 AC 8 ms
8,576 KB
testcase_36 AC 10 ms
8,704 KB
testcase_37 AC 7 ms
8,704 KB
testcase_38 AC 14 ms
8,704 KB
testcase_39 AC 8 ms
8,704 KB
testcase_40 AC 8 ms
8,832 KB
testcase_41 AC 7 ms
8,576 KB
testcase_42 AC 7 ms
8,576 KB
testcase_43 AC 7 ms
8,704 KB
testcase_44 AC 7 ms
8,704 KB
testcase_45 AC 7 ms
8,704 KB
testcase_46 AC 7 ms
8,576 KB
testcase_47 AC 7 ms
8,576 KB
testcase_48 AC 8 ms
8,704 KB
testcase_49 AC 8 ms
8,704 KB
testcase_50 AC 7 ms
8,576 KB
testcase_51 AC 8 ms
8,576 KB
testcase_52 AC 8 ms
8,704 KB
testcase_53 AC 7 ms
8,704 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

namespace {

void solve() {
  Int n;
  scan(n);
  Map<Int, Int> f;
  for (p = Int{2}; p * p * p <= n; ++p) {
    while (n % p == 0) {
      ++f[p];
      n /= p;
    }
  }
  if (f.empty()) {
    Int t =
        static_cast<Int>(std::round(std::sqrt(static_cast<long double>(n))));
    if (t * t == n) {
      print(2);
    } else {
      print(1);
    }
    return;
  }
  if (n != 1) {
    ++f[n];
  }
  Vec pre(2, Vec(60, Vec(60, Vec<Int>(60))));
  for (t : rep(2)) {
    pre[t][0][0][t] = 1;
    for (L : rep(59)) {
      for (s : rep(60)) {
        for (x : rep(60)) {
          Int cur = pre[t][L][s][x];
          if (cur == 0) {
            continue;
          }
          for (y : rep(x, 60)) {
            if (60 <= s + y) {
              break;
            }
            pre[t][L + 1][s + y][y] += cur;
          }
        }
      }
    }
  }
  Vec pre2(2, Vec(60, Vec<Int>(60)));
  for (L : rep(60)) {
    for (s : rep(60)) {
      for (x : rep(60)) {
        pre2[0][L][s] += pre[0][L][s][x] - pre[1][L][s][x];
        pre2[1][L][s] += pre[1][L][s][x];
      }
    }
  }
  Int ans = 0;
  for (L : rep(1, 60)) {
    Arr<Int, 2> a{};
    a[0] = 1;
    for (e : f | views::values) {
      Arr<Int, 2> b{};
      for (i : rep(2)) {
        for (t : rep(2)) {
          b[i | t] += a[i] * pre2[t][L][e];
        }
      }
      a = b;
    }
    ans += a[1];
  }
  print(ans);
}

}  // namespace

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  std::cout << std::setprecision(std::numeric_limits<Float>::max_digits10);

  solve();
}

#else  // __INCLUDE_LEVEL__

#include <bits/stdc++.h>

using Int = int64_t;
using Float = double;
using Str = std::string;

template <class T1, class T2>
using Pair = std::pair<T1, T2>;

template <class... Ts>
using Tuple = std::tuple<Ts...>;

template <class T, size_t N>
using Arr = std::array<T, N>;

template <class T>
using Vec = std::vector<T>;

template <class T>
using Set = std::set<T>;

template <class T>
using Multiset = std::multiset<T>;

template <class K, class T>
using Map = std::map<K, T>;

template <class T>
using MinHeap = std::priority_queue<T, Vec<T>, std::greater<T>>;

template <class T>
using MaxHeap = std::priority_queue<T>;

namespace ranges = std::ranges;
namespace views = std::views;

inline constexpr auto len = ranges::ssize;
inline constexpr auto rev = views::reverse;

constexpr auto rep(Int l, Int r) { return views::iota(std::min(l, r), r); }
constexpr auto rep(Int n) { return rep(0, n); }
constexpr auto rep1(Int l, Int r) { return rep(l, r + 1); }
constexpr auto rep1(Int n) { return rep(1, n + 1); }

template <class T, class U = T>
bool chmin(T& x, U&& y) {
  return y < x && (x = std::forward<U>(y), true);
}

template <class T, class U = T>
bool chmax(T& x, U&& y) {
  return x < y && (x = std::forward<U>(y), true);
}

template <std::signed_integral T = Int>
T inf() {
  T ret;
  std::memset(&ret, 0x3f, sizeof(ret));
  return ret;
}

template <std::floating_point T>
T inf() {
  return std::numeric_limits<T>::infinity();
}

template <class T>
concept Range = ranges::range<T> && !std::convertible_to<T, std::string_view>;

template <class T>
concept TupleLike = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

istream& operator>>(istream& is, TupleLike auto&& t) {
  return apply([&](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

ostream& operator<<(ostream& os, Range auto&& r) {
  for (string_view sep = ""; auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

ostream& operator<<(ostream& os, TupleLike auto&& t) {
  const auto f = [&](auto&... xs) -> ostream& {
    [[maybe_unused]] string_view sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

}  // namespace std

#define DEF_INC_OR_DEC(op) \
  auto& operator op(Range auto&& r) { \
    for (auto&& e : r) { \
      op e; \
    } \
    return r; \
  } \
  auto& operator op(TupleLike auto&& t) { \
    std::apply([](auto&... xs) { (op xs, ...); }, t); \
    return t; \
  }

DEF_INC_OR_DEC(++)
DEF_INC_OR_DEC(--)

#undef DEF_INC_OR_DEC

void scan(auto&&... xs) { std::cin >> std::tie(xs...); }
void print(auto&&... xs) { std::cout << std::tie(xs...) << '\n'; }

template <class F>
class fix {
 public:
  explicit fix(F f) : f_(std::move(f)) {}

  decltype(auto) operator()(auto&&... xs) const {
    return f_(std::ref(*this), std::forward<decltype(xs)>(xs)...);
  }

 private:
  F f_;
};

#define for(...) for ([[maybe_unused]] auto&& __VA_ARGS__)

#endif  // __INCLUDE_LEVEL__
0