結果

問題 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
権限があれば一括ダウンロードができます

ソースコード

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)] # →↘↓↙←↖↑↗
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 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 = 1<<60
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", "_tree1", "_tree2"
def __init__(self, n: int):
self.size = n
self._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 = index
while index <= self.size:
self._tree1[index] += delta
self._tree2[index] += (rawIndex - 1) * delta
index += index & -index
def _query(self, index: int) -> int:
if index > self.size:
index = self.size
rawIndex = index
res = 0
while index > 0:
res += rawIndex * self._tree1[index] - self._tree2[index]
index -= index & -index
return res
class HLD:
def __init__(self, g, root):
#dfndep10
n=len(g)
self.g=g
self.fa=[0]*(n+5) #0
self.size=[1]*(n+5) #
self.dep=[0]*(n+5) #1
self.son=[0]*(n+5) #0
self.dfn=[0]*(n+5) #dfsdfsdfn[i]+size[i]-1
self.top=[0]*(n+5) #
self.rank=[0]*(n+5) #dfsi
fa=self.fa;size=self.size;dep=self.dep;son=self.son
dfn=self.dfn;top=self.top;rank=self.rank
stk=[[root,0,0]] #node,flag,fa
dep[root]=1
while 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]=v
else:
stk.append([u,1,father])
for v in g[u]:
if v!=father:
stk.append([v,0,u])
fa[v]=u
dep[v]=dep[u]+1
stk=[[root,root]]
tot=1
while stk:
u,tops=stk.pop()
dfn[u]=tot
rank[tot]=u
tot+=1
top[u]=tops
if son[u]==0:
continue
for 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): #uv
fa=self.fa;size=self.size;dep=self.dep;son=self.son
dfn=self.dfn;top=self.top;rank=self.rank
while 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 u
def dis(self,u,v):
dep=self.dep
return dep[u]+dep[v]-2*dep[self.lca(u,v)]
def kth_fa(self,root,k): #rootk
fa=self.fa;size=self.size;dep=self.dep;son=self.son
dfn=self.dfn;top=self.top;rank=self.rank
if k>=dep[root]: #k-1
return -1
while True:
u=top[root]
if dfn[root]-k>=dfn[u]:
return rank[dfn[root]-k]
k-=dfn[root]-dfn[u]+1
root=fa[u]
def route_query(self,u,v): #uv
fa=self.fa;size=self.size;dep=self.dep;son=self.son
dfn=self.dfn;top=self.top;rank=self.rank
route=[]
while top[u]!=top[v]:
if dep[top[u]]<dep[top[v]]:
u,v=v,u
route.append((dfn[top[u]],dfn[u]))
u=fa[top[u]]
if dep[u]>dep[v]:
u,v=v,u
route.append((dfn[u],dfn[v]))
return route
def path(self,start,end): #startend
fa=self.fa;size=self.size;dep=self.dep;son=self.son
dfn=self.dfn;top=self.top;rank=self.rank
mid=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.nxtfa
while fa[x]!=x:
x=fa[x]
while t!=x:
fa[t],t=x,fa[t]
return x
def pre(self,x):
t=x;fa=self.prefa
while fa[x]!=x:
x=fa[x]
while t!=x:
fa[t],t=x,fa[t]
return x
def 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]=x
un.remove(idx)
idx=un.nxt(idx+1)
print(*res[1:])
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0