結果

問題 No.1371 交換門松列・松
ユーザー 已经死了已经死了
提出日時 2024-06-28 22:52:53
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 630 ms / 4,000 ms
コード長 4,199 bytes
コンパイル時間 348 ms
コンパイル使用メモリ 82,816 KB
実行使用メモリ 127,104 KB
最終ジャッジ日時 2024-06-28 22:53:09
合計ジャッジ時間 12,441 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 29
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import os,sys,random,threading
#sys.exit() 退
from random import randint,choice,shuffle
#randint(a,b)[a,b]
#choice(seq)seq,,seq
#shuffle(x)x
from copy import deepcopy
from io import BytesIO,IOBase
from types import GeneratorType
from functools import lru_cache,reduce
#reduce(op,)
from bisect import bisect_left,bisect_right
#bisect_left(x) x
#bisect_right(x) x
from collections import Counter,defaultdict,deque
from itertools import accumulate,combinations,permutations
#accumulate(a)alist[0]
#combinations(a,k)ak
#permutations(a,k)ak
from heapq import heapify,heappop,heappush
#heapify
from typing import Generic,Iterable,Iterator,TypeVar,Union,List
from string import ascii_lowercase,ascii_uppercase,digits
#
from math import ceil,floor,sqrt,pi,factorial,gcd,log,log10,log2,inf
#ceilfloor sqrt factorial
from decimal import Decimal,getcontext
#Decimal(s) Decimal,使
#getcontext().prec=100
from sys import stdin, stdout, setrecursionlimit
input = lambda: sys.stdin.readline().rstrip("\r\n")
MI = lambda :map(int,input().split())
li = lambda :list(MI())
ii = lambda :int(input())
mod = int(1e9 + 7) #998244353
inf = int(1e20)
py = lambda :print("YES")
pn = lambda :print("NO")
DIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)] #
DIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),(-1, 1)] # →↘↓↙←↖↑↗
class BIT:
""","""
__slots__ = "size", "bit", "tree"
def __init__(self, n: int):
self.size = n
self.bit = n.bit_length()
self.tree = [0]*(n+1)
def add(self, index: int, delta: int) -> None:
# index 0
while index <= self.size:
self.tree[index]+=delta
index += index & -index
def _query(self, index: int) -> int:
res = 0
while index > 0:
res += self.tree[index]
index -= index & -index
return res
def query(self, left: int, right: int) -> int:
return self._query(right) - self._query(left - 1)
def bisectLeft(self, k: int) -> int:
"""kpos
1 <= pos <= self.size + 1
"""
curSum, pos = 0, 0
for i in range(self.bit, -1, -1):
nextPos = pos + (1 << i)
if nextPos <= self.size and curSum + self.tree[nextPos] < k:
pos = nextPos
curSum += self.tree[pos]
return pos + 1
n=ii()
a=li()
idx=[0]*(n+1)
for i,x in enumerate(a):
idx[x]=i
bit=BIT(n+5)
res=0
for x in range(1,n+1):
i=idx[x]
if (i==0 or a[i-1]>x) and (i==n-1 or a[i+1]>x):
res+=bit.query(x+1,n+3)
mi=inf
if i!=0:
mi=min(mi,a[i-1])
if i!=n-1:
mi=min(mi,a[i+1])
bit.add(mi,1)
bit=BIT(n+5)
for x in range(n,0,-1):
i=idx[x]
if (i==0 or a[i-1]<x) and (i==n-1 or a[i+1]<x):
res+=bit._query(x-1)
mx=-inf
if i!=0:
mx=max(mx,a[i-1])
if i!=n-1:
mx=max(mx,a[i+1])
bit.add(mx,1)
b=[]
c=[]
for x in range(1,n+1):
i=idx[x]
if (i==0 or a[i-1]>x) and (i==n-1 or a[i+1]>x):
mi=inf
if i!=0:
mi=min(mi,a[i-1])
if i!=n-1:
mi=min(mi,a[i+1])
c.append([x,mi])
if (i==0 or a[i-1]<x) and (i==n-1 or a[i+1]<x):
mx=-inf
if i!=0:
mx=max(mx,a[i-1])
if i!=n-1:
mx=max(mx,a[i+1])
b.append([x,mx])
bit=BIT(n+5)
c.sort(key=lambda x:x[1])
b.sort(key=lambda x:-x[0])
for ci,cj in c:
while b and b[-1][0]<cj:
bi,bj=b.pop()
bit.add(bj,1)
res+=bit._query(ci-1)
print(res)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0