結果

問題 No.1950 片道きゃっちぼーる
ユーザー KeroruKeroru
提出日時 2022-05-20 23:56:23
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 4,388 bytes
コンパイル時間 144 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 184,612 KB
最終ジャッジ日時 2024-09-20 10:21:42
合計ジャッジ時間 13,567 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 164 ms
92,288 KB
testcase_01 AC 153 ms
92,544 KB
testcase_02 AC 143 ms
92,416 KB
testcase_03 AC 472 ms
175,172 KB
testcase_04 AC 491 ms
174,592 KB
testcase_05 AC 146 ms
92,416 KB
testcase_06 AC 417 ms
177,044 KB
testcase_07 AC 363 ms
156,304 KB
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 481 ms
184,612 KB
testcase_12 AC 502 ms
176,120 KB
testcase_13 AC 599 ms
178,864 KB
testcase_14 AC 604 ms
182,772 KB
testcase_15 WA -
testcase_16 AC 468 ms
175,520 KB
testcase_17 WA -
testcase_18 AC 532 ms
161,380 KB
testcase_19 WA -
testcase_20 AC 392 ms
155,760 KB
testcase_21 AC 528 ms
169,144 KB
testcase_22 AC 529 ms
170,740 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()
import bisect,string,math,time,functools,random,fractions
from bisect import*
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range;R=range
def I():return int(input())
def LI():return [int(i) for i in input().split()]
def SLI():return sorted([int(i) for i in input().split()])
def LI_():return [int(i)-1 for i in input().split()]
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def NLI(n):return [[int(i) for i in input().split()] for i in range(n)]
def NLI_(n):return [[int(i)-1 for i in input().split()] for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def RLI(n=8,a=1,b=10):return [random.randint(a,b)for i in range(n)]
def RI(a=1,b=10):return random.randint(a,b)
def INP():
    N=3
    n=random.randint(1,N)
    n=3
    p=4
    mn,mx=1,100000000
    q=[[random.randint(mn,mx) for i in range(p)]for i in range(n)]
    return n,p,q
def Rtest(T):
    case,err=0,0
    for i in range(T):
        inp=INP()
        a1=naive(*inp)
        a2=solve(*inp)
        if a1!=a2:
            print(inp)
            print('naive',a1)
            print('solve',a2)
            err+=1
        case+=1
    print('Tested',case,'case with',err,'errors')
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            org_inp.append(inp)
        else:
            inp=ls[i]
        if len(inp)==2:a,b=inp;c=1
        else:a,b,c=inp
        if index==1:a-=1;b-=1
        aa=a,c,;bb=b,c,;g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def RE(E):
    rt=[[]for i in range(len(E))]
    for i in range(len(E)):
        for nb,d in E[i]:
            rt[nb]+=(i,d),
    return rt
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):
    #h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usage
    mp=[boundary]*(w+2);found={}
    for i in R(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
    rt=[0]
    for i in ls:rt+=[rt[-1]+i]
    return rt
def bit_combination(n,base=2):
    rt=[]
    for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s]
    return rt
def gcd(x,y):
    if y==0:return x
    if x%y==0:return y
    while x%y!=0:x,y=y,x%y
    return y
def RLE(it):
    rt=[]
    for i in it:
        if rt and rt[-1][0]==i:rt[-1][1]+=1
        else:rt+=[i,1],
    return rt
def YN(x):print(['NO','YES'][x])
def Yn(x):print(['No','Yes'][x])
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)
def gcj(t,*a):
    print('Case #{}:'.format(t+1),*a)

mo=10**9+7
#mo=998244353
inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
alp=[chr(ord('a')+i)for i in range(26)]
#sys.setrecursionlimit(10**7)


show_flg=False
show_flg=True


ans=0


n=I()
x=LI()
a=LI()
d={x[i]:i for i in range(n)}
st=[]
g=[[]for i in range(n*2)]
ans=[a[i] for i in range(n)]
t=[0]*n
for i in range(n):
    if x[i]+a[i] in d:
        g[d[x[i]+a[i]]]+=i,
        g[i]+=d[x[i]+a[i]],
    if x[i]-a[i] in d:
        g[d[x[i]-a[i]]]+=i,
        g[i]+=d[x[i]-a[i]],
    r=x[i]+a[i]
    g[i+n]+=i,
    st+=(r,i+n),

st=sorted(st,key=lambda x:x[0])[::-1]
v=[0]*(2*n)
for r,j in st:
    q=[j]
    while q:
        c=q.pop()
        for nb in g[c]:
            if v[nb]==0:
                v[nb]=1
                q+=nb,
                if nb<n:
                    t[nb]=max(t[nb],r)
    
tmp=[0]*n
ans=[max(ans[i],t[i]-x[i])for i in range(n)]
for i in ans:
    print(i)
0