제출 #548965

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
548965		beaconmc	Just Long Neckties (JOI20_ho_t1)	Pypy 3	100 / 100	437 ms	74136 KiB

ho_t1

n = int(input())

ties = list(map(int, input().split()))
realsus = list(ties)

employees = list(map(int, input().split()))
ties.sort()
employees.sort()
tiesmap = dict()
for i in range(len(ties)):
    tiesmap[ties[i]] = i

sussies = dict()


max1 = [ties[i]-employees[i] for i in range(n)]
max2 = [ties[i]-employees[i-1] for i in range(1, n+1)]

for i in range(1,n):
    max1[i] = max(max1[i-1], max1[i])
for i in range(n-2, -1, -1):
    max2[i] = max(max2[i+1], max2[i])

sussies[0] = max2[0]
sussies[n] = max1[-1]

for i in range(1,n):
    sussies[i] = max(max1[i-1], max2[i])
realsus = [max(0,sussies[tiesmap[i]]) for i in realsus]
print(*realsus)

• Subtask 1: 1 / 1
• Subtask 2: 8 / 8
• Subtask 3: 91 / 91