結果

問題 No.1435 Mmm......
ユーザー yuusanlondonyuusanlondon
提出日時 2021-03-19 23:44:07
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 815 ms / 2,000 ms
コード長 4,044 bytes
コンパイル時間 260 ms
コンパイル使用メモリ 82,228 KB
実行使用メモリ 131,880 KB
最終ジャッジ日時 2024-11-19 02:33:33
合計ジャッジ時間 12,021 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 65 ms
67,712 KB
testcase_01 AC 64 ms
67,968 KB
testcase_02 AC 69 ms
67,712 KB
testcase_03 AC 66 ms
67,840 KB
testcase_04 AC 65 ms
67,584 KB
testcase_05 AC 66 ms
67,712 KB
testcase_06 AC 383 ms
102,416 KB
testcase_07 AC 413 ms
115,552 KB
testcase_08 AC 441 ms
125,456 KB
testcase_09 AC 462 ms
119,392 KB
testcase_10 AC 437 ms
114,984 KB
testcase_11 AC 392 ms
114,780 KB
testcase_12 AC 436 ms
111,964 KB
testcase_13 AC 402 ms
111,644 KB
testcase_14 AC 324 ms
92,444 KB
testcase_15 AC 477 ms
125,708 KB
testcase_16 AC 444 ms
115,944 KB
testcase_17 AC 359 ms
93,728 KB
testcase_18 AC 507 ms
125,888 KB
testcase_19 AC 409 ms
111,880 KB
testcase_20 AC 442 ms
119,580 KB
testcase_21 AC 482 ms
131,404 KB
testcase_22 AC 815 ms
125,352 KB
testcase_23 AC 482 ms
131,660 KB
testcase_24 AC 507 ms
131,636 KB
testcase_25 AC 510 ms
131,880 KB
testcase_26 AC 520 ms
131,476 KB
testcase_27 AC 495 ms
131,828 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import typing
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
INF=10**9+1
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 SegTree:
    def __init__(self,
                 op: typing.Callable[[typing.Any, typing.Any], typing.Any],
                 e: typing.Any,
                 v: typing.Union[int, typing.List[typing.Any]]) -> None:
        self._op = op
        self._e = e

        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)

        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
        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

        return self._d[p + self._size]

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

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

        if left == self._n:
            return self._n

        left += self._size
        sm = self._e

        first = True
        while first or (left & -left) != left:
            first = False
            while left % 2 == 0:
                left >>= 1
            if not f(self._op(sm, self._d[left])):
                while left < self._size:
                    left *= 2
                    if f(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,
                 f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= right <= self._n
        assert f(self._e)

        if right == 0:
            return 0

        right += self._size
        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 f(self._op(self._d[right], sm)):
                while right < self._size:
                    right = 2 * right + 1
                    if f(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 combin(pair1,pair2):
  x1,y1=pair1
  x2,y2=pair2
  r=[x1,x2,y1,y2]
  r.sort()
  return(r[0],r[1])
n=int(input())
a=list(map(int,input().split()))
k=[]
for i in range(n):
  k.append((a[i],INF))
segtree1=SegTree(combin,(INF,INF),k)
segtree2=SegTree(max,0,a)
ans=0
pointer=0
for i in range(1,n):
  while pointer<i-1:
    x,y=segtree1.prod(pointer,i+1)
    m=segtree2.prod(pointer,i+1)
    if x+y>=m:
      break
    pointer+=1
  ans+=i-pointer
print(ans)
0