結果
問題 | No.318 学学学学学 |
ユーザー |
|
提出日時 | 2024-06-26 22:06:49 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 378 ms / 2,000 ms |
コード長 | 9,174 bytes |
コンパイル時間 | 145 ms |
コンパイル使用メモリ | 82,504 KB |
実行使用メモリ | 111,360 KB |
最終ジャッジ日時 | 2024-06-26 22:07:00 |
合計ジャッジ時間 | 9,203 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
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)] # →↘↓↙←↖↑↗import os,sys,random,threading#sys.exit() 退出程序#sys.setrecursionlimit(10**6) #调整栈空间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 = 1<<60py = 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", "_tree1", "_tree2"def __init__(self, n: int):self.size = nself._tree1 = [0]*(n+1)self._tree2 = [0]*(n+1)def add(self, left: int, right: int, delta: int) -> None:"""闭区间[left, right]加delta"""self._add(left, delta)self._add(right + 1, -delta)def query(self, left: int, right: int) -> int:"""闭区间[left, right]的和"""return self._query(right) - self._query(left - 1)def _add(self, index: int, delta: int) -> None:rawIndex = indexwhile index <= self.size:self._tree1[index] += deltaself._tree2[index] += (rawIndex - 1) * deltaindex += index & -indexdef _query(self, index: int) -> int:if index > self.size:index = self.sizerawIndex = indexres = 0while index > 0:res += rawIndex * self._tree1[index] - self._tree2[index]index -= index & -indexreturn resclass HLD:def __init__(self, g, root):#无论是点还是dfn还是dep,都从1开始,默认0是无n=len(g)self.g=gself.fa=[0]*(n+5) #父节点,0表示无父节点self.size=[1]*(n+5) #子树大小self.dep=[0]*(n+5) #深度,根深度为1self.son=[0]*(n+5) #重儿子,0表示无儿子self.dfn=[0]*(n+5) #dfs序,子树终点的dfs序是dfn[i]+size[i]-1self.top=[0]*(n+5) #所在重链起点,起点就是自己self.rank=[0]*(n+5) #dfs序为i的节点编号fa=self.fa;size=self.size;dep=self.dep;son=self.sondfn=self.dfn;top=self.top;rank=self.rankstk=[[root,0,0]] #node,flag,fadep[root]=1while stk:u,flag,father=stk.pop()if flag:for v in g[u]:if v!=father:size[u]+=size[v]if son[u]==0 or size[v]>size[son[u]]:son[u]=velse:stk.append([u,1,father])for v in g[u]:if v!=father:stk.append([v,0,u])fa[v]=udep[v]=dep[u]+1stk=[[root,root]]tot=1while stk:u,tops=stk.pop()dfn[u]=totrank[tot]=utot+=1top[u]=topsif son[u]==0:continuefor v in g[u]:if v!=fa[u] and v!=son[u]:stk.append([v,v])stk.append([son[u],tops])def lca(self,u,v): #求u和v的最近公共祖先节点fa=self.fa;size=self.size;dep=self.dep;son=self.sondfn=self.dfn;top=self.top;rank=self.rankwhile top[u]!=top[v]:if dep[top[u]]>dep[top[v]]:u=fa[top[u]]else:v=fa[top[v]]return v if dep[u]>dep[v] else udef dis(self,u,v):dep=self.depreturn dep[u]+dep[v]-2*dep[self.lca(u,v)]def kth_fa(self,root,k): #求root节点的第k个祖先fa=self.fa;size=self.size;dep=self.dep;son=self.sondfn=self.dfn;top=self.top;rank=self.rankif k>=dep[root]: #无第k个祖先返回-1return -1while True:u=top[root]if dfn[root]-k>=dfn[u]:return rank[dfn[root]-k]k-=dfn[root]-dfn[u]+1root=fa[u]def route_query(self,u,v): #查询u到v简单路径fa=self.fa;size=self.size;dep=self.dep;son=self.sondfn=self.dfn;top=self.top;rank=self.rankroute=[]while top[u]!=top[v]:if dep[top[u]]<dep[top[v]]:u,v=v,uroute.append((dfn[top[u]],dfn[u]))u=fa[top[u]]if dep[u]>dep[v]:u,v=v,uroute.append((dfn[u],dfn[v]))return routedef path(self,start,end): #得到start到end简单路径的所有节点fa=self.fa;size=self.size;dep=self.dep;son=self.sondfn=self.dfn;top=self.top;rank=self.rankmid=self.lca(start,end)ps=[]while start!=mid:ps.append(start)start=fa[start]pe=[]while end!=mid:pe.append(end)end=fa[end]return ps+[mid]+pe[::-1]class chain:def __init__(self,n):#维护每个节点的前驱后继,初始时每个点的前驱和后继都是自己self.nxtfa=list(range(n+2))self.prefa=list(range(n+2))def nxt(self,x):t=x;fa=self.nxtfawhile fa[x]!=x:x=fa[x]while t!=x:fa[t],t=x,fa[t]return xdef pre(self,x):t=x;fa=self.prefawhile fa[x]!=x:x=fa[x]while t!=x:fa[t],t=x,fa[t]return xdef remove(self,x):self.nxtfa[x]=self.nxt(x+1)self.prefa[x]=self.pre(x-1)n=ii()a=li()d=defaultdict(list)for i,x in enumerate(a):d[x].append(i+1)un=chain(n+5)res=[0]*(n+1)for x in sorted(d.keys(),reverse=True):st=d[x][0]ed=d[x][-1]idx=un.nxt(st)while idx<=ed:res[idx]=xun.remove(idx)idx=un.nxt(idx+1)print(*res[1:])