結果

問題 No.1170 Never Want to Walk
ユーザー 👑 Kazun
提出日時 2020-08-15 16:50:38
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 478 ms / 2,000 ms
コード長 3,479 bytes
コンパイル時間 289 ms
コンパイル使用メモリ 82,140 KB
実行使用メモリ 105,468 KB
最終ジャッジ日時 2024-10-10 18:12:10
合計ジャッジ時間 8,383 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 37
権限があれば一括ダウンロードができます

ソースコード

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

def Binary_Search_Small_Count(A,x,equal=False,sort=False):
"""2,x調.
A:
x:調
sort:(True)
equal:Truex""x""
"""
if sort:
A.sort()
N=len(A)
if A[-1]<x:
return N
elif x<A[0] or (not equal and x==A[0]):
return 0
L,R=0,N
while R-L>1:
C=L+(R-L)//2
if x<A[C] or (not equal and x==A[C]):
R=C
else:
L=C
return R
#------------------------------------------------
class Union_Find():
def __init__(self,N):
"""0,1,...,n-1.
n:
"""
self.n=N
self.parents=[-1]*N
self.rank=[0]*N
def find(self, x):
"""x調.
x:
"""
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
"""x,y.
x,y:
"""
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.rank[x]>self.rank[y]:
self.parents[x] += self.parents[y]
self.parents[y] = x
else:
self.parents[y] += self.parents[x]
self.parents[x] = y
if self.rank[x]==self.rank[y]:
self.rank[y]+=1
def size(self, x):
"""x.
x:
"""
return -self.parents[self.find(x)]
def same(self, x, y):
"""x,y?
x,y:
"""
return self.find(x) == self.find(y)
def members(self, x):
"""x.
size使!!
x:
"""
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
"""
"""
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
"""
"""
return len(self.roots())
def all_group_members(self):
"""
"""
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
class Imos_1:
def __init__(self,N):
self.len=N
self.list=[0]*(N+1)
def Add(self,F,T,C=1):
self.list[F]+=C
self.list[T+1]-=C
def Cumulative_Sum(self):
Y=[0]*(self.len)
S=0
for i in range(self.len):
S+=self.list[i]
Y[i]=S
return Y
#================================================
N,A,B=map(int,input().split())
X=list(map(int,input().split()))
U=Union_Find(N)
I=Imos_1(N)
for i in range(N):
p=Binary_Search_Small_Count(X,X[i]+A)
q=Binary_Search_Small_Count(X,X[i]+B,True)
if p<N and p<q:
U.union(i,p)
if p<=q-2:
I.Add(p,q-2)
assert 1
J=I.Cumulative_Sum()
for i in range(N):
if J[i]>0:
U.union(i,i+1)
X=[0]*N
for i in range(N):
X[i]=U.size(i)
print("\n".join(map(str,X)))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0