結果
問題 | No.496 ワープクリスタル (給料日前編) |
ユーザー | McGregorsh |
提出日時 | 2022-10-29 14:23:36 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,936 bytes |
コンパイル時間 | 555 ms |
コンパイル使用メモリ | 86,868 KB |
実行使用メモリ | 93,876 KB |
最終ジャッジ日時 | 2023-09-20 18:21:35 |
合計ジャッジ時間 | 9,046 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 244 ms
92,292 KB |
testcase_01 | AC | 240 ms
92,480 KB |
testcase_02 | AC | 241 ms
92,108 KB |
testcase_03 | AC | 244 ms
92,296 KB |
testcase_04 | WA | - |
testcase_05 | AC | 245 ms
92,336 KB |
testcase_06 | AC | 254 ms
93,652 KB |
testcase_07 | AC | 246 ms
92,440 KB |
testcase_08 | AC | 278 ms
93,796 KB |
testcase_09 | AC | 250 ms
93,528 KB |
testcase_10 | AC | 248 ms
92,976 KB |
testcase_11 | AC | 250 ms
93,068 KB |
testcase_12 | AC | 260 ms
93,636 KB |
testcase_13 | AC | 259 ms
93,608 KB |
testcase_14 | AC | 252 ms
93,340 KB |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | AC | 266 ms
93,780 KB |
testcase_19 | WA | - |
testcase_20 | AC | 268 ms
93,796 KB |
testcase_21 | AC | 259 ms
93,628 KB |
testcase_22 | WA | - |
testcase_23 | AC | 285 ms
93,784 KB |
testcase_24 | AC | 280 ms
93,860 KB |
testcase_25 | AC | 286 ms
93,832 KB |
testcase_26 | AC | 280 ms
93,712 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(): gx, gy, N, F = i_map() nums = [] for i in range(N): a, b, c = i_map() if (a + b) * F > c: nums.append([a, b, c]) nums.append([1, 0, F]) nums.append([0, 1, F]) lennum = len(nums) dp = [[INF] * (gx+1) for i in range(gy+1)] dp[0][0] = 0 for i in range(gy+1): for j in range(gx+1): for k in range(lennum): a, b, c = nums[k] y = i + b x = j + a if x <= gx and y <= gy: dp[y][x] = min(dp[y][x], dp[i][j] + c) print(dp[gy][gx]) if __name__ == '__main__': main()