結果
問題 | No.2150 Site Supporter |
ユーザー | McGregorsh |
提出日時 | 2023-03-18 23:11:42 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 255 ms / 2,000 ms |
コード長 | 1,740 bytes |
コンパイル時間 | 177 ms |
コンパイル使用メモリ | 82,220 KB |
実行使用メモリ | 126,268 KB |
最終ジャッジ日時 | 2024-09-18 13:36:59 |
合計ジャッジ時間 | 7,630 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 146 ms
89,472 KB |
testcase_01 | AC | 162 ms
89,436 KB |
testcase_02 | AC | 148 ms
89,472 KB |
testcase_03 | AC | 148 ms
89,236 KB |
testcase_04 | AC | 151 ms
89,216 KB |
testcase_05 | AC | 147 ms
89,344 KB |
testcase_06 | AC | 147 ms
89,088 KB |
testcase_07 | AC | 149 ms
89,472 KB |
testcase_08 | AC | 186 ms
90,880 KB |
testcase_09 | AC | 247 ms
124,032 KB |
testcase_10 | AC | 207 ms
110,592 KB |
testcase_11 | AC | 238 ms
121,472 KB |
testcase_12 | AC | 189 ms
105,728 KB |
testcase_13 | AC | 170 ms
92,544 KB |
testcase_14 | AC | 148 ms
89,048 KB |
testcase_15 | AC | 149 ms
89,600 KB |
testcase_16 | AC | 151 ms
89,344 KB |
testcase_17 | AC | 249 ms
126,268 KB |
testcase_18 | AC | 196 ms
107,128 KB |
testcase_19 | AC | 171 ms
90,672 KB |
testcase_20 | AC | 214 ms
118,144 KB |
testcase_21 | AC | 172 ms
89,856 KB |
testcase_22 | AC | 255 ms
124,032 KB |
testcase_23 | AC | 149 ms
89,436 KB |
testcase_24 | AC | 149 ms
89,600 KB |
testcase_25 | AC | 150 ms
89,344 KB |
testcase_26 | AC | 149 ms
89,216 KB |
testcase_27 | AC | 199 ms
114,176 KB |
testcase_28 | AC | 196 ms
113,640 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, K, X = i_map() A = i_list() dp = [[INF] * 3 for i in range(N+1)] dp[0][0] = 0 for i in range(N): point = A[i] dp[i+1][0] = min(dp[i+1][0], dp[i][0] + point, dp[i] [1] + point, dp[i][2] + point) dp[i+1][1] = min(dp[i+1][1], dp[i][0] + K + X) dp[i+1][2] = min(dp[i+1][2], dp[i][1] + K, dp[i][2] + K) #print(dp) print(min(dp[-1])) if __name__ == '__main__': main()