結果
問題 | No.2232 Miser's Gift |
ユーザー | McGregorsh |
提出日時 | 2023-03-17 00:53:14 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 417 ms / 2,000 ms |
コード長 | 1,739 bytes |
コンパイル時間 | 389 ms |
コンパイル使用メモリ | 81,608 KB |
実行使用メモリ | 168,716 KB |
最終ジャッジ日時 | 2023-10-18 13:21:50 |
合計ジャッジ時間 | 19,633 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 146 ms
88,440 KB |
testcase_01 | AC | 145 ms
88,436 KB |
testcase_02 | AC | 143 ms
88,440 KB |
testcase_03 | AC | 351 ms
168,708 KB |
testcase_04 | AC | 405 ms
168,700 KB |
testcase_05 | AC | 169 ms
89,400 KB |
testcase_06 | AC | 144 ms
88,436 KB |
testcase_07 | AC | 166 ms
91,256 KB |
testcase_08 | AC | 379 ms
168,680 KB |
testcase_09 | AC | 382 ms
168,692 KB |
testcase_10 | AC | 374 ms
168,680 KB |
testcase_11 | AC | 375 ms
168,688 KB |
testcase_12 | AC | 381 ms
168,684 KB |
testcase_13 | AC | 351 ms
168,704 KB |
testcase_14 | AC | 350 ms
168,704 KB |
testcase_15 | AC | 349 ms
168,704 KB |
testcase_16 | AC | 355 ms
168,700 KB |
testcase_17 | AC | 352 ms
168,704 KB |
testcase_18 | AC | 351 ms
168,708 KB |
testcase_19 | AC | 350 ms
168,700 KB |
testcase_20 | AC | 348 ms
168,700 KB |
testcase_21 | AC | 353 ms
168,704 KB |
testcase_22 | AC | 351 ms
168,700 KB |
testcase_23 | AC | 417 ms
168,712 KB |
testcase_24 | AC | 410 ms
168,716 KB |
testcase_25 | AC | 415 ms
168,700 KB |
testcase_26 | AC | 417 ms
168,700 KB |
testcase_27 | AC | 412 ms
168,696 KB |
testcase_28 | AC | 392 ms
168,704 KB |
testcase_29 | AC | 395 ms
168,700 KB |
testcase_30 | AC | 396 ms
168,708 KB |
testcase_31 | AC | 391 ms
168,712 KB |
testcase_32 | AC | 389 ms
168,696 KB |
testcase_33 | AC | 352 ms
168,696 KB |
testcase_34 | AC | 353 ms
168,680 KB |
testcase_35 | AC | 355 ms
168,688 KB |
testcase_36 | AC | 351 ms
168,704 KB |
testcase_37 | AC | 354 ms
168,676 KB |
testcase_38 | AC | 159 ms
88,960 KB |
testcase_39 | AC | 160 ms
88,960 KB |
testcase_40 | AC | 158 ms
88,956 KB |
testcase_41 | AC | 157 ms
88,956 KB |
testcase_42 | AC | 157 ms
88,964 KB |
testcase_43 | AC | 160 ms
88,956 KB |
testcase_44 | AC | 159 ms
88,960 KB |
testcase_45 | AC | 160 ms
88,960 KB |
testcase_46 | AC | 157 ms
88,956 KB |
testcase_47 | AC | 156 ms
88,960 KB |
testcase_48 | AC | 150 ms
88,928 KB |
testcase_49 | AC | 154 ms
88,928 KB |
testcase_50 | AC | 151 ms
88,928 KB |
testcase_51 | AC | 149 ms
88,928 KB |
testcase_52 | AC | 148 ms
88,924 KB |
testcase_53 | AC | 150 ms
88,932 KB |
testcase_54 | AC | 148 ms
88,928 KB |
testcase_55 | AC | 152 ms
88,928 KB |
testcase_56 | AC | 149 ms
88,932 KB |
testcase_57 | 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, W = i_map() nums = [i_list() for i in range(N)] dp = [[0] * (W+1) for i in range(N+1)] dp[0][0] = 0 for i in range(N): w, v = nums[i] for j in range(W+1): if j + w <= W: dp[i+1][j+w] = max(dp[i+1][j+w], dp[i][j]+v) dp[i+1][j] = max(dp[i+1][j], dp[i][j]) for i in range(W-1, -1, -1): print(dp[N][-1] - dp[N][i] + 1) if __name__ == '__main__': main()