結果
問題 | No.2318 Phys Bone Maker |
ユーザー | 👑 amentorimaru |
提出日時 | 2023-02-26 03:08:21 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,983 ms / 3,000 ms |
コード長 | 2,031 bytes |
コンパイル時間 | 150 ms |
コンパイル使用メモリ | 82,064 KB |
実行使用メモリ | 93,676 KB |
最終ジャッジ日時 | 2023-10-18 16:57:33 |
合計ジャッジ時間 | 27,526 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 160 ms
91,100 KB |
testcase_01 | AC | 160 ms
91,104 KB |
testcase_02 | AC | 2,893 ms
93,676 KB |
testcase_03 | AC | 171 ms
91,484 KB |
testcase_04 | AC | 170 ms
91,284 KB |
testcase_05 | AC | 172 ms
91,288 KB |
testcase_06 | AC | 169 ms
91,288 KB |
testcase_07 | AC | 172 ms
91,996 KB |
testcase_08 | AC | 177 ms
91,996 KB |
testcase_09 | AC | 168 ms
91,292 KB |
testcase_10 | AC | 174 ms
91,292 KB |
testcase_11 | AC | 176 ms
91,488 KB |
testcase_12 | AC | 184 ms
91,992 KB |
testcase_13 | AC | 185 ms
92,000 KB |
testcase_14 | AC | 170 ms
91,292 KB |
testcase_15 | AC | 169 ms
91,284 KB |
testcase_16 | AC | 171 ms
91,288 KB |
testcase_17 | AC | 176 ms
91,608 KB |
testcase_18 | AC | 186 ms
92,000 KB |
testcase_19 | AC | 169 ms
91,288 KB |
testcase_20 | AC | 173 ms
91,292 KB |
testcase_21 | AC | 171 ms
91,292 KB |
testcase_22 | AC | 172 ms
91,916 KB |
testcase_23 | AC | 167 ms
91,288 KB |
testcase_24 | AC | 173 ms
91,288 KB |
testcase_25 | AC | 171 ms
91,292 KB |
testcase_26 | AC | 184 ms
91,992 KB |
testcase_27 | AC | 175 ms
91,288 KB |
testcase_28 | AC | 169 ms
91,288 KB |
testcase_29 | AC | 168 ms
91,288 KB |
testcase_30 | AC | 167 ms
91,292 KB |
testcase_31 | AC | 178 ms
91,868 KB |
testcase_32 | AC | 174 ms
91,292 KB |
testcase_33 | AC | 162 ms
91,104 KB |
testcase_34 | AC | 176 ms
91,292 KB |
testcase_35 | AC | 417 ms
92,656 KB |
testcase_36 | AC | 1,499 ms
93,156 KB |
testcase_37 | AC | 1,153 ms
93,076 KB |
testcase_38 | AC | 1,350 ms
93,104 KB |
testcase_39 | AC | 2,103 ms
93,424 KB |
testcase_40 | AC | 1,677 ms
93,392 KB |
testcase_41 | AC | 2,983 ms
93,648 KB |
testcase_42 | AC | 2,409 ms
93,588 KB |
testcase_43 | AC | 190 ms
92,000 KB |
testcase_44 | AC | 346 ms
92,440 KB |
testcase_45 | AC | 332 ms
92,428 KB |
testcase_46 | AC | 2,132 ms
93,392 KB |
testcase_47 | AC | 175 ms
91,292 KB |
ソースコード
import sys from collections import deque, Counter from math import gcd, log10, pi, sqrt, ceil from bisect import bisect, bisect_left, bisect_right, insort from typing import Iterable, TypeVar, Union, Tuple, Iterator, List import copy import heapq import itertools import math import random from fractions import Fraction from functools import lru_cache, partial, cmp_to_key import operator import pypyjit pypyjit.set_param('max_unroll_recursion=-1') input = sys.stdin.readline sys.setrecursionlimit(10000000) mod = 998244353 INF = 1 << 61 DIFF = 10 ** -9 DX = [1, 0, -1, 0, 1, 1, -1, -1] DY = [0, 1, 0, -1, 1, -1, 1, -1] def read_values(): return map(int, input().split()) def read_index(): return map(lambda x: int(x) - 1, input().split()) def read_list(): return list(read_values()) def read_lists(N): return [read_list() for _ in range(N)] def main(): N = int(input()) T = {} for n in range(2, int(N ** 0.5) + 1): while N % n == 0: T[n] = T.get(n, 0) + 1 N //= n if N > 1: T[N] = T.get(N, 0) + 1 T = list(T.items()) X = {} V = set() def f(s, S): if len(S) == len(T): V.add(s) X[s] = (tuple(S)) return k, v = T[len(S)] S.append(0) for _ in range(v + 1): f(s, S) s *= k S[-1] += 1 S.pop() s //= k ** v f(1, []) N = len(V) V = sorted(list(V)) X = [X[v] for v in V] dp = [0] * N dp[0] = 1 for i in range(N): for j in range(i + 1, N): r = 1 for ii in range(len(X[i])): x1,x2=X[i][ii],X[j][ii] if x2 > x1: continue elif x2 == x1: r *= x1 + 1 r %= mod else: break else: dp[j] += dp[i] * r % mod dp[j] %= mod print(dp[-1]) if __name__ == "__main__": main()