結果

問題 No.1885 Flat Permutation
ユーザー U S
提出日時 2022-03-25 23:14:29
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 1,944 bytes
コンパイル時間 218 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 72,960 KB
最終ジャッジ日時 2024-10-14 07:22:25
合計ジャッジ時間 5,092 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 35 WA * 8
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

# 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)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0