結果

問題 No.409 ダイエット
ユーザー mkawa2mkawa2
提出日時 2023-02-08 00:10:31
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 813 ms / 2,000 ms
コード長 2,758 bytes
コンパイル時間 310 ms
コンパイル使用メモリ 87,200 KB
実行使用メモリ 200,516 KB
最終ジャッジ日時 2023-09-19 04:56:40
合計ジャッジ時間 31,962 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 78 ms
71,360 KB
testcase_01 AC 78 ms
71,356 KB
testcase_02 AC 78 ms
71,384 KB
testcase_03 AC 76 ms
71,324 KB
testcase_04 AC 80 ms
71,240 KB
testcase_05 AC 78 ms
71,496 KB
testcase_06 AC 75 ms
71,396 KB
testcase_07 AC 77 ms
71,512 KB
testcase_08 AC 78 ms
71,460 KB
testcase_09 AC 77 ms
71,324 KB
testcase_10 AC 78 ms
71,500 KB
testcase_11 AC 77 ms
71,400 KB
testcase_12 AC 77 ms
71,288 KB
testcase_13 AC 78 ms
71,148 KB
testcase_14 AC 78 ms
71,280 KB
testcase_15 AC 76 ms
71,396 KB
testcase_16 AC 74 ms
71,324 KB
testcase_17 AC 77 ms
71,300 KB
testcase_18 AC 77 ms
71,588 KB
testcase_19 AC 75 ms
71,192 KB
testcase_20 AC 79 ms
71,396 KB
testcase_21 AC 77 ms
71,592 KB
testcase_22 AC 78 ms
71,552 KB
testcase_23 AC 79 ms
71,440 KB
testcase_24 AC 77 ms
71,588 KB
testcase_25 AC 76 ms
71,408 KB
testcase_26 AC 77 ms
71,432 KB
testcase_27 AC 79 ms
71,348 KB
testcase_28 AC 78 ms
71,332 KB
testcase_29 AC 77 ms
71,192 KB
testcase_30 AC 79 ms
71,492 KB
testcase_31 AC 81 ms
71,260 KB
testcase_32 AC 77 ms
71,624 KB
testcase_33 AC 79 ms
71,260 KB
testcase_34 AC 78 ms
71,428 KB
testcase_35 AC 149 ms
78,440 KB
testcase_36 AC 130 ms
78,492 KB
testcase_37 AC 129 ms
78,348 KB
testcase_38 AC 130 ms
78,332 KB
testcase_39 AC 124 ms
78,308 KB
testcase_40 AC 136 ms
78,436 KB
testcase_41 AC 127 ms
78,400 KB
testcase_42 AC 130 ms
78,376 KB
testcase_43 AC 124 ms
78,204 KB
testcase_44 AC 123 ms
78,220 KB
testcase_45 AC 130 ms
78,268 KB
testcase_46 AC 132 ms
78,288 KB
testcase_47 AC 133 ms
78,320 KB
testcase_48 AC 126 ms
78,316 KB
testcase_49 AC 131 ms
78,292 KB
testcase_50 AC 132 ms
78,300 KB
testcase_51 AC 131 ms
78,228 KB
testcase_52 AC 131 ms
78,236 KB
testcase_53 AC 130 ms
78,532 KB
testcase_54 AC 127 ms
78,220 KB
testcase_55 AC 446 ms
132,688 KB
testcase_56 AC 360 ms
196,152 KB
testcase_57 AC 813 ms
197,052 KB
testcase_58 AC 385 ms
124,452 KB
testcase_59 AC 507 ms
130,116 KB
testcase_60 AC 371 ms
120,008 KB
testcase_61 AC 674 ms
145,880 KB
testcase_62 AC 731 ms
167,704 KB
testcase_63 AC 665 ms
145,280 KB
testcase_64 AC 436 ms
134,784 KB
testcase_65 AC 712 ms
162,184 KB
testcase_66 AC 791 ms
196,528 KB
testcase_67 AC 603 ms
139,312 KB
testcase_68 AC 501 ms
130,972 KB
testcase_69 AC 657 ms
145,148 KB
testcase_70 AC 639 ms
163,080 KB
testcase_71 AC 383 ms
117,144 KB
testcase_72 AC 798 ms
200,516 KB
testcase_73 AC 721 ms
171,184 KB
testcase_74 AC 485 ms
124,624 KB
testcase_75 AC 697 ms
187,492 KB
testcase_76 AC 539 ms
134,932 KB
testcase_77 AC 384 ms
116,988 KB
testcase_78 AC 442 ms
122,704 KB
testcase_79 AC 368 ms
118,544 KB
testcase_80 AC 754 ms
198,972 KB
testcase_81 AC 691 ms
171,240 KB
testcase_82 AC 550 ms
135,292 KB
testcase_83 AC 569 ms
135,892 KB
testcase_84 AC 509 ms
128,852 KB
testcase_85 AC 166 ms
83,328 KB
testcase_86 AC 486 ms
128,084 KB
testcase_87 AC 616 ms
163,428 KB
testcase_88 AC 327 ms
116,176 KB
testcase_89 AC 454 ms
135,740 KB
testcase_90 AC 300 ms
113,044 KB
testcase_91 AC 498 ms
139,496 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

class LiChaoTree:
    def __init__(self, xx, getmin=1):
        self._inf = (1 << 63)-1
        self._rev = getmin*2-1
        self._n = 1 << (len(xx)-1).bit_length()
        self._aa = [None]*(2*self._n)
        self._bb = [None]*(2*self._n)
        self._ll = [None]*(2*self._n)
        self._rr = [None]*(2*self._n)
        self._xtou = {}
        for u, x in enumerate(xx, self._n):
            self._ll[u] = self._rr[u] = x
            self._xtou[x] = u
        for u in range(1, self._n)[::-1]:
            self._ll[u], self._rr[u] = self._ll[u*2], self._rr[u*2+1]
            if self._rr[u] == None: self._rr[u] = self._rr[u*2]

    def add_line(self, a, b):
        u = 1
        while 1:
            if self._ll[u] == None: return
            if self._aa[u] == None:
                self._aa[u], self._bb[u] = a, b
                return
            c, d = self._aa[u], self._bb[u]
            l, r = self._ll[u], self._rr[u]
            yl, yr = a*l+b, a*r+b
            zl, zr = c*l+d, c*r+d
            if (yl-zl)*self._rev >= 0 and (yr-zr)*self._rev >= 0: return
            if (yl-zl)*self._rev <= 0 and (yr-zr)*self._rev <= 0:
                self._aa[u], self._bb[u] = a, b
                return
            if ((a-c)*self._rr[u*2]+b-d)*self._rev <= 0: a, b, self._aa[u], self._bb[u], yr, zr = c, d, a, b, zr, yr
            u = u*2+((yr-zr)*self._rev < 0)

    def __getitem__(self, x):
        if self._aa[1] == None: return self._rev*self._inf
        u = self._xtou[x]
        res = self._aa[1]*x+self._bb[1]
        while u > 1:
            if self._aa[u] != None:
                cur = self._aa[u]*x+self._bb[u]
                if (cur-res)*self._rev < 0: res = cur
            u >>= 1
        return res

n, a, b, w = LI()
dd = LI()

cht = LiChaoTree(list(range(n)))
cht.add_line(0, 2*w)

ans = w+n*(n+1)//2*b-a*n
for i, d in enumerate(dd):
    cur = (cht[i]+i*(b*(i+1)-2*a)+2*d)//2
    r = n-i-1
    ans = min(ans, cur+r*(r+1)//2*b-a*r)
    i += 1
    cht.add_line(-2*b*i, 2*cur+i*(b*(i-1)+2*a))

print(ans)
0