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

• 問題: No.2318 Phys Bone Maker
• ユーザー: Carpenters-Cat
• 提出日時: 2023-05-30 14:21:24
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,544 ms / 3,000 ms
• コード長: 1,800 bytes
• コンパイル時間: 2,382 ms
• コンパイル使用メモリ: 214,612 KB
• 実行使用メモリ: 4,744 KB
• 最終ジャッジ日時: 2023-08-28 00:36:24
• 合計ジャッジ時間: 17,295 ms
• ジャッジサーバーID （参考情報）: judge11 / judge13

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,380 KB
testcase_01	AC	2 ms; 4,376 KB
testcase_02	AC	1,544 ms; 4,572 KB
testcase_03	AC	18 ms; 4,380 KB
testcase_04	AC	31 ms; 4,376 KB
testcase_05	AC	16 ms; 4,376 KB
testcase_06	AC	21 ms; 4,376 KB
testcase_07	AC	7 ms; 4,376 KB
testcase_08	AC	33 ms; 4,376 KB
testcase_09	AC	22 ms; 4,376 KB
testcase_10	AC	51 ms; 4,376 KB
testcase_11	AC	57 ms; 4,376 KB
testcase_12	AC	98 ms; 4,380 KB
testcase_13	AC	70 ms; 4,380 KB
testcase_14	AC	36 ms; 4,380 KB
testcase_15	AC	34 ms; 4,376 KB
testcase_16	AC	24 ms; 4,376 KB
testcase_17	AC	36 ms; 4,380 KB
testcase_18	AC	87 ms; 4,380 KB
testcase_19	AC	15 ms; 4,376 KB
testcase_20	AC	29 ms; 4,376 KB
testcase_21	AC	21 ms; 4,376 KB
testcase_22	AC	17 ms; 4,384 KB
testcase_23	AC	21 ms; 4,376 KB
testcase_24	AC	40 ms; 4,376 KB
testcase_25	AC	42 ms; 4,376 KB
testcase_26	AC	37 ms; 4,376 KB
testcase_27	AC	24 ms; 4,376 KB
testcase_28	AC	18 ms; 4,376 KB
testcase_29	AC	15 ms; 4,376 KB
testcase_30	AC	15 ms; 4,380 KB
testcase_31	AC	61 ms; 4,376 KB
testcase_32	AC	32 ms; 4,380 KB
testcase_33	AC	2 ms; 4,380 KB
testcase_34	AC	35 ms; 4,380 KB
testcase_35	AC	245 ms; 4,380 KB
testcase_36	AC	789 ms; 4,376 KB
testcase_37	AC	784 ms; 4,376 KB
testcase_38	AC	866 ms; 4,380 KB
testcase_39	AC	1,112 ms; 4,744 KB
testcase_40	AC	1,069 ms; 4,412 KB
testcase_41	AC	1,312 ms; 4,604 KB
testcase_42	AC	1,272 ms; 4,392 KB
testcase_43	AC	76 ms; 4,376 KB
testcase_44	AC	327 ms; 4,376 KB
testcase_45	AC	302 ms; 4,380 KB
testcase_46	AC	1,306 ms; 4,504 KB
testcase_47	AC	32 ms; 4,380 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
unordered_map<ll, ll> mp, mp_cn;
unordered_map<ll, vector<ll>> ss_cnt;
std::vector<ll> sosu;
ll m = 998244353;
ll cnt_yk(ll a){
	if (mp_cn.find(a) != mp_cn.end()) {
		return mp_cn[a];
	}
	if (a == 1) {
		return mp_cn[a] = 1;
	}
	mp_cn[a] = 0;
	for (ll i = 1; i * i <= a; i ++) {
		if (a % i == 0) {
			mp_cn[a] ++;
			if (i * i < a) {
				mp_cn[a] ++;
			}
		}
	}
	return mp_cn[a];
}
ll calc(ll a) {
	if (mp.find(a) != mp.end()) {
		return mp[a];
	}
	mp[a] = 0;
	for (ll i = 1; i * i <= a; i ++) {
		if (a % i == 0) {
			ll kj = calc(i);
			for (int j = 0; j < sosu.size(); j ++) {
				if (ss_cnt[i][j] == ss_cnt[a][j]) {
					kj *= (ss_cnt[a][j] + 1);
					kj %= m;
				}
			}
			mp[a] += kj;
			if (i * i < a && i > 1) {
				ll b = a / i;
				ll kj = calc(b);
				for (int j = 0; j < sosu.size(); j ++) {
					if (ss_cnt[b][j] == ss_cnt[a][j]) {
						kj *= (ss_cnt[a][j] + 1);
						kj %= m;
					}
				}
				mp[a] += kj;
			}
			mp[a] %= m;
		}
	}
	return mp[a];
}
int main() {
	ll N;
	cin >> N;
	mp[1] = 1;
	ll n = N;
	for (ll i = 2; i * i <= N; i ++) {
		if (n < i) break;
		if (n % i == 0) {
			sosu.push_back(i);
			while (n % i == 0) {
				n /= i;
			}
		}
	}
	if (n > 1) {
		sosu.push_back(n);
	}
	for (ll i = 1; i * i <= N; i ++) {
		if (N % i == 0) {
			ss_cnt[i] = sosu;
			ll j = i;
			for (int p = 0; p < sosu.size(); p ++) {
				ss_cnt[i][p] = 0;
				ll q = sosu[p];
				while (j % q == 0) {
					ss_cnt[i][p] ++;
					j /= q;
				}
			}
			if (i * i < N) {
				ll a = N / i;
				ss_cnt[a] = sosu;
				ll j = a;
				for (int p = 0; p < sosu.size(); p ++) {
					ss_cnt[a][p] = 0;
					ll q = sosu[p];
					while (j % q == 0) {
						ss_cnt[a][p] ++;
						j /= q;
					}
				}
			}
		}
	}
	cout << calc(N) << endl;
}