結果
問題 | No.1463 Hungry Kanten |
ユーザー | McGregorsh |
提出日時 | 2022-07-19 13:59:51 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 576 ms / 2,000 ms |
コード長 | 1,821 bytes |
コンパイル時間 | 285 ms |
コンパイル使用メモリ | 87,084 KB |
実行使用メモリ | 147,752 KB |
最終ジャッジ日時 | 2023-09-14 08:48:40 |
合計ジャッジ時間 | 8,142 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 228 ms
92,396 KB |
testcase_01 | AC | 237 ms
92,400 KB |
testcase_02 | AC | 270 ms
94,320 KB |
testcase_03 | AC | 445 ms
94,008 KB |
testcase_04 | AC | 239 ms
93,416 KB |
testcase_05 | AC | 576 ms
147,752 KB |
testcase_06 | AC | 228 ms
92,124 KB |
testcase_07 | AC | 226 ms
92,452 KB |
testcase_08 | AC | 228 ms
92,400 KB |
testcase_09 | AC | 229 ms
92,256 KB |
testcase_10 | AC | 234 ms
92,908 KB |
testcase_11 | AC | 236 ms
93,696 KB |
testcase_12 | AC | 235 ms
93,768 KB |
testcase_13 | AC | 234 ms
93,648 KB |
testcase_14 | AC | 252 ms
94,100 KB |
testcase_15 | AC | 239 ms
94,160 KB |
testcase_16 | AC | 248 ms
94,772 KB |
testcase_17 | AC | 259 ms
96,836 KB |
testcase_18 | AC | 257 ms
94,504 KB |
testcase_19 | AC | 397 ms
114,204 KB |
testcase_20 | AC | 454 ms
125,892 KB |
testcase_21 | AC | 238 ms
93,580 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 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(): n, k = i_map() a = i_list() ans = set() for bit in product([0, 1], repeat=n): num = sum(bit) if num < k: continue point = [] for i in range(n): if bit[i] == 1: point.append(a[i]) score1 = 0 score2 = 1 for j in range(num): score1 += point[j] score2 *= point[j] ans.add(score1) ans.add(score2) print(len(ans)) if __name__ == '__main__': main()