結果
問題 | No.2093 Shio Ramen |
ユーザー | McGregorsh |
提出日時 | 2022-10-23 23:35:13 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 298 ms / 2,000 ms |
コード長 | 1,765 bytes |
コンパイル時間 | 481 ms |
コンパイル使用メモリ | 87,276 KB |
実行使用メモリ | 101,312 KB |
最終ジャッジ日時 | 2023-09-15 07:40:41 |
合計ジャッジ時間 | 10,469 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 238 ms
92,908 KB |
testcase_01 | AC | 241 ms
92,968 KB |
testcase_02 | AC | 239 ms
92,580 KB |
testcase_03 | AC | 239 ms
93,052 KB |
testcase_04 | AC | 239 ms
92,700 KB |
testcase_05 | AC | 245 ms
93,000 KB |
testcase_06 | AC | 239 ms
92,988 KB |
testcase_07 | AC | 239 ms
92,832 KB |
testcase_08 | AC | 240 ms
92,836 KB |
testcase_09 | AC | 261 ms
93,416 KB |
testcase_10 | AC | 284 ms
99,944 KB |
testcase_11 | AC | 248 ms
92,964 KB |
testcase_12 | AC | 277 ms
98,516 KB |
testcase_13 | AC | 277 ms
98,960 KB |
testcase_14 | AC | 280 ms
99,664 KB |
testcase_15 | AC | 283 ms
99,384 KB |
testcase_16 | AC | 261 ms
93,544 KB |
testcase_17 | AC | 298 ms
101,188 KB |
testcase_18 | AC | 291 ms
101,124 KB |
testcase_19 | AC | 294 ms
100,812 KB |
testcase_20 | AC | 296 ms
100,824 KB |
testcase_21 | AC | 291 ms
100,836 KB |
testcase_22 | AC | 294 ms
101,244 KB |
testcase_23 | AC | 289 ms
100,836 KB |
testcase_24 | AC | 284 ms
101,224 KB |
testcase_25 | AC | 292 ms
100,752 KB |
testcase_26 | AC | 296 ms
101,144 KB |
testcase_27 | AC | 290 ms
101,312 KB |
testcase_28 | AC | 290 ms
101,084 KB |
testcase_29 | AC | 290 ms
101,036 KB |
testcase_30 | AC | 287 ms
100,996 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, 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()