結果

問題 No.2798 Multiple Chain
コンテスト
ユーザー ir5
提出日時 2024-06-28 23:05:28
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 4,118 bytes
コンパイル時間 2,810 ms
コンパイル使用メモリ 165,672 KB
実行使用メモリ 56,996 KB
最終ジャッジ日時 2024-06-28 23:05:38
合計ジャッジ時間 8,201 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 38 TLE * 1 -- * 12
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <functional>
#include <iomanip>
using namespace std;
using ll = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};

template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> void take(vector<T>& vec, int n) { vec.resize(n); for (int i = 0; i < n; ++i) cin >> vec[i]; }
template<typename T, size_t X> ostream& operator<<(ostream& os, const array<T, X>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

namespace solver {

template<typename T1, typename T2> struct In2 {
  T1 a; T2 b;
  friend std::istream& operator>>(std::istream& is, In2& obj) { T1 t1; T2 t2; is >> t1 >> t2; obj = {t1, t2}; return is; }
};

template<typename T1, typename T2, typename T3> struct In3 {
  T1 a; T2 b; T3 c;
  friend std::istream& operator>>(std::istream& is, In3& obj) { T1 t1; T2 t2; T3 t3; is >> t1 >> t2 >> t3; obj = {t1, t2, t3}; return is; }
};

ll n;

void read() {
  cin >> n;
}

using RetType = int;

/*
map<ll, ll> memo;

ll dp(ll n0, ll a0) {
  if (memo.count(n0)) reutnr memo[n0];
  ll res = 1;

  // n0 = a * a * x
  // a <= x
  for (ll a = a0; a * a * a <= n0; a += a1min) if (n0 % (a * a) == 0) {
    res += dp(n0 / a, a);
  }
  // a >= x
  for (ll x = 1; )

  return memo[n0] = res;
}
*/

int s;
using A = array<char, 10>;
A vm;
map<pair<A, A>, int> memo;
int dfs(A curr, A sum) {
  if (memo.count({curr, sum})) return memo[{curr, sum}];
  // dump(curr << " " << sum);

  if (sum == vm) {
    return 1;
  }

  A next, nsum;
  next.fill(0);
  nsum.fill(0);
  auto dfs2 = [&](auto self, int idx, int tot) -> int {
    if (idx == s) {
      if (tot) return dfs(next, nsum);
      return 0;
    }

    int res = 0;
    for (int val : range(curr[idx], 1 + vm[idx])) {
      if (val + sum[idx] > vm[idx]) break;
      next[idx] = val;
      nsum[idx] = sum[idx] + val;
      res += self(self, idx + 1, tot + val);
    }
    return res;
  };

  int res = dfs2(dfs2, 0, 0);
  return memo[{curr, sum}] = res;
}

RetType run() {
  map<ll, ll> mp;

  for (ll p = 2; p * p * p <= n; ++p) {
    while (n % p == 0) mp[p]++, n/= p;
  }

  if (n > 1) {
    ll x = (ll)(sqrt(n) + 0.5);
    if (x * x == n) mp[x] += 2;
    else mp[n]++;
  }

  vector<int> vv;
  s = (int)mp.size();
  vv.assign(s, 0);
  int idx = 0;
  for (auto p : mp) vv[idx++] = p.second;

  ranges::sort(vv);
  while (vv.size() > 0 && vv[0] == 1) vv.erase(vv.begin());
  s = (int)vv.size();

  for (int i : range(s)) vm[i] = vv[i];

  dump(vv);

  if (s == 0) {
    dump("NONE");
    return 1;
  }

  auto z = A();
  z.fill(0);
  memo.clear();
  int res = dfs(z, z);

  return res;
}

}  // namespace

template <typename F>
void run(F f) { if constexpr (std::is_same_v<decltype(f()), void>) f(); else cout << f() << endl; }

int main(int argc, char** argv) {
  cerr << fixed << setprecision(12);
  cout << fixed << setprecision(12);
  int testcase = 1;
  if (argc > 1) testcase = atoi(argv[1]);
  while (testcase--) {
    solver::read();
  }
  run(solver::run);
}
0