結果
問題 | No.2150 Site Supporter |
ユーザー | McGregorsh |
提出日時 | 2023-03-18 23:11:42 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 249 ms / 2,000 ms |
コード長 | 1,740 bytes |
コンパイル時間 | 246 ms |
コンパイル使用メモリ | 81,828 KB |
実行使用メモリ | 125,580 KB |
最終ジャッジ日時 | 2023-10-18 17:36:11 |
合計ジャッジ時間 | 7,888 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 147 ms
88,544 KB |
testcase_01 | AC | 146 ms
88,548 KB |
testcase_02 | AC | 146 ms
88,548 KB |
testcase_03 | AC | 146 ms
88,552 KB |
testcase_04 | AC | 147 ms
88,548 KB |
testcase_05 | AC | 147 ms
88,548 KB |
testcase_06 | AC | 146 ms
88,548 KB |
testcase_07 | AC | 149 ms
88,548 KB |
testcase_08 | AC | 167 ms
90,520 KB |
testcase_09 | AC | 249 ms
123,224 KB |
testcase_10 | AC | 207 ms
110,216 KB |
testcase_11 | AC | 232 ms
120,844 KB |
testcase_12 | AC | 186 ms
105,056 KB |
testcase_13 | AC | 170 ms
92,160 KB |
testcase_14 | AC | 148 ms
88,548 KB |
testcase_15 | AC | 147 ms
88,548 KB |
testcase_16 | AC | 148 ms
88,552 KB |
testcase_17 | AC | 248 ms
125,580 KB |
testcase_18 | AC | 196 ms
106,296 KB |
testcase_19 | AC | 174 ms
90,336 KB |
testcase_20 | AC | 207 ms
117,768 KB |
testcase_21 | AC | 164 ms
89,380 KB |
testcase_22 | AC | 245 ms
123,224 KB |
testcase_23 | AC | 147 ms
88,540 KB |
testcase_24 | AC | 148 ms
88,540 KB |
testcase_25 | AC | 146 ms
88,544 KB |
testcase_26 | AC | 146 ms
88,544 KB |
testcase_27 | AC | 202 ms
113,644 KB |
testcase_28 | AC | 196 ms
113,236 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()