結果
問題 | No.1138 No Bingo! |
ユーザー | vwxyz |
提出日時 | 2021-09-16 18:05:59 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 337 ms / 3,000 ms |
コード長 | 3,170 bytes |
コンパイル時間 | 583 ms |
コンパイル使用メモリ | 11,188 KB |
実行使用メモリ | 43,368 KB |
最終ジャッジ日時 | 2023-09-12 01:22:34 |
合計ジャッジ時間 | 7,003 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 34 ms
10,608 KB |
testcase_01 | AC | 33 ms
10,704 KB |
testcase_02 | AC | 33 ms
10,676 KB |
testcase_03 | AC | 188 ms
27,112 KB |
testcase_04 | AC | 337 ms
43,368 KB |
testcase_05 | AC | 34 ms
10,564 KB |
testcase_06 | AC | 34 ms
10,696 KB |
testcase_07 | AC | 34 ms
10,764 KB |
testcase_08 | AC | 34 ms
10,764 KB |
testcase_09 | AC | 212 ms
29,484 KB |
testcase_10 | AC | 307 ms
39,956 KB |
testcase_11 | AC | 331 ms
42,876 KB |
testcase_12 | AC | 128 ms
21,060 KB |
testcase_13 | AC | 51 ms
12,440 KB |
testcase_14 | AC | 325 ms
42,284 KB |
testcase_15 | AC | 159 ms
24,060 KB |
testcase_16 | AC | 304 ms
39,852 KB |
testcase_17 | AC | 297 ms
38,924 KB |
testcase_18 | AC | 287 ms
37,892 KB |
testcase_19 | AC | 222 ms
30,320 KB |
testcase_20 | AC | 310 ms
39,752 KB |
testcase_21 | AC | 289 ms
37,896 KB |
testcase_22 | AC | 271 ms
36,236 KB |
testcase_23 | AC | 41 ms
11,488 KB |
testcase_24 | AC | 200 ms
28,936 KB |
testcase_25 | AC | 139 ms
22,168 KB |
testcase_26 | AC | 128 ms
20,536 KB |
testcase_27 | AC | 184 ms
26,992 KB |
testcase_28 | AC | 122 ms
20,312 KB |
testcase_29 | AC | 121 ms
20,220 KB |
ソースコード
import bisect import copy import decimal import fractions import functools import heapq import itertools import math import random import sys from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import degrees, gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines def Extended_Euclid(n,m): stack=[] while m: stack.append((n,m)) n,m=m,n%m if n>=0: x,y=1,0 else: x,y=-1,0 for i in range(len(stack)-1,-1,-1): n,m=stack[i] x,y=y,x-(n//m)*y return x,y class MOD: def __init__(self,p,e=1): self.p=p self.e=e self.mod=self.p**self.e def Pow(self,a,n): a%=self.mod if n>=0: return pow(a,n,self.mod) else: assert math.gcd(a,self.mod)==1 x=Extended_Euclid(a,self.mod)[0] return pow(x,-n,self.mod) def Build_Fact(self,N): assert N>=0 self.factorial=[1] self.cnt=[0]*(N+1) for i in range(1,N+1): ii=i self.cnt[i]=self.cnt[i-1] while ii%self.p==0: ii//=self.p self.cnt[i]+=1 self.factorial.append((self.factorial[-1]*ii)%self.mod) self.factorial_inve=[None]*(N+1) self.factorial_inve[-1]=self.Pow(self.factorial[-1],-1) for i in range(N-1,-1,-1): ii=i+1 while ii%self.p==0: ii//=self.p self.factorial_inve[i]=(self.factorial_inve[i+1]*ii)%self.mod def Fact(self,N): if N<0: return 0 return self.factorial[N]*pow(self.p,self.cnt[N],self.mod)%self.mod def Fact_Inve(self,N): if self.cnt[N]: return None return self.factorial_inve[N] def Comb(self,N,K,divisible_count=False): if K<0 or K>N: return 0 retu=self.factorial[N]*self.factorial_inve[K]*self.factorial_inve[N-K]%self.mod cnt=self.cnt[N]-self.cnt[N-K]-self.cnt[K] if divisible_count: return retu,cnt else: retu*=pow(self.p,cnt,self.mod) retu%=self.mod return retu def Montmort_Numbers(N,mod=0): montmort_numbers=[0]*(N+1) if N>=2: montmort_numbers[2]=1 for i in range(3,N+1): montmort_numbers[i]=(i-1)*(montmort_numbers[i-1]+montmort_numbers[i-2]) if mod: montmort_numbers[i]%=mod return montmort_numbers N=int(readline()) mod=998244353 MD=MOD(mod) MD.Build_Fact(N) A=[0]*(N+1) A[0]=1 for i in range(4,N+1): if i%2==0: A[i]=((i-1)*A[i-1]+2*(i-2)*A[i-4])%mod else: A[i]=((i-1)*A[i-1]+2*(i-1)*A[i-2])%mod M=Montmort_Numbers(N,mod) ans=MD.Fact(N)-2*M[N]+A[N] ans%=mod print(ans)