結果
問題 | No.496 ワープクリスタル (給料日前編) |
ユーザー | McGregorsh |
提出日時 | 2022-10-29 14:14:18 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,833 bytes |
コンパイル時間 | 643 ms |
コンパイル使用メモリ | 87,064 KB |
実行使用メモリ | 94,092 KB |
最終ジャッジ日時 | 2023-09-20 18:15:13 |
合計ジャッジ時間 | 9,414 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 245 ms
92,504 KB |
testcase_01 | AC | 251 ms
92,296 KB |
testcase_02 | AC | 240 ms
92,476 KB |
testcase_03 | AC | 239 ms
92,624 KB |
testcase_04 | WA | - |
testcase_05 | AC | 240 ms
92,424 KB |
testcase_06 | AC | 249 ms
93,832 KB |
testcase_07 | AC | 239 ms
92,532 KB |
testcase_08 | AC | 279 ms
93,936 KB |
testcase_09 | AC | 282 ms
93,756 KB |
testcase_10 | AC | 254 ms
93,528 KB |
testcase_11 | AC | 257 ms
93,348 KB |
testcase_12 | AC | 254 ms
93,676 KB |
testcase_13 | AC | 257 ms
93,800 KB |
testcase_14 | AC | 257 ms
93,616 KB |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | AC | 256 ms
93,972 KB |
testcase_19 | WA | - |
testcase_20 | AC | 260 ms
93,836 KB |
testcase_21 | AC | 254 ms
93,736 KB |
testcase_22 | WA | - |
testcase_23 | AC | 280 ms
94,036 KB |
testcase_24 | AC | 280 ms
93,904 KB |
testcase_25 | AC | 289 ms
94,092 KB |
testcase_26 | AC | 276 ms
94,028 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 = [i_list() for i in range(N)] nums.append([1, 0, F]) nums.append([0, 1, F]) 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(N+2): 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()