結果
問題 | No.1321 塗るめた |
ユーザー | vwxyz |
提出日時 | 2021-09-15 01:38:43 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 440 ms / 2,000 ms |
コード長 | 2,801 bytes |
コンパイル時間 | 281 ms |
コンパイル使用メモリ | 11,160 KB |
実行使用メモリ | 19,360 KB |
最終ジャッジ日時 | 2023-09-10 04:48:51 |
合計ジャッジ時間 | 14,303 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 35 ms
10,640 KB |
testcase_01 | AC | 44 ms
10,852 KB |
testcase_02 | AC | 35 ms
10,548 KB |
testcase_03 | AC | 35 ms
10,548 KB |
testcase_04 | AC | 34 ms
10,632 KB |
testcase_05 | AC | 34 ms
10,580 KB |
testcase_06 | AC | 34 ms
10,536 KB |
testcase_07 | AC | 35 ms
10,548 KB |
testcase_08 | AC | 34 ms
10,620 KB |
testcase_09 | AC | 35 ms
10,660 KB |
testcase_10 | AC | 34 ms
10,752 KB |
testcase_11 | AC | 35 ms
10,496 KB |
testcase_12 | AC | 266 ms
15,692 KB |
testcase_13 | AC | 362 ms
17,648 KB |
testcase_14 | AC | 159 ms
13,468 KB |
testcase_15 | AC | 200 ms
14,696 KB |
testcase_16 | AC | 285 ms
16,072 KB |
testcase_17 | AC | 42 ms
10,736 KB |
testcase_18 | AC | 394 ms
18,928 KB |
testcase_19 | AC | 136 ms
13,392 KB |
testcase_20 | AC | 188 ms
13,968 KB |
testcase_21 | AC | 351 ms
18,096 KB |
testcase_22 | AC | 414 ms
19,292 KB |
testcase_23 | AC | 402 ms
19,224 KB |
testcase_24 | AC | 396 ms
19,256 KB |
testcase_25 | AC | 393 ms
19,224 KB |
testcase_26 | AC | 398 ms
19,264 KB |
testcase_27 | AC | 426 ms
19,360 KB |
testcase_28 | AC | 405 ms
19,304 KB |
testcase_29 | AC | 423 ms
19,232 KB |
testcase_30 | AC | 383 ms
19,224 KB |
testcase_31 | AC | 440 ms
19,216 KB |
testcase_32 | AC | 263 ms
15,700 KB |
testcase_33 | AC | 161 ms
13,652 KB |
testcase_34 | AC | 250 ms
15,788 KB |
testcase_35 | AC | 159 ms
13,612 KB |
testcase_36 | AC | 428 ms
19,216 KB |
testcase_37 | AC | 436 ms
19,212 KB |
testcase_38 | AC | 421 ms
19,196 KB |
testcase_39 | AC | 435 ms
19,300 KB |
testcase_40 | AC | 404 ms
19,256 KB |
testcase_41 | AC | 435 ms
19,220 KB |
testcase_42 | AC | 35 ms
10,608 KB |
testcase_43 | AC | 263 ms
15,776 KB |
testcase_44 | AC | 164 ms
13,704 KB |
testcase_45 | AC | 251 ms
15,696 KB |
testcase_46 | AC | 86 ms
11,628 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): 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 N,M,K=map(int,readline().split()) mod=998244353 MD=MOD(mod) MD.Build_Fact(N) ans=0 K=M-K for k in range(N+1): if K%2==k%2: ans+=MD.Comb(M,k)*pow(2*M-k,N,mod)*MD.Comb(k,K) else: ans-=MD.Comb(M,k)*pow(2*M-k,N,mod)*MD.Comb(k,K) ans%=mod print(ans)