結果
問題 | No.1885 Flat Permutation |
ユーザー | U S |
提出日時 | 2022-03-25 23:14:29 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,944 bytes |
コンパイル時間 | 332 ms |
コンパイル使用メモリ | 81,960 KB |
実行使用メモリ | 74,216 KB |
最終ジャッジ日時 | 2024-04-22 08:08:41 |
合計ジャッジ時間 | 5,012 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
62,312 KB |
testcase_01 | AC | 50 ms
61,320 KB |
testcase_02 | AC | 51 ms
62,196 KB |
testcase_03 | AC | 60 ms
66,880 KB |
testcase_04 | AC | 51 ms
62,288 KB |
testcase_05 | AC | 51 ms
61,820 KB |
testcase_06 | AC | 52 ms
61,684 KB |
testcase_07 | AC | 51 ms
61,980 KB |
testcase_08 | AC | 52 ms
62,676 KB |
testcase_09 | AC | 51 ms
61,764 KB |
testcase_10 | AC | 50 ms
61,724 KB |
testcase_11 | AC | 50 ms
61,696 KB |
testcase_12 | AC | 50 ms
61,824 KB |
testcase_13 | AC | 50 ms
61,476 KB |
testcase_14 | AC | 50 ms
61,852 KB |
testcase_15 | AC | 53 ms
61,356 KB |
testcase_16 | AC | 51 ms
62,272 KB |
testcase_17 | AC | 50 ms
62,212 KB |
testcase_18 | AC | 51 ms
62,120 KB |
testcase_19 | AC | 125 ms
73,120 KB |
testcase_20 | AC | 125 ms
73,484 KB |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | AC | 50 ms
62,136 KB |
testcase_24 | AC | 51 ms
61,396 KB |
testcase_25 | AC | 52 ms
62,668 KB |
testcase_26 | AC | 50 ms
61,112 KB |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | AC | 125 ms
73,844 KB |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | AC | 51 ms
61,368 KB |
testcase_33 | AC | 50 ms
61,760 KB |
testcase_34 | AC | 51 ms
62,052 KB |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | AC | 51 ms
62,168 KB |
testcase_38 | AC | 51 ms
61,904 KB |
testcase_39 | AC | 51 ms
62,388 KB |
testcase_40 | AC | 68 ms
67,228 KB |
testcase_41 | AC | 86 ms
69,072 KB |
testcase_42 | AC | 61 ms
66,300 KB |
testcase_43 | AC | 125 ms
73,104 KB |
testcase_44 | AC | 128 ms
73,948 KB |
testcase_45 | AC | 125 ms
72,772 KB |
testcase_46 | AC | 127 ms
74,044 KB |
ソースコード
# import sys # input = sys.stdin.readline # import pypyjit # pypyjit.set_param('max_unroll_recursion=-1') def mp():return map(int,input().split()) def lmp():return list(map(int,input().split())) def mps(A):return [tuple(map(int, input().split())) for _ in range(A)] def stoi(LIST):return list(map(int,LIST)) def itos(LIST):return list(map(str,LIST)) def bitA(X,A):return X & 1<<A == 1<<A import math import bisect import heapq import time from copy import copy as cc from copy import deepcopy as dc from itertools import accumulate, product from collections import Counter, defaultdict, deque def ceil(U,V):return (U+V-1)//V def modf1(N,MOD):return (N-1)%MOD+1 inf = int(1e18+20) mod = 998244353 n,x,y = mp() if x > y:x,y = y,x if x != 1 and y != n: if y-x == 1: print(0) else: step = y - 1 - (x+1) - 3 jump = 1 ans = 1 now = 1 while step >= 0: bunsi = (step+1) * (step+2)* (step+3)% mod bunbo = jump * (step+jump+1)*(step+jump+2)% mod now *= bunsi*pow(bunbo,mod-2,mod) now %= mod ans += now ans %= mod step -= 3 jump += 1 print(ans % mod) elif x == 1: step = y-1-3 jump = 1 ans = 1 now = 1 while step >= 0: bunsi = (step + 1) * (step + 2) * (step + 3)% mod bunbo = jump * (step + jump + 1) * (step + jump + 2)% mod now *= bunsi * pow(bunbo, mod - 2, mod) now %= mod ans += now ans %= mod step -= 3 jump += 1 print(ans % mod) else: step = n-x-3 jump = 1 ans = 1 now = 1 while step >= 0: bunsi = (step + 1) * (step + 2) * (step + 3)% mod bunbo = jump * (step + jump + 1) * (step + jump + 2)% mod now *= bunsi * pow(bunbo, mod - 2, mod) now %= mod ans += now ans %= mod step -= 3 jump += 1 print(ans % mod)