結果
問題 | No.2155 みちらcolor |
ユーザー | McGregorsh |
提出日時 | 2023-03-18 22:49:27 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,747 bytes |
コンパイル時間 | 149 ms |
コンパイル使用メモリ | 81,820 KB |
実行使用メモリ | 88,940 KB |
最終ジャッジ日時 | 2023-10-18 17:35:33 |
合計ジャッジ時間 | 13,577 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 152 ms
88,920 KB |
testcase_01 | AC | 149 ms
88,924 KB |
testcase_02 | AC | 153 ms
88,928 KB |
testcase_03 | AC | 151 ms
88,924 KB |
testcase_04 | AC | 153 ms
88,924 KB |
testcase_05 | AC | 152 ms
88,924 KB |
testcase_06 | AC | 152 ms
88,928 KB |
testcase_07 | AC | 153 ms
88,924 KB |
testcase_08 | AC | 154 ms
88,920 KB |
testcase_09 | AC | 152 ms
88,924 KB |
testcase_10 | AC | 157 ms
88,924 KB |
testcase_11 | AC | 153 ms
88,924 KB |
testcase_12 | AC | 153 ms
88,924 KB |
testcase_13 | AC | 149 ms
88,740 KB |
testcase_14 | AC | 155 ms
88,924 KB |
testcase_15 | AC | 150 ms
88,928 KB |
testcase_16 | AC | 153 ms
88,924 KB |
testcase_17 | AC | 151 ms
88,924 KB |
testcase_18 | AC | 153 ms
88,924 KB |
testcase_19 | AC | 151 ms
88,928 KB |
testcase_20 | AC | 152 ms
88,924 KB |
testcase_21 | AC | 154 ms
88,924 KB |
testcase_22 | AC | 153 ms
88,924 KB |
testcase_23 | AC | 152 ms
88,924 KB |
testcase_24 | AC | 153 ms
88,940 KB |
testcase_25 | AC | 152 ms
88,928 KB |
testcase_26 | AC | 153 ms
88,924 KB |
testcase_27 | AC | 153 ms
88,924 KB |
testcase_28 | AC | 155 ms
88,924 KB |
testcase_29 | AC | 150 ms
88,924 KB |
testcase_30 | AC | 152 ms
88,928 KB |
testcase_31 | AC | 152 ms
88,924 KB |
testcase_32 | AC | 152 ms
88,924 KB |
testcase_33 | AC | 153 ms
88,928 KB |
testcase_34 | AC | 154 ms
88,924 KB |
testcase_35 | AC | 152 ms
88,924 KB |
testcase_36 | AC | 154 ms
88,928 KB |
testcase_37 | AC | 154 ms
88,924 KB |
testcase_38 | AC | 152 ms
88,924 KB |
testcase_39 | AC | 153 ms
88,924 KB |
testcase_40 | WA | - |
testcase_41 | AC | 154 ms
88,936 KB |
testcase_42 | AC | 153 ms
88,924 KB |
testcase_43 | WA | - |
testcase_44 | AC | 148 ms
88,740 KB |
testcase_45 | AC | 150 ms
88,736 KB |
testcase_46 | WA | - |
testcase_47 | AC | 151 ms
88,928 KB |
testcase_48 | AC | 152 ms
88,924 KB |
testcase_49 | WA | - |
testcase_50 | AC | 153 ms
88,920 KB |
testcase_51 | WA | - |
testcase_52 | AC | 153 ms
88,924 KB |
testcase_53 | AC | 152 ms
88,924 KB |
testcase_54 | AC | 152 ms
88,924 KB |
testcase_55 | AC | 151 ms
88,736 KB |
testcase_56 | AC | 152 ms
88,924 KB |
testcase_57 | AC | 152 ms
88,924 KB |
testcase_58 | AC | 152 ms
88,924 KB |
testcase_59 | AC | 149 ms
88,736 KB |
testcase_60 | AC | 149 ms
88,736 KB |
testcase_61 | AC | 149 ms
88,924 KB |
testcase_62 | WA | - |
testcase_63 | AC | 152 ms
88,924 KB |
testcase_64 | AC | 151 ms
88,924 KB |
testcase_65 | AC | 150 ms
88,736 KB |
testcase_66 | AC | 149 ms
88,928 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, M, L = i_map() A = i_list() dp = [[False] * 2001 for i in range(N+1)] dp[0][0] = True for i in range(N): point = A[i] for j in range(2001): if dp[i][j] == False: continue if (j + point) // 2 <= 2000: dp[i+1][(j+point)//2] = True dp[i+1][j] = True if dp[-1][M]: print('Yes') else: print('No') if __name__ == '__main__': main()