結果
問題 | No.389 ロジックパズルの組み合わせ |
ユーザー | vwxyz |
提出日時 | 2021-07-31 10:40:52 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 566 ms / 2,000 ms |
コード長 | 2,168 bytes |
コンパイル時間 | 464 ms |
コンパイル使用メモリ | 86,856 KB |
実行使用メモリ | 266,780 KB |
最終ジャッジ日時 | 2023-10-14 14:36:48 |
合計ジャッジ時間 | 48,200 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 491 ms
248,692 KB |
testcase_01 | AC | 269 ms
91,164 KB |
testcase_02 | AC | 490 ms
248,748 KB |
testcase_03 | AC | 265 ms
91,088 KB |
testcase_04 | AC | 487 ms
248,848 KB |
testcase_05 | AC | 263 ms
91,088 KB |
testcase_06 | AC | 266 ms
90,984 KB |
testcase_07 | AC | 266 ms
91,256 KB |
testcase_08 | AC | 266 ms
90,960 KB |
testcase_09 | AC | 500 ms
254,648 KB |
testcase_10 | AC | 497 ms
252,180 KB |
testcase_11 | AC | 504 ms
257,960 KB |
testcase_12 | AC | 497 ms
252,024 KB |
testcase_13 | AC | 538 ms
251,176 KB |
testcase_14 | AC | 499 ms
257,984 KB |
testcase_15 | AC | 498 ms
250,400 KB |
testcase_16 | AC | 503 ms
252,256 KB |
testcase_17 | AC | 502 ms
256,596 KB |
testcase_18 | AC | 566 ms
266,176 KB |
testcase_19 | AC | 495 ms
248,544 KB |
testcase_20 | AC | 493 ms
248,348 KB |
testcase_21 | AC | 490 ms
248,656 KB |
testcase_22 | AC | 491 ms
248,352 KB |
testcase_23 | AC | 494 ms
248,384 KB |
testcase_24 | AC | 495 ms
248,688 KB |
testcase_25 | AC | 496 ms
248,856 KB |
testcase_26 | AC | 493 ms
248,736 KB |
testcase_27 | AC | 491 ms
248,436 KB |
testcase_28 | AC | 490 ms
248,732 KB |
testcase_29 | AC | 496 ms
248,852 KB |
testcase_30 | AC | 492 ms
248,460 KB |
testcase_31 | AC | 496 ms
248,728 KB |
testcase_32 | AC | 496 ms
248,728 KB |
testcase_33 | AC | 494 ms
248,384 KB |
testcase_34 | AC | 495 ms
248,856 KB |
testcase_35 | AC | 491 ms
248,484 KB |
testcase_36 | AC | 489 ms
248,428 KB |
testcase_37 | AC | 489 ms
248,852 KB |
testcase_38 | AC | 498 ms
248,396 KB |
testcase_39 | AC | 494 ms
248,860 KB |
testcase_40 | AC | 493 ms
248,796 KB |
testcase_41 | AC | 491 ms
248,348 KB |
testcase_42 | AC | 491 ms
248,660 KB |
testcase_43 | AC | 490 ms
248,344 KB |
testcase_44 | AC | 486 ms
248,404 KB |
testcase_45 | AC | 490 ms
248,388 KB |
testcase_46 | AC | 490 ms
248,656 KB |
testcase_47 | AC | 491 ms
248,708 KB |
testcase_48 | AC | 490 ms
248,524 KB |
testcase_49 | AC | 334 ms
147,804 KB |
testcase_50 | AC | 273 ms
94,652 KB |
testcase_51 | AC | 277 ms
94,444 KB |
testcase_52 | AC | 288 ms
101,308 KB |
testcase_53 | AC | 280 ms
96,880 KB |
testcase_54 | AC | 286 ms
102,524 KB |
testcase_55 | AC | 269 ms
91,532 KB |
testcase_56 | AC | 276 ms
96,328 KB |
testcase_57 | AC | 299 ms
116,248 KB |
testcase_58 | AC | 325 ms
140,552 KB |
testcase_59 | AC | 310 ms
126,488 KB |
testcase_60 | AC | 292 ms
107,000 KB |
testcase_61 | AC | 351 ms
170,544 KB |
testcase_62 | AC | 290 ms
108,924 KB |
testcase_63 | AC | 331 ms
140,804 KB |
testcase_64 | AC | 284 ms
102,884 KB |
testcase_65 | AC | 282 ms
99,816 KB |
testcase_66 | AC | 290 ms
107,180 KB |
testcase_67 | AC | 285 ms
105,500 KB |
testcase_68 | AC | 285 ms
103,848 KB |
testcase_69 | AC | 490 ms
248,384 KB |
testcase_70 | AC | 495 ms
248,432 KB |
testcase_71 | AC | 494 ms
248,360 KB |
testcase_72 | AC | 491 ms
248,552 KB |
testcase_73 | AC | 493 ms
248,420 KB |
testcase_74 | AC | 490 ms
248,384 KB |
testcase_75 | AC | 494 ms
248,356 KB |
testcase_76 | AC | 495 ms
248,384 KB |
testcase_77 | AC | 490 ms
248,500 KB |
testcase_78 | AC | 488 ms
248,664 KB |
testcase_79 | AC | 491 ms
248,388 KB |
testcase_80 | AC | 491 ms
248,492 KB |
testcase_81 | AC | 493 ms
248,320 KB |
testcase_82 | AC | 494 ms
248,584 KB |
testcase_83 | AC | 490 ms
248,556 KB |
testcase_84 | AC | 486 ms
248,348 KB |
testcase_85 | AC | 489 ms
248,576 KB |
testcase_86 | AC | 486 ms
248,800 KB |
testcase_87 | AC | 489 ms
248,812 KB |
testcase_88 | AC | 493 ms
248,804 KB |
testcase_89 | AC | 517 ms
253,404 KB |
testcase_90 | AC | 531 ms
251,828 KB |
testcase_91 | AC | 566 ms
266,780 KB |
testcase_92 | AC | 495 ms
256,556 KB |
testcase_93 | AC | 534 ms
256,320 KB |
testcase_94 | AC | 490 ms
249,140 KB |
testcase_95 | AC | 539 ms
260,184 KB |
testcase_96 | AC | 527 ms
263,104 KB |
testcase_97 | AC | 524 ms
262,628 KB |
testcase_98 | AC | 504 ms
244,808 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)