結果

問題 No.2404 Vertical Throw Up
コンテスト
ユーザー mkawa2
提出日時 2025-07-29 21:45:31
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 236 ms / 2,000 ms
コード長 2,861 bytes
コンパイル時間 394 ms
コンパイル使用メモリ 82,836 KB
実行使用メモリ 99,400 KB
最終ジャッジ日時 2025-07-29 21:45:36
合計ジャッジ時間 5,265 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(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-(-1 << 31)
inf = -1-(-1 << 62)

# 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

a = II()
Q = II()
qst = []
tt = []
for _ in range(Q):
    q, *st = LI()
    if q == 1:
        s, t = st
    else:
        s, t = st[0], 0
        tt.append(s)
    qst.append((q, s, t))
lct = LiChaoTree(tt, 0)

# -a(x-s)(x-t)
# =-ax2+a(s+t)x-ast
for q, s, t in qst:
    if q == 1:
        lct.add_line(a*(s+t), -a*s*t)
    else:
        print(max(0,lct[s]+-a*s*s))
0