結果
問題 | No.2318 Phys Bone Maker |
ユーザー | umimel |
提出日時 | 2023-05-26 22:21:07 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,633 ms / 3,000 ms |
コード長 | 4,582 bytes |
コンパイル時間 | 1,938 ms |
コンパイル使用メモリ | 182,052 KB |
実行使用メモリ | 376,660 KB |
最終ジャッジ日時 | 2023-08-26 12:09:21 |
合計ジャッジ時間 | 15,245 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1,633 ms
376,660 KB |
testcase_03 | AC | 10 ms
4,376 KB |
testcase_04 | AC | 15 ms
4,384 KB |
testcase_05 | AC | 14 ms
4,376 KB |
testcase_06 | AC | 12 ms
4,376 KB |
testcase_07 | AC | 3 ms
4,380 KB |
testcase_08 | AC | 13 ms
4,384 KB |
testcase_09 | AC | 11 ms
4,384 KB |
testcase_10 | AC | 21 ms
4,380 KB |
testcase_11 | AC | 15 ms
4,376 KB |
testcase_12 | AC | 21 ms
4,380 KB |
testcase_13 | AC | 18 ms
4,380 KB |
testcase_14 | AC | 16 ms
4,380 KB |
testcase_15 | AC | 14 ms
4,380 KB |
testcase_16 | AC | 14 ms
4,380 KB |
testcase_17 | AC | 20 ms
4,380 KB |
testcase_18 | AC | 21 ms
4,380 KB |
testcase_19 | AC | 8 ms
4,380 KB |
testcase_20 | AC | 16 ms
4,380 KB |
testcase_21 | AC | 13 ms
4,380 KB |
testcase_22 | AC | 11 ms
4,380 KB |
testcase_23 | AC | 12 ms
4,384 KB |
testcase_24 | AC | 18 ms
4,380 KB |
testcase_25 | AC | 15 ms
4,380 KB |
testcase_26 | AC | 16 ms
4,376 KB |
testcase_27 | AC | 17 ms
4,376 KB |
testcase_28 | AC | 11 ms
4,380 KB |
testcase_29 | AC | 10 ms
4,384 KB |
testcase_30 | AC | 8 ms
4,376 KB |
testcase_31 | AC | 20 ms
4,380 KB |
testcase_32 | AC | 18 ms
4,380 KB |
testcase_33 | AC | 2 ms
4,380 KB |
testcase_34 | AC | 16 ms
4,384 KB |
testcase_35 | AC | 154 ms
37,832 KB |
testcase_36 | AC | 753 ms
178,920 KB |
testcase_37 | AC | 759 ms
179,732 KB |
testcase_38 | AC | 800 ms
180,848 KB |
testcase_39 | AC | 1,163 ms
276,280 KB |
testcase_40 | AC | 1,173 ms
277,844 KB |
testcase_41 | AC | 1,332 ms
313,672 KB |
testcase_42 | AC | 1,328 ms
315,504 KB |
testcase_43 | AC | 23 ms
4,380 KB |
testcase_44 | AC | 176 ms
36,972 KB |
testcase_45 | AC | 159 ms
34,524 KB |
testcase_46 | AC | 1,431 ms
317,844 KB |
testcase_47 | AC | 22 ms
4,376 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using pll = pair<ll, ll>; #define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i) #define rep(i, n) drep(i, 0, n - 1) #define all(a) (a).begin(), (a).end() #define pb push_back #define fi first #define se second mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count()); const ll MOD1000000007 = 1000000007; const ll MOD998244353 = 998244353; const ll MOD[3] = {999727999, 1070777777, 1000000007}; const ll LINF = 1LL << 60; const int IINF = 1 << 30 - 1; template<typename T> struct Edge{ int to; T w; Edge(int to_, T w_=1){ to = to_; w=w_; } }; template<typename T> using Tree = vector<vector<Edge<T>>>; template<typename T> using Graph = vector<vector<Edge<T>>>; /* 容量&重み付きエッジ for Dinic */ template<typename T> struct REdge{ int to; T cap; T cost; int rev; REdge(int to_, T cap_, T cost_=1){ to = to_; cap = cap_; cost = cost_; } REdge(int to_, T cap_, T cost_, int rev_){ to = to_; cap = cap_; cost = cost_; rev = rev_; } }; /* 残余グラフ for Dinic */ template<typename T> using RGraph = vector<vector<REdge<T>>>; template<long long mod> class modint{ long long x; public: modint(long long x=0) : x((x%mod+mod)%mod) {} modint operator-() const { return modint(-x); } bool operator==(const modint& a){ if(x == a) return true; else return false; } bool operator==(long long a){ if(x == a) return true; else return false; } bool operator!=(const modint& a){ if(x != a) return true; else return false; } bool operator!=(long long a){ if(x != a) return true; else return false; } modint& operator+=(const modint& a) { if ((x += a.x) >= mod) x -= mod; return *this; } modint& operator-=(const modint& a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } modint& operator*=(const modint& a) { (x *= a.x) %= mod; return *this; } modint operator+(const modint& a) const { modint res(*this); return res+=a; } modint operator-(const modint& a) const { modint res(*this); return res-=a; } modint operator*(const modint& a) const { modint res(*this); return res*=a; } modint pow(long long t) const { if (!t) return 1; modint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } // for prime mod modint inv() const { return pow(mod-2); } modint& operator/=(const modint& a) { return (*this) *= a.inv(); } modint operator/(const modint& a) const { modint res(*this); return res/=a; } friend std::istream& operator>>(std::istream& is, modint& m) noexcept { is >> m.x; m.x %= mod; if (m.x < 0) m.x += mod; return is; } friend ostream& operator<<(ostream& os, const modint& m){ os << m.x; return os; } }; using mint = modint<MOD998244353>; int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); ll n; cin >> n; vector<ll> div; for(ll i=1; i*i<=n; i++){ if(n%i!=0) continue; div.pb(i); if(i!=n/i) div.pb(n/i); } sort(all(div)); ll m = (ll)div.size(); vector<ll> p; ll sn = n; for(ll i=2; i*i<=n; i++){ if(sn%i!=0) continue; while(sn%i==0) sn/=i; p.pb(i); } if(sn!=1) p.pb(sn); ll pn = (ll)p.size(); vector<vector<ll>> cnt(m, vector<ll>(pn, 0)); rep(i, m){ ll tmp = div[i]; rep(j, pn){ while(tmp%p[j]==0){ tmp/=p[j]; cnt[i][j]++; } } } vector<vector<mint>> r(m, vector<mint>(m, 1)); rep(i, m) rep(j, m){ if(div[i]%div[j]!=0) continue; //j->i rep(k, pn) if(cnt[i][k]==cnt[j][k]) r[i][j] *= cnt[j][k]+1; } vector<vector<ll>> cand(m); rep(i, m) rep(j, m) if(div[i]%div[j]==0 && i!=j) cand[i].pb(j); vector<vector<mint>> dp(2, vector<mint>(m, 0)); auto crt = dp[0], nxt = dp[1]; crt[0] = 1; mint ans = 0; while(true){ for(ll i=0; i<m; i++) nxt[i]=0; for(ll i=0; i<m; i++) for(ll j : cand[i]) nxt[i] += r[i][j]*crt[j]; if(nxt[m-1]==0) break; ans += nxt[m-1]; swap(crt, nxt); } cout << ans << endl; }