結果

問題 No.2950 Max Min Product
ユーザー mkawa2mkawa2
提出日時 2024-10-25 23:12:15
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 6,984 bytes
コンパイル時間 359 ms
コンパイル使用メモリ 82,516 KB
実行使用メモリ 148,012 KB
最終ジャッジ日時 2024-10-25 23:13:29
合計ジャッジ時間 73,983 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 42 ms
53,484 KB
testcase_01 AC 39 ms
54,116 KB
testcase_02 AC 43 ms
54,520 KB
testcase_03 AC 1,382 ms
121,952 KB
testcase_04 AC 1,476 ms
126,160 KB
testcase_05 AC 1,411 ms
122,668 KB
testcase_06 AC 1,909 ms
142,224 KB
testcase_07 AC 1,945 ms
141,884 KB
testcase_08 AC 1,953 ms
141,892 KB
testcase_09 AC 1,079 ms
104,732 KB
testcase_10 AC 1,813 ms
135,288 KB
testcase_11 AC 1,561 ms
124,336 KB
testcase_12 AC 1,992 ms
140,988 KB
testcase_13 AC 1,958 ms
141,736 KB
testcase_14 AC 2,059 ms
141,452 KB
testcase_15 AC 2,108 ms
139,796 KB
testcase_16 AC 1,572 ms
121,932 KB
testcase_17 AC 1,694 ms
124,688 KB
testcase_18 AC 2,139 ms
141,948 KB
testcase_19 AC 2,146 ms
142,016 KB
testcase_20 AC 2,110 ms
142,316 KB
testcase_21 AC 1,250 ms
106,656 KB
testcase_22 AC 1,672 ms
127,568 KB
testcase_23 AC 1,130 ms
104,376 KB
testcase_24 AC 2,155 ms
144,024 KB
testcase_25 AC 2,111 ms
143,960 KB
testcase_26 AC 2,266 ms
144,856 KB
testcase_27 AC 2,258 ms
128,052 KB
testcase_28 TLE -
testcase_29 AC 2,206 ms
126,756 KB
testcase_30 AC 2,949 ms
142,800 KB
testcase_31 AC 2,734 ms
147,880 KB
testcase_32 AC 2,964 ms
144,008 KB
testcase_33 AC 1,785 ms
113,416 KB
testcase_34 AC 1,306 ms
97,680 KB
testcase_35 AC 1,748 ms
110,660 KB
testcase_36 AC 2,221 ms
117,152 KB
testcase_37 AC 2,184 ms
116,672 KB
testcase_38 AC 2,287 ms
118,036 KB
権限があれば一括ダウンロードができます

ソースコード

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 LazySegTree:
    def __init__(self, op, e, mapping, composition, _id, v):
        self._op = op
        self._e = e
        self._mapping = mapping
        self._composition = composition
        self._id = _id

        if isinstance(v, int):
            v = [e]*v

        self._n = len(v)
        self._log = (self._n-1).bit_length()
        self._size = 1 << self._log
        self._d = [self._e]*(2*self._size)
        self._lz = [self._id]*self._size
        for i in range(self._n):
            self._d[self._size+i] = v[i]
        for i in range(self._size-1, 0, -1):
            self._update(i)

    def set(self, p, x):
        p += self._size
        for i in range(self._log, 0, -1):
            self._push(p >> i)
        self._d[p] = x
        for i in range(1, self._log+1):
            self._update(p >> i)

    def get(self, p):
        p += self._size
        for i in range(self._log, 0, -1):
            self._push(p >> i)
        return self._d[p]

    def prod(self, left, right):
        if left == right:
            return self._e

        left += self._size
        right += self._size

        for i in range(self._log, 0, -1):
            if ((left >> i) << i) != left:
                self._push(left >> i)
            if ((right >> i) << i) != right:
                self._push(right >> i)

        sml = self._e
        smr = self._e
        while left < right:
            if left & 1:
                sml = self._op(sml, self._d[left])
                left += 1
            if right & 1:
                right -= 1
                smr = self._op(self._d[right], smr)
            left >>= 1
            right >>= 1

        return self._op(sml, smr)

    def all_prod(self):
        return self._d[1]

    def apply(self, left, right, f):
        if right is None:
            p = left
            p += self._size
            for i in range(self._log, 0, -1):
                self._push(p >> i)
            self._d[p] = self._mapping(f, self._d[p])
            for i in range(1, self._log+1):
                self._update(p >> i)
        else:
            if left == right:
                return

            left += self._size
            right += self._size

            for i in range(self._log, 0, -1):
                if ((left >> i) << i) != left:
                    self._push(left >> i)
                if ((right >> i) << i) != right:
                    self._push((right-1) >> i)

            l2 = left
            r2 = right
            while left < right:
                if left & 1:
                    self._all_apply(left, f)
                    left += 1
                if right & 1:
                    right -= 1
                    self._all_apply(right, f)
                left >>= 1
                right >>= 1
            left = l2
            right = r2

            for i in range(1, self._log+1):
                if ((left >> i) << i) != left:
                    self._update(left >> i)
                if ((right >> i) << i) != right:
                    self._update((right-1) >> i)

    def max_right(self, left, g):
        if left == self._n:
            return self._n

        left += self._size
        for i in range(self._log, 0, -1):
            self._push(left >> i)

        sm = self._e
        first = True
        while first or (left & -left) != left:
            first = False
            while left%2 == 0:
                left >>= 1
            if not g(self._op(sm, self._d[left])):
                while left < self._size:
                    self._push(left)
                    left *= 2
                    if g(self._op(sm, self._d[left])):
                        sm = self._op(sm, self._d[left])
                        left += 1
                return left-self._size
            sm = self._op(sm, self._d[left])
            left += 1

        return self._n

    def min_left(self, right, g):
        if right == 0:
            return 0

        right += self._size
        for i in range(self._log, 0, -1):
            self._push((right-1) >> i)

        sm = self._e
        first = True
        while first or (right & -right) != right:
            first = False
            right -= 1
            while right > 1 and right%2:
                right >>= 1
            if not g(self._op(self._d[right], sm)):
                while right < self._size:
                    self._push(right)
                    right = 2*right+1
                    if g(self._op(self._d[right], sm)):
                        sm = self._op(self._d[right], sm)
                        right -= 1
                return right+1-self._size
            sm = self._op(self._d[right], sm)

        return 0

    def _update(self, k):
        self._d[k] = self._op(self._d[2*k], self._d[2*k+1])

    def _all_apply(self, k, f):
        self._d[k] = self._mapping(f, self._d[k])
        if k < self._size:
            self._lz[k] = self._composition(f, self._lz[k])

    def _push(self, k):
        self._all_apply(2*k, self._lz[k])
        self._all_apply(2*k+1, self._lz[k])
        self._lz[k] = self._id

# treeのマージ
# 32bit以上を区間長とした例
def op(x, y):
    return x+y

# treeの単位元
e = 0

# lazy(f)からtree(x)への操作
def mapping(f, x):
    if f==None:return x
    c=x%(1<<20)
    return (f*c)<<20|c


# lazyの下への分解
def composition(f, g):
    if f==None:return g
    return f

# lazyの単位元
_id = None

# 配列の初期値(サイズか配列そのもの)が最後

n=II()
aa=LI()

mns = LazySegTree(op, e, mapping, composition, _id, [1]*n)
mxs = LazySegTree(op, e, mapping, composition, _id, [1]*n)

mn=[]
mx=[]
s=0
ans=0
for i,a in enumerate(aa):
    c=1
    l=i
    t=0
    while mn and mn[-1][0]>=a:
        pa,pc=mn.pop()
        l-=pc
        cur=mxs.prod(l,l+pc)>>20
        s-=pa*cur
        c+=pc
        t+=cur
    s+=t*a
    mns.apply(l,i+1,a)
    mn.append((a,c))

    c=1
    l=i
    t=0
    while mx and mx[-1][0]<=a:
        pa,pc=mx.pop()
        l-=pc
        cur=mns.prod(l,l+pc)>>20
        s-=pa*cur
        c+=pc
        t+=cur
    s+=t*a
    mxs.apply(l,i+1,a)
    mx.append((a,c))

    s+=a*a
    ans+=s
    s%=md
    ans%=md
    # print(i,a,s,ans,mn,mx)

print(ans)
0