結果

問題 No.1435 Mmm......
ユーザー mkawa2mkawa2
提出日時 2022-07-19 23:50:21
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,020 ms / 2,000 ms
コード長 4,362 bytes
コンパイル時間 286 ms
コンパイル使用メモリ 86,776 KB
実行使用メモリ 140,688 KB
最終ジャッジ日時 2023-09-14 20:51:24
合計ジャッジ時間 19,219 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 161 ms
80,700 KB
testcase_01 AC 162 ms
80,748 KB
testcase_02 AC 164 ms
80,428 KB
testcase_03 AC 165 ms
80,532 KB
testcase_04 AC 161 ms
80,344 KB
testcase_05 AC 164 ms
80,572 KB
testcase_06 AC 613 ms
131,996 KB
testcase_07 AC 623 ms
129,404 KB
testcase_08 AC 639 ms
131,280 KB
testcase_09 AC 673 ms
131,684 KB
testcase_10 AC 620 ms
133,680 KB
testcase_11 AC 619 ms
133,572 KB
testcase_12 AC 622 ms
133,260 KB
testcase_13 AC 618 ms
132,568 KB
testcase_14 AC 535 ms
113,512 KB
testcase_15 AC 661 ms
132,524 KB
testcase_16 AC 658 ms
130,996 KB
testcase_17 AC 515 ms
115,184 KB
testcase_18 AC 706 ms
133,172 KB
testcase_19 AC 638 ms
132,960 KB
testcase_20 AC 696 ms
131,732 KB
testcase_21 AC 616 ms
131,892 KB
testcase_22 AC 1,020 ms
140,688 KB
testcase_23 AC 691 ms
134,716 KB
testcase_24 AC 679 ms
133,772 KB
testcase_25 AC 683 ms
132,880 KB
testcase_26 AC 738 ms
133,644 KB
testcase_27 AC 700 ms
134,556 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

import typing

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 = (self._n-1).bit_length()
        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 op(a, b):
    mm = [a[0], a[1], b[0], b[1]]
    mm.sort()
    return (mm[0], mm[1], max(a[2], b[2]))

e = (inf, inf, -inf)

n = II()
aa = LI()

st = SegTree(op, e, [(a, inf, a) for a in aa])

l = 0
ans = 0
for r in range(2, n+1):
    while l < r-1:
        m1, m2, M = st.prod(l, r)
        if m1+m2 >= M: break
        l += 1
    ans += r-l-1

print(ans)
0