結果
| 問題 | No.2317 Expression Menu |
| ユーザー |
 McGregorsh
|
| 提出日時 | 2023-05-26 21:46:42 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 2,057 bytes |
| コンパイル時間 | 286 ms |
| コンパイル使用メモリ | 87,112 KB |
| 実行使用メモリ | 473,192 KB |
| 最終ジャッジ日時 | 2023-08-26 11:06:22 |
| 合計ジャッジ時間 | 40,843 ms |
|
ジャッジサーバーID （参考情報） |
judge11 / judge14 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 248 ms
92,644 KB |
| testcase_01 | AC | 247 ms
92,632 KB |
| testcase_02 | AC | 349 ms
109,980 KB |
| testcase_03 | TLE | - |
| testcase_04 | TLE | - |
| testcase_05 | TLE | - |
| testcase_06 | TLE | - |
| testcase_07 | TLE | - |
| testcase_08 | TLE | - |
| testcase_09 | TLE | - |
| testcase_10 | TLE | - |
| testcase_11 | TLE | - |
| testcase_12 | TLE | - |
| testcase_13 | TLE | - |
| testcase_14 | TLE | - |
| testcase_15 | TLE | - |
| testcase_16 | TLE | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
| testcase_32 | -- | - |
| testcase_33 | -- | - |
| testcase_34 | -- | - |
| testcase_35 | -- | - |
| testcase_36 | -- | - |
| testcase_37 | -- | - |
| testcase_38 | -- | - |
| testcase_39 | -- | - |
ソースコード
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, lru_cache
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
alpa = 'abcdefghijklmnopqrstuvwxyz'
ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
input = sys.stdin.readline
def main():
N, X, Y = i_map()
dp = [[[-INF] * (Y+1) for i in range(X+1)] for i in range(N+1)]
dp[0][0][0] = 0
for i in range(N):
a, b, c = i_map()
for j in range(X+1):
for k in range(Y+1):
if j + a <= X and k + b <= Y:
if dp[i+1][j+a][k+b] < dp[i][j][k] + c:
dp[i+1][j+a][k+b] = dp[i][j][k] + c
if dp[i+1][j][k] < dp[i][j][k]:
dp[i+1][j][k] = dp[i][j][k]
ans = 0
for i in range(X+1):
for j in range(Y+1):
if ans < dp[-1][i][j]:
ans = dp[-1][i][j]
print(ans)
if __name__ == '__main__':
main()