結果

問題 No.2950 Max Min Product
ユーザー nouka28nouka28
提出日時 2024-10-24 22:07:22
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,272 ms / 3,000 ms
コード長 7,225 bytes
コンパイル時間 385 ms
コンパイル使用メモリ 82,524 KB
実行使用メモリ 162,084 KB
最終ジャッジ日時 2024-10-25 23:30:18
合計ジャッジ時間 59,041 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 70 ms
68,936 KB
testcase_01 AC 66 ms
68,948 KB
testcase_02 AC 69 ms
70,128 KB
testcase_03 AC 1,041 ms
140,000 KB
testcase_04 AC 1,113 ms
145,128 KB
testcase_05 AC 1,060 ms
141,060 KB
testcase_06 AC 1,397 ms
151,200 KB
testcase_07 AC 1,402 ms
150,764 KB
testcase_08 AC 1,405 ms
150,664 KB
testcase_09 AC 906 ms
120,116 KB
testcase_10 AC 1,406 ms
152,376 KB
testcase_11 AC 1,234 ms
146,836 KB
testcase_12 AC 1,560 ms
152,296 KB
testcase_13 AC 1,551 ms
153,168 KB
testcase_14 AC 1,556 ms
152,404 KB
testcase_15 AC 1,654 ms
149,380 KB
testcase_16 AC 1,307 ms
140,776 KB
testcase_17 AC 1,438 ms
144,972 KB
testcase_18 AC 1,748 ms
151,640 KB
testcase_19 AC 1,715 ms
151,532 KB
testcase_20 AC 1,713 ms
151,508 KB
testcase_21 AC 1,117 ms
127,360 KB
testcase_22 AC 1,415 ms
148,796 KB
testcase_23 AC 1,062 ms
124,288 KB
testcase_24 AC 1,718 ms
156,960 KB
testcase_25 AC 1,722 ms
157,024 KB
testcase_26 AC 1,721 ms
157,160 KB
testcase_27 AC 1,653 ms
145,336 KB
testcase_28 AC 2,243 ms
161,288 KB
testcase_29 AC 1,721 ms
147,820 KB
testcase_30 AC 2,259 ms
157,292 KB
testcase_31 AC 2,145 ms
162,084 KB
testcase_32 AC 2,272 ms
157,852 KB
testcase_33 AC 1,508 ms
134,284 KB
testcase_34 AC 1,190 ms
112,600 KB
testcase_35 AC 1,475 ms
131,980 KB
testcase_36 AC 1,942 ms
135,764 KB
testcase_37 AC 1,898 ms
135,140 KB
testcase_38 AC 1,909 ms
136,808 KB
testcase_39 AC 66 ms
69,104 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import typing

def _ceil_pow2(n: int) -> int:
    x = 0
    while (1 << x) < n:
        x += 1

    return x


def _bsf(n: int) -> int:
    x = 0
    while n % 2 == 0:
        x += 1
        n //= 2

    return x

class LazySegTree:
    def __init__(
            self,
            op: typing.Callable[[typing.Any, typing.Any], typing.Any],
            e: typing.Any,
            mapping: typing.Callable[[typing.Any, typing.Any], typing.Any],
            composition: typing.Callable[[typing.Any, typing.Any], typing.Any],
            id_: typing.Any,
            v: typing.Union[int, typing.List[typing.Any]]) -> None:
        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 = _ceil_pow2(self._n)
        self._size = 1 << self._log
        self._d = [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: int, x: typing.Any) -> None:
        assert 0 <= p < self._n

        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: int) -> typing.Any:
        assert 0 <= p < self._n

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

    def prod(self, left: int, right: int) -> typing.Any:
        assert 0 <= left <= right <= self._n

        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) -> typing.Any:
        return self._d[1]

    def apply(self, left: int, right: typing.Optional[int] = None,
              f: typing.Optional[typing.Any] = None) -> None:
        assert f is not None

        if right is None:
            p = left
            assert 0 <= left < self._n

            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:
            assert 0 <= left <= right <= self._n
            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: int, g: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= left <= self._n
        assert g(self._e)

        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: int, g: typing.Any) -> int:
        assert 0 <= right <= self._n
        assert g(self._e)

        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: int) -> None:
        self._d[k] = self._op(self._d[2 * k], self._d[2 * k + 1])

    def _all_apply(self, k: int, f: typing.Any) -> None:
        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: int) -> None:
        self._all_apply(2 * k, self._lz[k])
        self._all_apply(2 * k + 1, self._lz[k])
        self._lz[k] = self._id

mod=998244353

def op(x,y):
    return ((x[0]+y[0])%mod,x[1]+y[1])

e=(0,0)

def mapping(f,x):
    if f==-1:return x
    else:return ((f*x[1])%mod,x[1])

def composition(f,g):
    if f==-1:return g
    else:return f

id=-1

N=int(input())
A=list(map(int,input().split()))

inc=[]
dec=[]

seg_inc=LazySegTree(op,e,mapping,composition,id,N)
seg_dec=LazySegTree(op,e,mapping,composition,id,N)

ans=0
sum=0

for i in range(N):
    for j in range(2):
        L=i
        while len(inc)and (inc[-1][0]<=A[i])^j:
            x,l=inc.pop()
            sum-=x*seg_dec.prod(l,L)[0]
            sum%=mod
            L=l
        inc.append((A[i],L))
        seg_inc.apply(L,i,A[i])
        sum+=A[i]*seg_dec.prod(L,i)[0]
        sum%=mod
        seg_inc.set(i,(A[i],1))
        inc,dec=dec,inc
        seg_inc,seg_dec=seg_dec,seg_inc
    
    sum+=A[i]*A[i]
    sum%=mod
    ans+=sum
    ans%=mod

print(ans)
0