#899792 (C++17) No.2318 Phys Bone Maker

• 問題: No.2318 Phys Bone Maker
• ユーザー: akiaa11
• 提出日時: 2023-08-09 14:28:33
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,116 ms / 3,000 ms
• コード長: 3,641 bytes
• コンパイル時間: 4,418 ms
• コンパイル使用メモリ: 267,356 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-11-15 10:18:29
• 合計ジャッジ時間: 13,950 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,820 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	1,116 ms; 5,248 KB
testcase_03	AC	6 ms; 5,248 KB
testcase_04	AC	9 ms; 5,248 KB
testcase_05	AC	8 ms; 5,248 KB
testcase_06	AC	8 ms; 5,248 KB
testcase_07	AC	3 ms; 5,248 KB
testcase_08	AC	8 ms; 5,248 KB
testcase_09	AC	8 ms; 5,248 KB
testcase_10	AC	12 ms; 5,248 KB
testcase_11	AC	9 ms; 5,248 KB
testcase_12	AC	13 ms; 5,248 KB
testcase_13	AC	12 ms; 5,248 KB
testcase_14	AC	10 ms; 5,248 KB
testcase_15	AC	8 ms; 5,248 KB
testcase_16	AC	11 ms; 5,248 KB
testcase_17	AC	12 ms; 5,248 KB
testcase_18	AC	12 ms; 5,248 KB
testcase_19	AC	5 ms; 5,248 KB
testcase_20	AC	10 ms; 5,248 KB
testcase_21	AC	8 ms; 5,248 KB
testcase_22	AC	7 ms; 5,248 KB
testcase_23	AC	9 ms; 5,248 KB
testcase_24	AC	10 ms; 5,248 KB
testcase_25	AC	11 ms; 5,248 KB
testcase_26	AC	10 ms; 5,248 KB
testcase_27	AC	11 ms; 5,248 KB
testcase_28	AC	7 ms; 5,248 KB
testcase_29	AC	7 ms; 5,248 KB
testcase_30	AC	8 ms; 5,248 KB
testcase_31	AC	13 ms; 5,248 KB
testcase_32	AC	15 ms; 5,248 KB
testcase_33	AC	2 ms; 5,248 KB
testcase_34	AC	10 ms; 5,248 KB
testcase_35	AC	97 ms; 5,248 KB
testcase_36	AC	458 ms; 5,248 KB
testcase_37	AC	502 ms; 5,248 KB
testcase_38	AC	552 ms; 5,248 KB
testcase_39	AC	710 ms; 5,248 KB
testcase_40	AC	772 ms; 5,248 KB
testcase_41	AC	840 ms; 5,248 KB
testcase_42	AC	921 ms; 5,248 KB
testcase_43	AC	16 ms; 5,248 KB
testcase_44	AC	236 ms; 5,248 KB
testcase_45	AC	211 ms; 5,248 KB
testcase_46	AC	1,044 ms; 5,248 KB
testcase_47	AC	23 ms; 5,248 KB

ソースコード

#include <bits/stdc++.h>
#include <atcoder/all>
#define SELECTER(_1,_2,_3,SELECT,...) SELECT
#define rep1(i,n) for(int i=0;i<(int)n;++i)
#define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i)
#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT
#define rrep1(i,n) for(int i=(int)n-1;i>=0;--i)
#define rrep2(i,a,n) for(int i=(int)n-1;i>=(int)a;--i)
#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define PrintR LogOutput
#ifdef _DEBUG
#define Log(...) LogOutput(__VA_ARGS__)
#else
#define Log(...)
#endif
using namespace std;
using namespace atcoder;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
using pdd=pair<long double,long double>;
using veci=vector<int>;
using vecpii=vector<pair<int,int>>;
using vecll=vector<long long>;
using vecpll=vector<pair<long long,long long>>;
using vecpdd=vector<pair<long double,long double>>;
using vecs=vector<string>;
using vecb=vector<bool>;
using vecd=vector<double>;
using tp=tuple<int,int,int>;
using tpll=tuple<ll,ll,ll>;
using mint=modint998244353;
using mint10=modint1000000007;
template<typename T, typename S>
istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}
template<typename T, typename S>
ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}
ostream& operator<<(ostream& out, const mint& a){return out << a.val();}
ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}
ostream& operator<<(ostream& out, const modint& a){return out << a.val();}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}
template<typename T, typename S>
pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}
template<typename T, typename S>
pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}
template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}
template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}
bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}

constexpr ll INF=numeric_limits<ll>::max() / 4;
constexpr ll MOD=998244353;
const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};

template<typename... Args>
void LogOutput(Args&&... args){
	stringstream ss;
	((ss << args << ' '), ...);
	cout << ss.str().substr(0, ss.str().length() - 1) << endl;
}
template<typename T>
void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	ll n;cin>>n;
	vecll p;
	{
		ll m = n;
		for(ll i = 2; i * i <= m ; ++i){
			int cnt = 0;
			while(m % i == 0) m /= i, cnt++;
			if(cnt) p.push_back(i);
		}
		if(m != 1) p.push_back(m);
	}
	vecll a;
	for(ll i = 1; i * i <= n; ++i) if(n % i == 0){
		a.push_back(i);
		if(i * i != n) a.push_back(n / i);
	}
	sort(all(a));
	int m = a.size();
	vector<mint> dp(m + 1, 0);
	dp[0] = 1;
	veci c(p.size());
	rep(i, m){
		ll d = a[i];
		rep(j, p.size()){
			int cnt = 0;
			while(d % p[j] == 0) d /= p[j], cnt++;
			c[j] = cnt;
		}
		rep(j, i + 1, m) if(a[j] % a[i] == 0){
			d = a[j];
			mint res = 1;
			rep(k, p.size()){
				int cnt = 0;
				while(d % p[k] == 0) d /= p[k], cnt++;
				if(c[k] == cnt) res *= (cnt + 1);
			}
			dp[j] += dp[i] * res;
		}
	}
	cout<<dp[m - 1]<<endl;
}