結果
問題 | No.389 ロジックパズルの組み合わせ |
ユーザー | vwxyz |
提出日時 | 2021-07-31 10:40:52 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 481 ms / 2,000 ms |
コード長 | 2,168 bytes |
コンパイル時間 | 216 ms |
コンパイル使用メモリ | 81,920 KB |
実行使用メモリ | 258,816 KB |
最終ジャッジ日時 | 2024-09-16 09:12:16 |
合計ジャッジ時間 | 37,338 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 369 ms
244,480 KB |
testcase_01 | AC | 143 ms
89,216 KB |
testcase_02 | AC | 362 ms
244,352 KB |
testcase_03 | AC | 160 ms
89,472 KB |
testcase_04 | AC | 429 ms
244,352 KB |
testcase_05 | AC | 159 ms
89,344 KB |
testcase_06 | AC | 157 ms
89,216 KB |
testcase_07 | AC | 145 ms
89,216 KB |
testcase_08 | AC | 147 ms
89,600 KB |
testcase_09 | AC | 379 ms
249,088 KB |
testcase_10 | AC | 389 ms
247,168 KB |
testcase_11 | AC | 438 ms
251,776 KB |
testcase_12 | AC | 380 ms
246,656 KB |
testcase_13 | AC | 415 ms
258,304 KB |
testcase_14 | AC | 386 ms
251,904 KB |
testcase_15 | AC | 385 ms
244,992 KB |
testcase_16 | AC | 377 ms
247,168 KB |
testcase_17 | AC | 378 ms
250,624 KB |
testcase_18 | AC | 454 ms
253,952 KB |
testcase_19 | AC | 375 ms
244,352 KB |
testcase_20 | AC | 372 ms
244,352 KB |
testcase_21 | AC | 376 ms
244,480 KB |
testcase_22 | AC | 370 ms
244,224 KB |
testcase_23 | AC | 423 ms
244,480 KB |
testcase_24 | AC | 433 ms
244,608 KB |
testcase_25 | AC | 441 ms
244,736 KB |
testcase_26 | AC | 441 ms
244,224 KB |
testcase_27 | AC | 420 ms
244,224 KB |
testcase_28 | AC | 381 ms
244,608 KB |
testcase_29 | AC | 398 ms
244,352 KB |
testcase_30 | AC | 445 ms
244,480 KB |
testcase_31 | AC | 387 ms
244,352 KB |
testcase_32 | AC | 379 ms
244,352 KB |
testcase_33 | AC | 388 ms
244,352 KB |
testcase_34 | AC | 369 ms
244,608 KB |
testcase_35 | AC | 386 ms
244,736 KB |
testcase_36 | AC | 379 ms
244,352 KB |
testcase_37 | AC | 387 ms
244,480 KB |
testcase_38 | AC | 380 ms
244,224 KB |
testcase_39 | AC | 394 ms
244,480 KB |
testcase_40 | AC | 377 ms
244,352 KB |
testcase_41 | AC | 382 ms
244,352 KB |
testcase_42 | AC | 414 ms
244,224 KB |
testcase_43 | AC | 434 ms
244,480 KB |
testcase_44 | AC | 434 ms
244,736 KB |
testcase_45 | AC | 435 ms
244,352 KB |
testcase_46 | AC | 438 ms
244,608 KB |
testcase_47 | AC | 431 ms
244,608 KB |
testcase_48 | AC | 436 ms
244,608 KB |
testcase_49 | AC | 224 ms
144,128 KB |
testcase_50 | AC | 156 ms
89,856 KB |
testcase_51 | AC | 149 ms
89,728 KB |
testcase_52 | AC | 154 ms
96,512 KB |
testcase_53 | AC | 151 ms
91,520 KB |
testcase_54 | AC | 160 ms
98,048 KB |
testcase_55 | AC | 148 ms
89,728 KB |
testcase_56 | AC | 150 ms
90,752 KB |
testcase_57 | AC | 176 ms
111,872 KB |
testcase_58 | AC | 206 ms
137,088 KB |
testcase_59 | AC | 191 ms
122,368 KB |
testcase_60 | AC | 170 ms
102,400 KB |
testcase_61 | AC | 251 ms
154,112 KB |
testcase_62 | AC | 164 ms
104,192 KB |
testcase_63 | AC | 205 ms
137,216 KB |
testcase_64 | AC | 166 ms
98,176 KB |
testcase_65 | AC | 155 ms
93,824 KB |
testcase_66 | AC | 169 ms
102,016 KB |
testcase_67 | AC | 159 ms
100,608 KB |
testcase_68 | AC | 164 ms
99,136 KB |
testcase_69 | AC | 377 ms
244,736 KB |
testcase_70 | AC | 368 ms
244,736 KB |
testcase_71 | AC | 385 ms
244,224 KB |
testcase_72 | AC | 411 ms
244,480 KB |
testcase_73 | AC | 448 ms
244,480 KB |
testcase_74 | AC | 441 ms
244,608 KB |
testcase_75 | AC | 411 ms
244,352 KB |
testcase_76 | AC | 407 ms
244,352 KB |
testcase_77 | AC | 438 ms
244,480 KB |
testcase_78 | AC | 438 ms
244,608 KB |
testcase_79 | AC | 439 ms
244,480 KB |
testcase_80 | AC | 403 ms
244,224 KB |
testcase_81 | AC | 376 ms
244,736 KB |
testcase_82 | AC | 372 ms
244,352 KB |
testcase_83 | AC | 383 ms
244,608 KB |
testcase_84 | AC | 375 ms
244,352 KB |
testcase_85 | AC | 377 ms
244,608 KB |
testcase_86 | AC | 367 ms
244,352 KB |
testcase_87 | AC | 369 ms
244,352 KB |
testcase_88 | AC | 370 ms
244,352 KB |
testcase_89 | AC | 391 ms
246,528 KB |
testcase_90 | AC | 405 ms
258,816 KB |
testcase_91 | AC | 448 ms
247,368 KB |
testcase_92 | AC | 462 ms
250,624 KB |
testcase_93 | AC | 481 ms
246,784 KB |
testcase_94 | AC | 438 ms
244,736 KB |
testcase_95 | AC | 481 ms
251,008 KB |
testcase_96 | AC | 403 ms
255,104 KB |
testcase_97 | AC | 403 ms
254,848 KB |
testcase_98 | AC | 384 ms
255,104 KB |
ソースコード
import bisect import copy import decimal import fractions 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 gcd as GCD, modf 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,mod): self.mod=mod 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] for i in range(1,N+1): self.factorial.append((self.factorial[-1]*i)%self.mod) self.factorial_inv=[None]*(N+1) self.factorial_inv[-1]=self.Pow(self.factorial[-1],-1) for i in range(N-1,-1,-1): self.factorial_inv[i]=(self.factorial_inv[i+1]*(i+1))%self.mod return self.factorial_inv def Fact(self,N): return self.factorial[N] def Fact_Inv(self,N): return self.factorial_inv[N] def Comb(self,N,K): if K<0 or K>N: return 0 s=self.factorial[N] s=(s*self.factorial_inv[K])%self.mod s=(s*self.factorial_inv[N-K])%self.mod return s M,*H=map(int,read().split()) S=sum(H)+len(H)-1 if H==[0]: ans=1 elif S>M: ans='NA' else: mod=10**9+7 MD=MOD(mod) MD.Build_Fact(2*10**6) ans=MD.Comb(M-S+len(H),len(H)) print(ans)