結果
問題 | No.1701 half price |
ユーザー | McGregorsh |
提出日時 | 2022-07-25 19:05:50 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,922 bytes |
コンパイル時間 | 292 ms |
コンパイル使用メモリ | 87,140 KB |
実行使用メモリ | 94,288 KB |
最終ジャッジ日時 | 2023-09-22 04:12:42 |
合計ジャッジ時間 | 8,883 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 273 ms
92,256 KB |
testcase_01 | AC | 274 ms
92,360 KB |
testcase_02 | AC | 314 ms
93,824 KB |
testcase_03 | AC | 268 ms
92,484 KB |
testcase_04 | WA | - |
testcase_05 | AC | 280 ms
93,124 KB |
testcase_06 | AC | 491 ms
93,944 KB |
testcase_07 | WA | - |
testcase_08 | AC | 269 ms
92,308 KB |
testcase_09 | AC | 263 ms
92,512 KB |
testcase_10 | AC | 266 ms
92,316 KB |
testcase_11 | AC | 268 ms
92,340 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 274 ms
92,460 KB |
testcase_16 | AC | 269 ms
92,476 KB |
testcase_17 | AC | 293 ms
93,684 KB |
testcase_18 | AC | 271 ms
92,396 KB |
testcase_19 | AC | 276 ms
93,116 KB |
testcase_20 | AC | 277 ms
92,488 KB |
testcase_21 | AC | 606 ms
93,908 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, w = i_map() a = i_list() ans = 0 for bit in product([0, 1], repeat=n): if sum(bit) == 0: continue lines = [] for i in range(n): if bit[i] == 1: lines.append(i) for bit2 in product([0, 1], repeat=len(lines)): cou = 0 for j in range(len(lines)): if bit2[j] == 1: cou += a[j] // 2 else: cou += a[j] if cou == w: ans += 1 #print(bit) break print(ans) if __name__ == '__main__': main()