結果
問題 | No.2093 Shio Ramen |
ユーザー | McGregorsh |
提出日時 | 2022-10-23 23:30:05 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,768 bytes |
コンパイル時間 | 651 ms |
コンパイル使用メモリ | 87,264 KB |
実行使用メモリ | 101,380 KB |
最終ジャッジ日時 | 2023-09-15 07:36:31 |
合計ジャッジ時間 | 10,701 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 237 ms
92,884 KB |
testcase_01 | AC | 254 ms
92,908 KB |
testcase_02 | AC | 246 ms
92,356 KB |
testcase_03 | AC | 247 ms
92,800 KB |
testcase_04 | AC | 244 ms
92,972 KB |
testcase_05 | AC | 240 ms
92,968 KB |
testcase_06 | AC | 241 ms
92,688 KB |
testcase_07 | AC | 244 ms
92,896 KB |
testcase_08 | AC | 243 ms
92,580 KB |
testcase_09 | AC | 255 ms
93,296 KB |
testcase_10 | WA | - |
testcase_11 | AC | 246 ms
93,032 KB |
testcase_12 | AC | 269 ms
93,140 KB |
testcase_13 | AC | 276 ms
98,988 KB |
testcase_14 | AC | 276 ms
99,612 KB |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | AC | 288 ms
101,132 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 288 ms
100,856 KB |
testcase_21 | AC | 280 ms
100,852 KB |
testcase_22 | AC | 288 ms
101,112 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
ソースコード
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, L = i_map() nums = [i_list() for i in range(N)] dp = [[0] * 1001 for i in range(N+1)] for i in range(N): A, B = nums[i] for j in range(1001): if j + A <= 1000: dp[i+1][j+A] = max(dp[i+1][j+A], dp[i][j] + B) dp[i+1][j] = max(dp[i+1][j], dp[i][j]) ans = 0 for i in range(L+1): ans = max(ans, dp[N][i]) print(ans) if __name__ == '__main__': main()