Submission #245552

#	Time	Username	Problem	Language	Result	Execution time	Memory
245552		zecookiez	Just Long Neckties (JOI20_ho_t1)	Pypy 2	9 / 100	1043 ms	55580 KiB

ho_t1

from sys import stdin
input = stdin.readline
gi = lambda: map(int, input().split())
n = int(input())
arr = gi()
queries = sorted((i, j) for j, i in enumerate(arr))
brr = gi()
arr.sort()
brr.sort()

suf = [1e18] * n
suf[n - 1] = max(arr[-1] - brr[-1], 0)
for i in xrange(n - 2, -1, -1):
    suf[i] = max(suf[i + 1], max(arr[i + 1] - brr[i], 0))
ans = [0] * (n + 1)
for i, (val, ind) in enumerate(queries):
    if i == 0:
        ans[ind] = suf[0]
        pre = max(val - brr[i], 0)
    elif i == n:
        ans[ind] = pre
    else:
        ans[ind] = max(pre, suf[i])
        pre = max(pre, max(val - brr[i], 0))
print " ".join(map(str, ans))

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