結果
問題 | No.2318 Phys Bone Maker |
ユーザー | cleantted |
提出日時 | 2023-02-26 03:08:47 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,748 ms / 3,000 ms |
コード長 | 1,974 bytes |
コンパイル時間 | 202 ms |
コンパイル使用メモリ | 82,060 KB |
実行使用メモリ | 94,128 KB |
最終ジャッジ日時 | 2023-10-18 16:58:15 |
合計ジャッジ時間 | 28,130 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 158 ms
91,108 KB |
testcase_01 | AC | 160 ms
91,100 KB |
testcase_02 | AC | 2,403 ms
94,044 KB |
testcase_03 | AC | 169 ms
91,488 KB |
testcase_04 | AC | 170 ms
91,288 KB |
testcase_05 | AC | 169 ms
91,300 KB |
testcase_06 | AC | 170 ms
91,292 KB |
testcase_07 | AC | 171 ms
92,004 KB |
testcase_08 | AC | 179 ms
92,004 KB |
testcase_09 | AC | 170 ms
91,292 KB |
testcase_10 | AC | 174 ms
91,292 KB |
testcase_11 | AC | 173 ms
91,488 KB |
testcase_12 | AC | 183 ms
92,004 KB |
testcase_13 | AC | 184 ms
92,000 KB |
testcase_14 | AC | 174 ms
91,288 KB |
testcase_15 | AC | 168 ms
91,300 KB |
testcase_16 | AC | 169 ms
91,288 KB |
testcase_17 | AC | 176 ms
91,612 KB |
testcase_18 | AC | 184 ms
91,996 KB |
testcase_19 | AC | 165 ms
91,292 KB |
testcase_20 | AC | 174 ms
91,296 KB |
testcase_21 | AC | 170 ms
91,300 KB |
testcase_22 | AC | 173 ms
91,924 KB |
testcase_23 | AC | 168 ms
91,300 KB |
testcase_24 | AC | 173 ms
91,300 KB |
testcase_25 | AC | 174 ms
91,296 KB |
testcase_26 | AC | 184 ms
91,996 KB |
testcase_27 | AC | 173 ms
91,292 KB |
testcase_28 | AC | 169 ms
91,300 KB |
testcase_29 | AC | 168 ms
91,300 KB |
testcase_30 | AC | 166 ms
91,292 KB |
testcase_31 | AC | 177 ms
91,872 KB |
testcase_32 | AC | 177 ms
91,292 KB |
testcase_33 | AC | 160 ms
91,112 KB |
testcase_34 | AC | 174 ms
91,292 KB |
testcase_35 | AC | 440 ms
92,976 KB |
testcase_36 | AC | 1,763 ms
93,532 KB |
testcase_37 | AC | 1,353 ms
93,624 KB |
testcase_38 | AC | 1,539 ms
93,536 KB |
testcase_39 | AC | 2,444 ms
93,876 KB |
testcase_40 | AC | 2,001 ms
93,952 KB |
testcase_41 | AC | 2,748 ms
94,032 KB |
testcase_42 | AC | 2,202 ms
93,976 KB |
testcase_43 | AC | 185 ms
92,004 KB |
testcase_44 | AC | 345 ms
92,488 KB |
testcase_45 | AC | 336 ms
92,488 KB |
testcase_46 | AC | 2,514 ms
94,128 KB |
testcase_47 | AC | 173 ms
91,300 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 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()) K = len(T) X = {} V = set() def f(s, S): if len(S) == K: 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 k in range(K): x1, x2 = X[i][k], X[j][k] 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()