結果
問題 | No.1885 Flat Permutation |
ユーザー | U S |
提出日時 | 2022-03-25 23:47:21 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,539 bytes |
コンパイル時間 | 224 ms |
コンパイル使用メモリ | 82,240 KB |
実行使用メモリ | 81,684 KB |
最終ジャッジ日時 | 2024-04-22 08:50:57 |
合計ジャッジ時間 | 5,428 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 50 ms
62,252 KB |
testcase_01 | AC | 49 ms
62,252 KB |
testcase_02 | AC | 49 ms
60,980 KB |
testcase_03 | AC | 58 ms
67,972 KB |
testcase_04 | AC | 50 ms
61,536 KB |
testcase_05 | AC | 50 ms
61,360 KB |
testcase_06 | AC | 50 ms
61,544 KB |
testcase_07 | AC | 50 ms
63,292 KB |
testcase_08 | AC | 50 ms
62,812 KB |
testcase_09 | AC | 50 ms
61,420 KB |
testcase_10 | AC | 50 ms
62,624 KB |
testcase_11 | AC | 49 ms
62,732 KB |
testcase_12 | AC | 49 ms
61,528 KB |
testcase_13 | AC | 50 ms
61,460 KB |
testcase_14 | AC | 50 ms
62,796 KB |
testcase_15 | AC | 51 ms
62,452 KB |
testcase_16 | AC | 64 ms
77,328 KB |
testcase_17 | AC | 64 ms
78,836 KB |
testcase_18 | AC | 64 ms
78,372 KB |
testcase_19 | AC | 134 ms
81,128 KB |
testcase_20 | AC | 133 ms
79,824 KB |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | AC | 63 ms
77,476 KB |
testcase_24 | AC | 63 ms
78,136 KB |
testcase_25 | AC | 63 ms
77,124 KB |
testcase_26 | AC | 64 ms
78,976 KB |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | AC | 133 ms
79,864 KB |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | AC | 62 ms
77,624 KB |
testcase_33 | AC | 64 ms
78,156 KB |
testcase_34 | AC | 63 ms
77,452 KB |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | AC | 64 ms
78,412 KB |
testcase_38 | AC | 62 ms
75,700 KB |
testcase_39 | AC | 61 ms
76,108 KB |
testcase_40 | AC | 74 ms
74,504 KB |
testcase_41 | AC | 93 ms
77,556 KB |
testcase_42 | AC | 64 ms
71,760 KB |
testcase_43 | AC | 134 ms
80,440 KB |
testcase_44 | AC | 133 ms
80,184 KB |
testcase_45 | AC | 133 ms
80,972 KB |
testcase_46 | AC | 133 ms
81,184 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 def calc(step): u = cc(step) jump = 0 ans = 0 while step >= 0: bunsi = md[u-2*jump] bunbo = (md[u-3*jump]*md[jump]) ans += bunsi*pow(bunbo,mod-2,mod) step -= 3 jump += 1 ans %= mod #print(ans) print(ans) # jump = 1 # ans = 1 # now = 1 # while step >= 0: # bunsi = (step + 1) * (step + 2) * (step + 3) # bunbo = jump * (step + jump + 1) * (step + jump + 2) # now *= bunsi * pow(bunbo, mod - 2, mod) # now %= mod # ans += now # ans %= mod # step -= 3 # jump += 1 # print(ans % mod) n,x,y = mp() md = [1] for i in range(1,n+5): md.append(md[-1]*i%mod) if x > y:x,y = y,x if x != 1 and y != n: if y-x == 1: print(0) else: calc(y-1-(x+1)) else:calc(y-x)