結果
問題 | No.462 6日知らずのコンピュータ |
ユーザー | McGregorsh |
提出日時 | 2022-10-28 14:35:14 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,092 bytes |
コンパイル時間 | 539 ms |
コンパイル使用メモリ | 86,876 KB |
実行使用メモリ | 93,120 KB |
最終ジャッジ日時 | 2023-09-19 07:09:55 |
合計ジャッジ時間 | 28,175 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 244 ms
92,064 KB |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 239 ms
92,484 KB |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 249 ms
92,560 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 | 246 ms
92,760 KB |
testcase_23 | WA | - |
testcase_24 | AC | 249 ms
92,100 KB |
testcase_25 | WA | - |
testcase_26 | AC | 243 ms
92,500 KB |
testcase_27 | WA | - |
testcase_28 | AC | 244 ms
92,340 KB |
testcase_29 | AC | 247 ms
92,384 KB |
testcase_30 | AC | 247 ms
92,096 KB |
testcase_31 | AC | 251 ms
92,440 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | AC | 246 ms
92,388 KB |
testcase_36 | AC | 247 ms
92,460 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 | 244 ms
92,372 KB |
testcase_46 | AC | 248 ms
92,692 KB |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | AC | 248 ms
92,392 KB |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | AC | 242 ms
92,612 KB |
testcase_53 | AC | 242 ms
92,620 KB |
testcase_54 | AC | 237 ms
92,232 KB |
testcase_55 | WA | - |
testcase_56 | AC | 241 ms
92,504 KB |
testcase_57 | AC | 243 ms
92,500 KB |
testcase_58 | AC | 246 ms
92,640 KB |
testcase_59 | AC | 248 ms
92,880 KB |
testcase_60 | AC | 242 ms
92,772 KB |
testcase_61 | AC | 241 ms
92,324 KB |
testcase_62 | WA | - |
testcase_63 | AC | 242 ms
92,492 KB |
testcase_64 | WA | - |
testcase_65 | AC | 239 ms
92,436 KB |
testcase_66 | AC | 243 ms
92,620 KB |
testcase_67 | AC | 240 ms
92,560 KB |
testcase_68 | WA | - |
testcase_69 | AC | 247 ms
92,776 KB |
testcase_70 | AC | 244 ms
92,608 KB |
testcase_71 | AC | 244 ms
92,480 KB |
testcase_72 | AC | 243 ms
92,672 KB |
testcase_73 | AC | 244 ms
92,500 KB |
testcase_74 | WA | - |
testcase_75 | AC | 249 ms
92,740 KB |
testcase_76 | WA | - |
testcase_77 | AC | 243 ms
92,612 KB |
testcase_78 | AC | 246 ms
92,704 KB |
testcase_79 | AC | 249 ms
92,104 KB |
testcase_80 | AC | 259 ms
92,236 KB |
testcase_81 | AC | 243 ms
92,392 KB |
testcase_82 | AC | 246 ms
92,164 KB |
testcase_83 | AC | 244 ms
92,036 KB |
testcase_84 | AC | 238 ms
92,108 KB |
testcase_85 | AC | 242 ms
92,336 KB |
testcase_86 | AC | 245 ms
92,260 KB |
ソースコード
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 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()