結果

問題 No.462 6日知らずのコンピュータ
ユーザー McGregorshMcGregorsh
提出日時 2022-10-28 14:43:02
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,119 bytes
コンパイル時間 330 ms
コンパイル使用メモリ 87,196 KB
実行使用メモリ 95,032 KB
最終ジャッジ日時 2023-09-19 07:16:14
合計ジャッジ時間 26,277 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 253 ms
92,500 KB
testcase_01 AC 250 ms
92,368 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 246 ms
92,536 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 250 ms
92,656 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 248 ms
92,636 KB
testcase_23 WA -
testcase_24 AC 255 ms
92,624 KB
testcase_25 WA -
testcase_26 AC 250 ms
92,628 KB
testcase_27 WA -
testcase_28 AC 247 ms
92,368 KB
testcase_29 AC 250 ms
92,844 KB
testcase_30 AC 244 ms
92,512 KB
testcase_31 AC 246 ms
92,528 KB
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 AC 243 ms
92,476 KB
testcase_36 AC 245 ms
92,392 KB
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 AC 246 ms
92,420 KB
testcase_46 AC 249 ms
92,772 KB
testcase_47 WA -
testcase_48 WA -
testcase_49 AC 251 ms
92,476 KB
testcase_50 AC 251 ms
92,456 KB
testcase_51 AC 244 ms
92,420 KB
testcase_52 AC 250 ms
92,512 KB
testcase_53 AC 244 ms
92,256 KB
testcase_54 AC 247 ms
92,480 KB
testcase_55 AC 251 ms
92,368 KB
testcase_56 AC 247 ms
92,584 KB
testcase_57 AC 246 ms
92,528 KB
testcase_58 AC 251 ms
92,252 KB
testcase_59 AC 248 ms
92,408 KB
testcase_60 AC 248 ms
92,396 KB
testcase_61 AC 255 ms
92,408 KB
testcase_62 WA -
testcase_63 AC 243 ms
92,504 KB
testcase_64 AC 243 ms
92,420 KB
testcase_65 AC 246 ms
92,356 KB
testcase_66 AC 246 ms
92,256 KB
testcase_67 AC 248 ms
92,356 KB
testcase_68 AC 246 ms
92,432 KB
testcase_69 AC 242 ms
92,352 KB
testcase_70 AC 246 ms
92,364 KB
testcase_71 AC 249 ms
92,384 KB
testcase_72 AC 249 ms
92,508 KB
testcase_73 AC 242 ms
92,368 KB
testcase_74 AC 244 ms
92,596 KB
testcase_75 AC 248 ms
92,524 KB
testcase_76 AC 245 ms
92,432 KB
testcase_77 AC 248 ms
92,364 KB
testcase_78 AC 240 ms
92,304 KB
testcase_79 AC 245 ms
92,472 KB
testcase_80 AC 243 ms
92,540 KB
testcase_81 AC 240 ms
92,476 KB
testcase_82 AC 243 ms
92,400 KB
testcase_83 AC 239 ms
92,380 KB
testcase_84 AC 240 ms
92,520 KB
testcase_85 AC 246 ms
92,260 KB
testcase_86 AC 239 ms
92,568 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys, re
from fractions import Fraction
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque, defaultdict
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement, permutations
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext, ROUND_HALF_UP
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
def get_distance(x1, y1, x2, y2):
	  d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
	  return d
def rotate(table):
   	  n_fild = []
   	  for x in zip(*table[::-1]):
   	  	  n_fild.append(x)
   	  return n_fild
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
MOD = 10 ** 9 + 7
MOD2 = 998244353


###関数コピーしたか？###
def main():
   
   kai = [0] * 100
   kai[1] = 1
   for i in range(2, 100):
   	  kai[i] = kai[i-1] * i
   	  kai[i] %= MOD
   
   N, K = i_map()
   if K == 0:
   	  print(kai[N])
   	  exit()
   A = i_list()
   A.sort()
   
   juge = [False] * 100
   cou = [0] * K
   for i in range(K):
   	  bit = format(A[i], 'b')
   	  bit = bit.zfill(100)
   	  for j in range(100):
   	  	  if juge[j] and bit[j] == '0':
   	  	  	  print(0)
   	  	  	  exit()
   	  	  if juge[j] == False and bit[j] == '0':
   	  	  	  continue
   	  	  if bit[j] == '1':
   	  	  	  cou[i] += 1
   	  	  	  juge[j] = True
   
   ans = kai[cou[0]]
   for i in range(1, K):
   	  cost = cou[i] - cou[i-1]
   	  score = kai[cost]
   	  ans *= score
   	  ans %= MOD
   print(ans)
   
   
if __name__ == '__main__':
    main()
0