結果
問題 | No.2045 Two Reflections |
ユーザー | neterukun |
提出日時 | 2022-08-19 22:18:21 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 102 ms / 2,000 ms |
コード長 | 1,804 bytes |
コンパイル時間 | 352 ms |
コンパイル使用メモリ | 82,048 KB |
実行使用メモリ | 91,136 KB |
最終ジャッジ日時 | 2024-04-17 00:59:19 |
合計ジャッジ時間 | 3,338 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
52,480 KB |
testcase_01 | AC | 47 ms
52,480 KB |
testcase_02 | AC | 87 ms
82,816 KB |
testcase_03 | AC | 88 ms
80,384 KB |
testcase_04 | AC | 102 ms
85,504 KB |
testcase_05 | AC | 48 ms
52,096 KB |
testcase_06 | AC | 48 ms
52,224 KB |
testcase_07 | AC | 95 ms
83,968 KB |
testcase_08 | AC | 102 ms
85,504 KB |
testcase_09 | AC | 47 ms
52,352 KB |
testcase_10 | AC | 46 ms
52,096 KB |
testcase_11 | AC | 75 ms
68,096 KB |
testcase_12 | AC | 46 ms
52,480 KB |
testcase_13 | AC | 48 ms
52,352 KB |
testcase_14 | AC | 48 ms
52,480 KB |
testcase_15 | AC | 47 ms
52,608 KB |
testcase_16 | AC | 47 ms
52,608 KB |
testcase_17 | AC | 48 ms
52,352 KB |
testcase_18 | AC | 45 ms
52,608 KB |
testcase_19 | AC | 45 ms
52,736 KB |
testcase_20 | AC | 92 ms
91,136 KB |
testcase_21 | AC | 87 ms
83,328 KB |
testcase_22 | AC | 88 ms
83,840 KB |
testcase_23 | AC | 89 ms
83,584 KB |
testcase_24 | AC | 90 ms
83,328 KB |
testcase_25 | AC | 87 ms
83,200 KB |
testcase_26 | AC | 82 ms
82,944 KB |
testcase_27 | AC | 84 ms
82,944 KB |
testcase_28 | AC | 87 ms
82,688 KB |
testcase_29 | AC | 86 ms
82,688 KB |
ソースコード
def gcd(a, b): while b: a, b = b, a % b return a def lcm(a, b): return (a * b) // gcd(a, b) def all_gcd(array): n = len(array) ans = array[0] for i in range(1, n): ans = gcd(ans, array[i]) return ans def all_lcm_int(array): ans = array[0] for i in range(1, len(array)): ans = (ans * array[i]) // gcd(ans, array[i]) return ans def all_lcm_dict(array): primes = {} for num in array: for k in range(2, int(num ** 0.5) + 1): cnt = 0 while num % k == 0: cnt += 1 num //= k if cnt != 0: if k not in primes: primes[k] = cnt else: primes[k] = max(cnt, primes[k]) if num != 1: if num not in primes: primes[num] = 1 return primes n, p, q = map(int, input().split()) MOD = 998244353 if n == 1: print(1) exit() if p + q <= n: if p == 1 and q == 1: print(1) elif p == 1: print(2) elif q == 1: print(2) else: print(4) exit() if p == 1: print(2) exit() if q == 1: print(2) exit() a = [i for i in range(n)] b = [i for i in range(n)] b[0:p] = b[0:p][::-1] b[n - q:n] = b[n - q:n][::-1] nxt_pos = {} for i in range(n): nxt_pos[b[i]] = i visited = [False] * n ans = 2 ptns = [] for i in range(n): if visited[i]: continue visited[i] = True ptn = 1 while True: nxt_i = nxt_pos[i] if visited[nxt_i]: break visited[nxt_i] = True i = nxt_i ptn += 1 ptns.append(ptn) lcms = all_lcm_dict(ptns) for p in lcms: cnt = lcms[p] ans *= pow(p, cnt, MOD) ans %= MOD print(ans)