結果
問題 | 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 |
ソースコード
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 deepcopyfrom io import BytesIO,IOBasefrom types import GeneratorTypefrom 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,dequefrom itertools import accumulate,combinations,permutations#accumulate(a)用a序列生成一个累积迭代器,一般list化前面放个[0]做前缀和用#combinations(a,k)a序列选k个 组合迭代器#permutations(a,k)a序列选k个 排列迭代器from heapq import heapify,heappop,heappush#heapify将列表转为堆from typing import Generic,Iterable,Iterator,TypeVar,Union,Listfrom string import ascii_lowercase,ascii_uppercase,digits#小写字母,大写字母,十进制数字from math import ceil,floor,sqrt,pi,factorial,gcd,log,log10,log2,inf#ceil向上取整,floor向下取整 ,sqrt开方 ,factorial阶乘from decimal import Decimal,getcontext#Decimal(s) 实例化Decimal对象,一般使用字符串#getcontext().prec=100 修改精度from sys import stdin, stdout, setrecursionlimitinput = 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) #998244353inf = 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 = nself.bit = n.bit_length()self.tree = [0]*(n+1)def add(self, index: int, delta: int) -> None:# index 必须大于0while index <= self.size:self.tree[index]+=deltaindex += index & -indexdef _query(self, index: int) -> int:res = 0while index > 0:res += self.tree[index]index -= index & -indexreturn resdef query(self, left: int, right: int) -> int:return self._query(right) - self._query(left - 1)def bisectLeft(self, k: int) -> int:"""返回第一个前缀和大于等于k的位置pos1 <= pos <= self.size + 1"""curSum, pos = 0, 0for i in range(self.bit, -1, -1):nextPos = pos + (1 << i)if nextPos <= self.size and curSum + self.tree[nextPos] < k:pos = nextPoscurSum += self.tree[pos]return pos + 1n=ii()a=li()idx=[0]*(n+1)for i,x in enumerate(a):idx[x]=ibit=BIT(n+5)res=0for 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=infif 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=-infif 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=infif 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=-infif 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)