結果

問題 No.1457 ツブ消ししとるなHard
ユーザー McGregorshMcGregorsh
提出日時 2023-05-21 12:18:54
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 2,397 bytes
コンパイル時間 180 ms
コンパイル使用メモリ 82,104 KB
実行使用メモリ 324,472 KB
最終ジャッジ日時 2024-06-01 12:29:56
合計ジャッジ時間 12,692 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 155 ms
89,588 KB
testcase_01 AC 155 ms
89,344 KB
testcase_02 AC 154 ms
89,328 KB
testcase_03 AC 151 ms
89,420 KB
testcase_04 TLE -
testcase_05 TLE -
testcase_06 TLE -
testcase_07 AC 152 ms
89,296 KB
testcase_08 AC 148 ms
89,576 KB
testcase_09 AC 173 ms
90,084 KB
testcase_10 AC 164 ms
89,736 KB
testcase_11 AC 162 ms
90,020 KB
testcase_12 AC 148 ms
89,512 KB
testcase_13 AC 192 ms
89,748 KB
testcase_14 AC 159 ms
89,804 KB
testcase_15 AC 215 ms
90,080 KB
testcase_16 AC 170 ms
89,888 KB
testcase_17 AC 150 ms
89,284 KB
testcase_18 AC 152 ms
89,204 KB
testcase_19 AC 1,502 ms
283,464 KB
testcase_20 AC 151 ms
89,164 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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, X, Y, Z = i_map()
   A = i_list()
   
   AA = []
   basescore = 0
   basecou = 0
   for i in range(N):
   	  if A[i] >= X:
   	  	  basescore += A[i]
   	  	  basecou += 1
   	  elif X > A[i] > Y:
   	  	  AA.append(A[i])
   
   lenAA = len(AA)
   
   if basecou > M:
   	  print('Handicapped')
   	  exit()
   
   ans = 0
   if basecou > 0:
   	  if basescore % basecou == 0:
   	  	  if basescore // basecou == Z:
   	  	  	  ans += 1
   
   for i in range(lenAA+1):
   	  
   	  genkai = Z * (i + basecou) - basescore
   	  if genkai <= 0:
   	  	  continue
   	  if i + basecou > M:
   	  	  break
   	  
   	  dp = [[[0] * (genkai+1) for _ in range(i+1)] for _ in range(lenAA+1)]
   	  dp[0][0][0] = 1
   	  
   	  for j in range(lenAA):
   	  	  point = AA[j]
   	  	  for k in range(i+1):
   	  	  	  for l in range(genkai+1):
   	  	  	  	  if l + point <= genkai and k + 1 <= i:
   	  	  	  	  	  dp[j+1][k+1][l+point] += dp[j][k][l]
   	  	  	  	  dp[j+1][k][l] += dp[j][k][l]
   	  
   	  ans += dp[-1][-1][-1]
   
   print(ans)
   
if __name__ == '__main__':
    main()
0