結果
問題 | No.2299 Antitypoglycemia |
ユーザー | McGregorsh |
提出日時 | 2023-05-12 22:05:32 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 167 ms / 2,000 ms |
コード長 | 1,893 bytes |
コンパイル時間 | 159 ms |
コンパイル使用メモリ | 81,792 KB |
実行使用メモリ | 93,056 KB |
最終ジャッジ日時 | 2024-05-06 12:03:06 |
合計ジャッジ時間 | 5,740 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 148 ms
89,600 KB |
testcase_01 | AC | 144 ms
89,344 KB |
testcase_02 | AC | 145 ms
89,216 KB |
testcase_03 | AC | 153 ms
92,032 KB |
testcase_04 | AC | 154 ms
91,392 KB |
testcase_05 | AC | 149 ms
89,344 KB |
testcase_06 | AC | 153 ms
91,904 KB |
testcase_07 | AC | 148 ms
89,728 KB |
testcase_08 | AC | 150 ms
91,648 KB |
testcase_09 | AC | 146 ms
91,776 KB |
testcase_10 | AC | 143 ms
89,344 KB |
testcase_11 | AC | 143 ms
89,472 KB |
testcase_12 | AC | 158 ms
92,160 KB |
testcase_13 | AC | 148 ms
92,544 KB |
testcase_14 | AC | 153 ms
89,472 KB |
testcase_15 | AC | 153 ms
89,472 KB |
testcase_16 | AC | 161 ms
89,856 KB |
testcase_17 | AC | 158 ms
89,472 KB |
testcase_18 | AC | 166 ms
92,928 KB |
testcase_19 | AC | 166 ms
92,928 KB |
testcase_20 | AC | 164 ms
93,056 KB |
testcase_21 | AC | 163 ms
93,056 KB |
testcase_22 | AC | 167 ms
93,056 KB |
testcase_23 | AC | 146 ms
89,344 KB |
testcase_24 | AC | 152 ms
89,344 KB |
testcase_25 | AC | 146 ms
89,216 KB |
testcase_26 | AC | 142 ms
89,344 KB |
testcase_27 | AC | 140 ms
89,472 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): N, A, B = i_map() if N == 2: if A == B: print(0) else: print(1) exit() PP = [0] * (N+1) PP[1] = 1 for i in range(2, N+1): PP[i] = PP[i-1] * i PP[i] %= MOD2 # nPr(6, 4) 360 # nPr(6, 5) 720 Fiv = [0] * (N+1) Fiv[2] = 1 cou = 2 for i in range(3, N+1): Fiv[i] = Fiv[i-1] + cou Fiv[i] %= MOD2 cou += 2 cou %= MOD2 if A == B: print((N-2) * (N-1) * PP[N-2] % MOD2) else: print(Fiv[N] * PP[N-2] % MOD2) if __name__ == '__main__': main()