結果
問題 | No.1321 塗るめた |
ユーザー | vwxyz |
提出日時 | 2021-09-15 01:39:11 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 411 ms / 2,000 ms |
コード長 | 2,801 bytes |
コンパイル時間 | 509 ms |
コンパイル使用メモリ | 87,376 KB |
実行使用メモリ | 112,068 KB |
最終ジャッジ日時 | 2023-09-10 04:51:34 |
合計ジャッジ時間 | 18,676 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 256 ms
91,160 KB |
testcase_01 | AC | 286 ms
95,172 KB |
testcase_02 | AC | 261 ms
91,388 KB |
testcase_03 | AC | 256 ms
91,384 KB |
testcase_04 | AC | 257 ms
91,248 KB |
testcase_05 | AC | 260 ms
91,432 KB |
testcase_06 | AC | 255 ms
91,148 KB |
testcase_07 | AC | 259 ms
91,452 KB |
testcase_08 | AC | 253 ms
91,252 KB |
testcase_09 | AC | 261 ms
91,448 KB |
testcase_10 | AC | 262 ms
91,600 KB |
testcase_11 | AC | 255 ms
91,216 KB |
testcase_12 | AC | 364 ms
103,000 KB |
testcase_13 | AC | 388 ms
110,224 KB |
testcase_14 | AC | 323 ms
97,728 KB |
testcase_15 | AC | 352 ms
102,636 KB |
testcase_16 | AC | 362 ms
101,340 KB |
testcase_17 | AC | 289 ms
94,796 KB |
testcase_18 | AC | 366 ms
104,960 KB |
testcase_19 | AC | 313 ms
97,000 KB |
testcase_20 | AC | 354 ms
98,856 KB |
testcase_21 | AC | 395 ms
109,160 KB |
testcase_22 | AC | 400 ms
108,096 KB |
testcase_23 | AC | 397 ms
106,976 KB |
testcase_24 | AC | 393 ms
109,364 KB |
testcase_25 | AC | 372 ms
108,568 KB |
testcase_26 | AC | 390 ms
107,232 KB |
testcase_27 | AC | 400 ms
108,904 KB |
testcase_28 | AC | 400 ms
108,592 KB |
testcase_29 | AC | 395 ms
110,748 KB |
testcase_30 | AC | 342 ms
104,100 KB |
testcase_31 | AC | 411 ms
112,068 KB |
testcase_32 | AC | 342 ms
102,120 KB |
testcase_33 | AC | 321 ms
97,732 KB |
testcase_34 | AC | 339 ms
102,084 KB |
testcase_35 | AC | 319 ms
97,848 KB |
testcase_36 | AC | 363 ms
108,840 KB |
testcase_37 | AC | 396 ms
110,548 KB |
testcase_38 | AC | 394 ms
110,716 KB |
testcase_39 | AC | 392 ms
110,432 KB |
testcase_40 | AC | 400 ms
110,448 KB |
testcase_41 | AC | 392 ms
110,568 KB |
testcase_42 | AC | 263 ms
91,216 KB |
testcase_43 | AC | 356 ms
105,568 KB |
testcase_44 | AC | 327 ms
102,076 KB |
testcase_45 | AC | 316 ms
99,480 KB |
testcase_46 | AC | 285 ms
95,164 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)