結果
問題 | No.617 Nafmo、買い出しに行く |
ユーザー | McGregorsh |
提出日時 | 2023-04-11 22:23:30 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 520 ms / 2,000 ms |
コード長 | 1,618 bytes |
コンパイル時間 | 193 ms |
コンパイル使用メモリ | 82,688 KB |
実行使用メモリ | 90,880 KB |
最終ジャッジ日時 | 2024-04-16 18:09:10 |
合計ジャッジ時間 | 8,471 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 159 ms
90,112 KB |
testcase_01 | AC | 154 ms
89,600 KB |
testcase_02 | AC | 160 ms
89,984 KB |
testcase_03 | AC | 181 ms
90,624 KB |
testcase_04 | AC | 154 ms
89,216 KB |
testcase_05 | AC | 186 ms
90,496 KB |
testcase_06 | AC | 512 ms
90,752 KB |
testcase_07 | AC | 510 ms
90,880 KB |
testcase_08 | AC | 159 ms
89,728 KB |
testcase_09 | AC | 157 ms
89,344 KB |
testcase_10 | AC | 511 ms
90,368 KB |
testcase_11 | AC | 520 ms
90,880 KB |
testcase_12 | AC | 517 ms
90,880 KB |
testcase_13 | AC | 519 ms
90,752 KB |
testcase_14 | AC | 517 ms
90,368 KB |
testcase_15 | AC | 506 ms
90,752 KB |
testcase_16 | AC | 508 ms
90,624 KB |
testcase_17 | AC | 503 ms
90,624 KB |
testcase_18 | AC | 156 ms
89,344 KB |
testcase_19 | AC | 159 ms
90,112 KB |
testcase_20 | AC | 157 ms
89,344 KB |
testcase_21 | AC | 155 ms
89,728 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(): N, K = i_map() nums = [int(input()) for i in range(N)] ans = 0 for bit in product([0, 1], repeat=N): cou = 0 for i in range(N): if bit[i] == 1: cou += nums[i] if cou <= K: ans = max(ans, cou) print(ans) if __name__ == '__main__': main()