結果
問題 | No.496 ワープクリスタル (給料日前編) |
ユーザー | McGregorsh |
提出日時 | 2023-07-03 15:48:38 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 352 ms / 2,000 ms |
コード長 | 1,997 bytes |
コンパイル時間 | 605 ms |
コンパイル使用メモリ | 87,108 KB |
実行使用メモリ | 99,868 KB |
最終ジャッジ日時 | 2023-09-24 12:29:05 |
合計ジャッジ時間 | 10,545 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 246 ms
90,036 KB |
testcase_01 | AC | 243 ms
89,964 KB |
testcase_02 | AC | 246 ms
89,876 KB |
testcase_03 | AC | 245 ms
90,048 KB |
testcase_04 | AC | 247 ms
89,960 KB |
testcase_05 | AC | 246 ms
89,972 KB |
testcase_06 | AC | 248 ms
90,556 KB |
testcase_07 | AC | 244 ms
89,964 KB |
testcase_08 | AC | 327 ms
96,840 KB |
testcase_09 | AC | 316 ms
96,780 KB |
testcase_10 | AC | 277 ms
92,920 KB |
testcase_11 | AC | 262 ms
91,204 KB |
testcase_12 | AC | 300 ms
92,468 KB |
testcase_13 | AC | 309 ms
93,520 KB |
testcase_14 | AC | 309 ms
93,680 KB |
testcase_15 | AC | 294 ms
92,892 KB |
testcase_16 | AC | 303 ms
92,668 KB |
testcase_17 | AC | 308 ms
94,200 KB |
testcase_18 | AC | 300 ms
93,420 KB |
testcase_19 | AC | 307 ms
93,484 KB |
testcase_20 | AC | 283 ms
92,476 KB |
testcase_21 | AC | 281 ms
92,252 KB |
testcase_22 | AC | 346 ms
99,868 KB |
testcase_23 | AC | 352 ms
99,100 KB |
testcase_24 | AC | 350 ms
99,372 KB |
testcase_25 | AC | 342 ms
99,300 KB |
testcase_26 | AC | 347 ms
99,388 KB |
ソースコード
import sys from sys import stdin from fractions import Fraction import math 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, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(stdin.readline()) def i_map(): return map(int, stdin.readline().split()) def i_list(): return list(i_map()) def s_input(): return stdin.readline()[:-1] def s_map(): return s_input().split() def s_list(): return list(s_map()) 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 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' def main(): Gx, Gy, N, F = i_map() costs = [[[INF] * (Gy+1) for i in range(Gx+1)] for i in range(N+1)] costs[0][0][0] = 0 for i in range(N): x, y, c = i_map() for j in range(Gx+1): for k in range(Gy+1): costs[i+1][j][k] = min(costs[i+1][j][k], costs[i][j][k]) nx = x + j ny = y + k if not (0<=nx<=Gx and 0<=ny<=Gy): continue costs[i+1][nx][ny] = min(costs[i+1][nx][ny], costs[i][j][k] + c) #for i in costs: # print(i) ans = INF for i in range(Gx+1): for j in range(Gy+1): p = costs[-1][i][j] a = Gx - i b = Gy - j c = (a + b) * F score = c + p ans = min(ans, score) print(ans) if __name__ == '__main__': main()