problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02556 | s991653439 | Accepted | N = int(input())
W = []
S = []
for _ in range(N):
x,y = [int(hoge) for hoge in input().split()]
wa = x+y
sa = x-y
W.append(wa)
S.append(sa)
T = max(W)- min(W)
Y = max(S)- min(S)
print(max(T,Y)) |
p02556 | s641835021 | Accepted | n = int(input())
line = [map(int, input().split()) for _ in range(n)]
x, y = [list(i) for i in zip(*line)]
def f(x,y):
return x-y
def g(x,y):
return x+y
print(max(max([f(x[i],y[i]) for i in range(n)])-min([f(x[i],y[i]) for i in range(n)]), max([g(x[i],y[i]) for i in range(n)])-min([g(x[i],y[i]) for i in range(n)]))) |
p02556 | s632383903 | Accepted | import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
XY = np.array(read().split(), np.int64)[1:]
X, Y = XY[::2], XY[1::2]
A = X + Y
B = X - Y
a = A.max() - A.min()
b = B.max() - B.min()
print(max(a, b)) |
p02556 | s456994866 | Accepted | N=int(input())
L1=[]
L2=[]
L3=[]
for i in range(N):
x,y=map(int,input().split())
L1.append(x+y)
L2.append(x-y)
L3.append(y-x)
L1.sort()
L2.sort()
L3.sort()
M1=L1[-1]-L1[0]
M2=L2[-1]-L2[0]
M3=L3[-1]-L3[0]
print(max(M1,M2,M3)) |
p02556 | s865073985 | Accepted | N = int(input())
xy = [map(int, input().split()) for _ in range(N)]
x, y = [list(i) for i in zip(*xy)]
x_c = [x + y for (x, y) in zip(x, y)]
y_c = [x - y for (x, y) in zip(x, y)]
ans = max(x_c) - min(x_c)
ans_1 = max(y_c) - min(y_c)
if ans < ans_1:
ans = ans_1
print(ans) |
p02556 | s183817196 | Accepted | import sys
from operator import itemgetter
N = int(input())
V = set()
for s in sys.stdin.readlines():
x, y = map(int, s.split())
V.add((x + y, x - y))
y_max = max(V, key=itemgetter(1))[1]
y_min = min(V, key=itemgetter(1))[1]
x_max = max(V, key=itemgetter(0))[0]
x_min = min(V, key=itemgetter(0))[0]
print(max(x_max - x_min, y_max - y_min))
|
p02556 | s873610440 | Accepted | N=int(input())
nodes=[]
plus=[]
minus=[]
for i in range(N):
x,y=map(int,input().split())
nodes.append((x,y))
plus.append(x+y)
minus.append(x-y)
print(max(max(plus)-min(plus),max(minus)-min(minus))) |
p02556 | s762024630 | Accepted | if __name__ == '__main__':
N = int(input())
x = []
y = []
for _ in range(N):
x_, y_ = map(int, input().split())
x.append(x_)
y.append(y_)
xpy = [a + b for a, b in zip(x, y)]
xmy = [a - b for a, b in zip(x, y)]
max_1 = max(xpy)
min_1 = min(xpy)
max_2 = max(xmy)
min_2 = min(xmy)
print(max(max_1 - min_1,max_2 - min_2))
|
p02556 | s477543280 | Accepted | import sys
input = sys.stdin.buffer.readline
n = int(input())
x = []
y = []
for i in range(n):
a,b = map(int,input().split())
x.append(a+b)
y.append(a-b)
x.sort()
y.sort()
res = max(x[-1]-x[0],y[-1]-y[0])
print(res) |
p02556 | s708152812 | Accepted | n=int(input())
a=[]
b=[]
for i in range(n):
x,y=(int(i) for i in input().split())
a.append(x-y)
b.append(x+y)
a.sort()
b.sort()
print(max(a[-1]-a[0],b[-1]-b[0])) |
p02556 | s754487299 | Accepted | import numpy as np
N = int(input())
xy = [list(map(int, input().split())) for _ in range(N)]
xy45 = [[xy[i][0] - xy[i][1], xy[i][0] + xy[i][1]] for i in range(N)]
xy45 = np.array(xy45)
print(max(max(xy45[:, 0]) - min(xy45[:, 0]), max(xy45[:, 1]) - min(xy45[:, 1])))
|
p02556 | s080906393 | Accepted | n=int(input())
xy=[list(map(int,input().split()))for _ in range(n)]
xy1ma=-10**10
xy1mi=10**10
xy2ma=-10**10
xy2mi=10**10
for x,y in xy:
xy1ma=max(xy1ma,x-y)
xy1mi=min(xy1mi,x-y)
xy2ma=max(xy2ma,x+y)
xy2mi=min(xy2mi,x+y)
print(max(xy1ma-xy1mi,xy2ma-xy2mi))
|
p02556 | s976516363 | Accepted | n=int(input())
h=[]
add=[]
diff=[]
diff1=[]
for i in range(n):
l=list(map(int,input().split()))
h.append(l)
p=h[i][0]+h[i][1]
add.append(p)
k=h[i][0]-h[i][1]
diff.append(k)
r=h[i][1]-h[i][0]
diff1.append(r)
a=max(add)-min(add)
b=max(diff)-min(diff)
c=max(diff1)-min(diff1)
print(max(a,b,c)) |
p02556 | s315814437 | Accepted | N = int(input())
u = []
v = []
for _ in range(N):
x,y = map(int,input().split())
u.append(x+y)
v.append(x-y)
umax = max(u)
umin = min(u)
vmax = max(v)
vmin = min(v)
print(max(umax-umin,vmax-vmin))
|
p02556 | s525130319 | Accepted | N=int(input())
u=[]
v=[]
for i in range(N):
x,y=map(int,input().split())
u.append(x+y)
v.append(x-y)
print(max(max(u)-min(u),max(v)-min(v))) |
p02556 | s924506884 | Accepted | a,*b=[],
for z in[*open(0)][1:]:x,y=map(int,z.split());a+=x+y,;b+=x-y,
print(max(abs(max(a)-min(a)),abs(max(b)-min(b)))) |
p02556 | s333960380 | Accepted | n = int(input())
l = [0]*n
k = [0]*n
for i in range(n):
x,y = map(int,input().split())
l[i]=x+y
k[i]=x-y
print(max(abs(max(l)-min(l)), abs(min(l)-max(l)), abs(max(k)-min(k)), abs(min(k)-max(k)))) |
p02556 | s880121590 | Accepted | n = int(input())
a = []
b = []
for i in range(n):
x , y = map(int,input().split());
a.append(x + y)
b.append(x - y)
aa = max(a)-min(a)
bb = max(b)-min(b)
if aa >= bb:
print(aa)
else:
print(bb) |
p02556 | s003206960 | Accepted | #!python3
import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())
from operator import sub
def resolve():
it = map(int, sys.stdin.read().split())
N = next(it)
M = 10**9+1
data = [[M, -M], [M, -M]]
for x, y in zip(it, it):
for i, x in enumerate([x+y, x-y]):
for j, f in enumerate([min, max]):
data[i][j] = f(data[i][j], x)
print(max(map(lambda x: abs(sub(*x)), data)))
if __name__ == "__main__":
resolve()
|
p02556 | s553276486 | Accepted | N = int(input())
x = [0]* N
y = [0] * N
for i in range(N):
a , b = map(int,input().split())
x[i] = a+b
y[i] = a-b
ans = max([max(x) - min(x),max(y) - min(y)])
print(ans) |
p02556 | s438688156 | Accepted | # Fast IO (be careful about bytestring, not on interactive)
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
N = int(input())
sumList = []
subList = []
for _ in range(N):
x,y = map(int,input().split())
sumList.append(x + y)
subList.append(x - y)
print(max(max(sumList) - min(sumList),max(subList) - min(subList))) |
p02556 | s960294912 | Accepted | n=int(input())
a=[]
b=[]
for _ in range(n):
x,y=map(int,input().split())
a+=(x+y),
b+=(x-y),
c=max(a)-min(a)
d=max(b)-min(b)
ans=max(c,d,-c,-d)
print(ans) |
p02556 | s306386464 | Accepted | N = int(input())
A = []
B = []
a_max = -float("inf")
a_min = float("inf")
b_max = -float("inf")
b_min = float("inf")
for _ in range(N):
x, y = map(int, input().split())
a_max = max(a_max, x-y)
a_min = min(a_min, x-y)
b_max = max(b_max, x+y)
b_min = min(b_min, x+y)
print(max(a_max-a_min, b_max-b_min))
|
p02556 | s839641442 | Accepted | n = int(input())
zmax = -10**10
zmin = 10**10
wmax = -10**10
wmin = 10**10
for i in range(n):
x, y = map(int, input().split())
zref = x + y
wref = x - y
zmax = max(zmax, zref)
zmin = min(zmin, zref)
wmax = max(wmax, wref)
wmin = min(wmin, wref)
ans = max(zmax - zmin, wmax - wmin)
print(ans) |
p02556 | s487487473 | Accepted | N=int(input())
A,B=[],[]
for i in range(N):
x,y=map(int, input().split())
A.append(x+y)
B.append(x-y)
A=sorted(A)
B=sorted(B)
print(max(abs(A[0]-A[-1]),abs(B[0]-B[-1]))) |
p02556 | s330187328 | Accepted | from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))
n=int(input())
z=[]
w=[]
for i in range(n):
x,y=nii()
z.append(x-y)
w.append(x+y)
z_ans=max(z)-min(z)
w_ans=max(w)-min(w)
print(max(z_ans,w_ans)) |
p02556 | s384501110 | Accepted | import sys
input = sys.stdin.readline
def main():
n = int(input())
p = [list(map(int, input().split())) for i in range(n)]
p0, p1 = [0]*n, [0]*n
for i in range(n):
p0[i] = p[i][0] - p[i][1]
p1[i] = p[i][0] + p[i][1]
ans = max(max(p0)-min(p0), max(p1)-min(p1))
print(ans)
if __name__ == "__main__":
main()
|
p02556 | s595860925 | Accepted | # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
N=int(input())
x,y=[0]*N,[0]*N
for i in range(N):
a,b=map(int,input().split())
x[i],y[i]=a+b,a-b
x.sort()
y.sort()
print(max(max(x)-min(x),max(y)-min(y))) |
p02556 | s398859358 | Accepted | import sys
input = sys.stdin.readline
def main():
N = int( input())
U = []
V = []
for _ in range(N):
x, y = map( int, input().split())
u, v = x+y, x-y
U.append(u)
V.append(v)
U.sort()
V.sort()
print( max(U[-1]-U[0], V[-1]-V[0]))
if __name__ == '__main__':
main()
|
p02556 | s317170537 | Accepted | n = int(input())
top1= -10**10
bot1= 10**10
top2= -10**10
bot2= 10**10
for _ in range(n):
x,y = map(int, input().split(' '))
tot1= x+y
tot2= x-y
if tot1> top1:
top1= tot1
if tot1< bot1:
bot1= tot1
if tot2>top2:
top2= tot2
if tot2<bot2:
bot2= tot2
print(max(top1-bot1, top2-bot2)) |
p02556 | s756449676 | Accepted | N = int(input())
XY = []
for i in range(N):
XY.append(list(map(int,input().split())))
ZW = []
for i in range(N):
ZW.append([XY[i][0]-XY[i][1],XY[i][0]+XY[i][1]])
out = []
ZW.sort(key=lambda x:x[0])
out.append(abs(ZW[0][0]-ZW[N-1][0]))
ZW.sort(key=lambda x:x[1])
out.append(abs(ZW[0][1]-ZW[N-1][1]))
print(max(out))
|
p02556 | s494019906 | Accepted | n, *XY = map(int, open(0).read().split())
XY = list(zip(XY[::2], XY[1::2]))
A = [x+y for x, y in XY]
B = [x-y for x, y in XY]
print(max(max(A) - min(A), max(B) - min(B))) |
p02556 | s630053509 | Accepted | n = int(input())
pp = []
pm = []
mp = []
mm = []
for i in range(n):
x, y = list(map(int, input().split()))
pp.append(x + y)
pm.append(x - y)
mp.append(-x + y)
mm.append(-x - y)
max_pp = max(pp)
min_pp = min(pp)
max_pm = max(pm)
min_pm = min(pm)
max_mp = max(mp)
min_mp = min(mp)
max_mm = max(pm)
min_mm = min(pm)
max_val = max(max_pp - min_pp, max_pm - min_pm, max_mp - min_mp, max_mm - min_mm)
print(max_val)
|
p02556 | s630390313 | Accepted | n = int(input())
xy = [tuple(map(int, input().split())) for _ in range(n)]
p = [x + y for x, y in xy]
a1 = max(p) - min(p)
q = [x - y for x, y in xy]
a2 = max(q) - min(q)
print(max(a1, a2)) |
p02556 | s316135730 | Accepted | n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
xy.sort(key=lambda x: x[0] + x[1])
mn1, mx1 = xy[0], xy[-1]
xy.sort(key=lambda x: x[0] - x[1])
mn2, mx2 = xy[0], xy[-1]
li = [mn1, mx1, mn2, mx2]
ans = 0
for x1, y1 in li:
for x2, y2 in li:
dist = abs(x1 - x2) + abs(y1 - y2)
ans = max(ans, dist)
print(ans)
|
p02556 | s625198054 | Accepted | import sys
input = sys.stdin.readline
def MI():
return map(int, input().split())
n = int(input())
z=[]
w=[]
for i in range(n):
x,y=MI()
z.append(x+y)
w.append(x-y)
print(max(max(z)-min(z), max(w)-min(w))) |
p02556 | s791890053 | Accepted | n=int(input())
zmi=wmi=int(1e+10)
zma=wma=int(-1e+10)
for i in range(n):
xi,yi=map(int,input().split())
zma=max(xi+yi,zma)
wma=max(xi-yi,wma)
zmi=min(xi+yi,zmi)
wmi=min(xi-yi,wmi)
print(max(zma-zmi,wma-wmi))
|
p02556 | s816924823 | Accepted | import sys
def input():
return sys.stdin.readline()[:-1]
def main():
N = int(input())
d = []
e = []
for k in range(N):
x, y = map(int,input().split())
d.append(x+y)
e.append(x-y)
d.sort()
e.sort()
print(max(e[-1]-e[0],d[-1]-d[0]))
if __name__ == '__main__':
main()
|
p02556 | s371155099 | Accepted | n = int(input())
XY = list(map(int, input().split()) for _ in range(n))
x_max = -float("inf")
y_max = -float("inf")
x_min = float("inf")
y_min = float("inf")
for x, y in XY:
a, b = x-y, x+y
x_max = max(x_max, a)
x_min = min(x_min, a)
y_max = max(y_max, b)
y_min = min(y_min, b)
s = x_max - x_min
t = y_max - y_min
ans = max(s, t)
print(ans) |
p02556 | s380027533 | Accepted | n = int(input())
a, b = [], []
for _ in range(n):
x, y = map(int, input().split())
a.append(x+y)
b.append(x-y)
print(max(max(a)-min(a), max(b)-min(b)))
|
p02556 | s677470950 | Accepted | N = int(input())
L = [list(map(int, input().split())) for _ in range(N)]
L_1 = [l[0]+l[1] for l in L]
L_2 = [(10**9+1-l[0])+l[1] for l in L]
L_3 = [(10**9+1-l[1])+l[0] for l in L]
L_4 = [(10**9+1-l[0])+(10**9+1-l[1]) for l in L]
L_1.sort()
a = L_1[-1]-L_1[0]
L_2.sort()
b = L_2[-1]-L_2[0]
L_3.sort()
c = L_3[-1]-L_3[0]
L_4.sort()
d = L_4[-1]-L_4[0]
print(max(a,b,c,d)) |
p02556 | s298288926 | Accepted | n = int(input())
a, b = [], []
for _ in range(n):
x, y = map(int, input().split())
a.append(x+y)
b.append(x-y)
a.sort()
b.sort()
ans = max(a[-1]-a[0], b[-1]-b[0])
print(ans) |
p02556 | s242464922 | Accepted | import sys
input = sys.stdin.buffer.readline
INF = 10**18
N = int(input())
XY = [list(map(int, input().split())) for _ in range(N)]
XY.sort()
ans = 0
x0, y0 = XY[0]
m1 = -x0+y0# 今ままでのmax
m2 = x0+y0
for x, y in XY:
ans = max(ans, x+m1 - y)
ans = max(ans, y - (-x+m2))
m1 = max(m1, -x+y)
m2 = min(m2, x+y)
print(ans) |
p02556 | s942986563 | Accepted | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n = int(input())
xy = [0] * n
xy_plus_max = -10 ** 10
xy_plus_min = 10 ** 10
xy_minus_max = -10 ** 10
xy_minus_min = 10 ** 10
for i in range(n):
x, y = map(int, input().split())
xy_plus_max = max(xy_plus_max, x + y)
xy_plus_min = min(xy_plus_min, x + y)
xy_minus_max = max(xy_minus_max, x - y)
xy_minus_min = min(xy_minus_min, x - y)
print(max(xy_plus_max - xy_plus_min, xy_minus_max - xy_minus_min))
|
p02556 | s351963767 | Accepted | #
import sys
input=sys.stdin.readline
def main():
N = int(input())
R = [tuple(map(int, input().split())) for i in range(N)]
A = sorted(R, key = lambda x: x[0] + x[1])
B = sorted(R, key = lambda x: x[0] - x[1])
a = abs(A[-1][0] - A[0][0]) + abs(A[-1][1] - A[0][1])
b = abs(B[-1][0] - B[0][0]) + abs(B[-1][1] - B[0][1])
print(max(a, b))
if __name__=="__main__":
main()
|
p02556 | s121680719 | Accepted | N=int(input())
xp=yp=0
xn=yn=10**9
zs=[0]*N
ws=[0]*N
for i in range(N):
xi,yi=map(int,input().split())
zs[i]=xi+yi
ws[i]=xi-yi
zs.sort()
ws.sort()
ans=max(zs[-1]-zs[0],ws[-1]-ws[0])
print(ans) |
p02556 | s096523931 | Accepted | n = int(input())
z = []
w = []
for i in range(n):
x,y = map(int,input().split())
z.append(x+y)
w.append(x-y)
zmax = max(z)-min(z)
wmax = max(w)-min(w)
print(max(zmax,wmax)) |
p02556 | s716643659 | Accepted | # -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
A = []
B = []
for _ in range(N):
x, y = map(int, readline().split())
A.append(x+y)
B.append(x-y)
a = max(A)
b = min(A)
c = max(B)
d = min(B)
print(max(abs(a-b),abs(c-d))) |
p02556 | s759001938 | Accepted | num = int(input())
sumList = [0] * num
minusList = [0] * num
for id in range(num):
x, y = map(int, input().split())
sumList[id-1] = x + y
minusList[id-1] = x - y
sumMax = max(sumList) - min(sumList)
minusMax = max(minusList) - min(minusList)
print(max(sumMax, minusMax))
|
p02556 | s415908174 | Accepted | N = int(input())
xy = [map(int, input().split()) for _ in range(N)]
x, y = [list(i) for i in zip(*xy)]
dis1 = [0] * N
dis2 = [0] * N
for i in range(N):
dis1[i] = x[i] + y[i]
dis2[i] = x[i] - y[i]
max_dis1 = max(dis1)
min_dis1 = min(dis1)
max_dis2 = max(dis2)
min_dis2 = min(dis2)
max_dis = max([max_dis1 - min_dis1,-min_dis2 + max_dis2])
print(max_dis) |
p02556 | s314631926 | Accepted | N = int(input())
table = [[int(i) for i in input().split()] for N in range(N)]
a = -1
b = 10**10
c = -10**10
d = 10**10
for i in range(N):
p = table[i][0]
q = table[i][1]
if a < p+q:
a = p+q
if b > p+q:
b = p+q
if c < p-q:
c = p-q
if d > p-q:
d = p-q
print(max(a-b,c-d))
|
p02556 | s318264640 | Accepted | def resolve():
n = int(input())
d1 = {}
d2 = {}
for i in range(n):
x, y = map(int, input().split())
if x+y not in d1:
d1[x+y] = 1
if x-y not in d2:
d2[x-y] = 1
d1key = d1.keys()
d1key = sorted(d1key)
d2key = d2.keys()
d2key = sorted(d2key)
print(max(abs(d1key[0]-d1key[-1]), abs(d2key[0]-d2key[-1])))
resolve() |
p02556 | s087194906 | Accepted | import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N = int(readline())
# A:和、B:差
A = [0] * N
B = [0] * N
for i in range(N):
x, y = map(int, readline().split())
A[i] = x+y
B[i] = x-y
ans = max(max(A)-min(A), max(B)-min(B))
print(ans)
if __name__ == '__main__':
main()
|
p02556 | s094326862 | Accepted | n = int(input())
l = [[0,0] for _ in range(n)]
for i in range(n):
x,y = map(int,input().split())
l[i] = [x-y,x+y]
ans = 0
for i in range(2):
l2 = [l[j][i] for j in range(n)]
ans = max(ans,max(l2)-min(l2))
print(ans) |
p02556 | s869421197 | Accepted | N = int(input())
Zlist=[]
Wlist = []
for i in range(N):
x,y = map(int,input().split())
z = x+y
w = x-y
Zlist.append(z)
Wlist.append(w)
Zlist.sort()
Wlist.sort()
print(max(Zlist[-1]-Zlist[0],Wlist[-1]-Wlist[0])) |
p02556 | s484872196 | Accepted | n = int(input())
point = []
for _ in range(n):
point.append((tuple(map(int, input().split()))))
point = list(set(point))
point = sorted(point)
if len(point) == 1: print(0)
else:
d1 = max([(x+y) for x,y in point])- min([(x+y) for x,y in point])
d2 = max([(x-y) for x,y in point]) - min([(x-y) for x,y in point])
print(max(d1,d2)) |
p02556 | s033369532 | Accepted |
def main():
n = int(input())
z = [[], []]
for i in range(n):
x, y = map(int, input().split())
z[0].append(x + y)
z[1].append(x - y)
z[0] = sorted(z[0])
z[1] = sorted(z[1])
print(max(z[0][-1] - z[0][0], z[1][-1] - z[1][0]))
if __name__ == '__main__':
main()
|
p02556 | s401169629 | Accepted | n = int(input())
a,b = [],[]
for i in range(n):
x,y = map(int,input().split())
a.append(x+y)
b.append(x-y)
a.sort()
b.sort()
ans = max(a[-1]-a[0],b[-1]-b[0])
print(ans) |
p02556 | s055885584 | Accepted | n = int(input())
ph = 0
pl = 10**10
mh = -10**10
ml = 10**10
for _ in range(n):
x,y = map(int,input().split())
ph = max(ph,x+y)
pl = min(pl,x+y)
mh = max(mh,x-y)
ml = min(ml,x-y)
print(max(ph-pl,mh-ml)) |
p02556 | s251776990 | Accepted | n = int(input())
xy = [list(map(int,input().split())) for _ in range(n)]
xy1 = []
xy2 = []
for x,y in xy:
xy1.append(x+y)
xy2.append(x-y)
xy1.sort()
xy2.sort()
print(max(xy1[-1] - xy1[0], xy2[-1] - xy2[0]))
|
p02556 | s371472535 | Accepted | import sys
def input():
return sys.stdin.buffer.readline()[:-1]
n = int(input())
d = [list(map(int, input().split())) for _ in range(n)]
ans1 = max(x[0] + x[1] for x in d) - min(x[0] + x[1] for x in d)
ans2 = max(x[0] - x[1] for x in d) - min(x[0] - x[1] for x in d)
print(max(ans1, ans2)) |
p02556 | s678653010 | Accepted | import sys
input = sys.stdin.readline
def main():
N = int(input())
Z = []; W = []
for i in range(N):
x, y = map(int, input().split())
z = x + y
w = x - y
Z.append(z)
W.append(w)
ans = max(max(Z) - min(Z), max(W) - min(W))
print(ans)
if __name__ == "__main__":
main()
|
p02556 | s644113613 | Accepted | N=int(input())
minz=10**11
minw=10**11
maxz=-10**11
maxw=-10**11
for i in range(N):
a,b=map(int,input().split())
if a+b>maxz:
maxz=a+b
if a+b<minz:
minz=a+b
if a-b>maxw:
maxw=a-b
if a-b<minw:
minw=a-b
print(max((maxz-minz),(maxw-minw))) |
p02556 | s845525301 | Accepted | n = int(input())
XY = [tuple(map(int, input().split())) for _ in range(n)]
# 左下右上
mi = min(XY, key=lambda x: x[0] + x[1])
ma = max(XY, key=lambda x: x[0] + x[1])
ans1 = ma[0]-mi[0] + ma[1]-mi[1]
# 左上右下
mi = min(XY, key=lambda x: x[0] + (10**9)-x[1])
ma = min(XY, key=lambda x: (10**9)-x[0] + x[1])
ans2 = abs(ma[0]-mi[0]) + abs(ma[1]-mi[1])
print(max(ans1, ans2))
|
p02556 | s026044848 | Accepted |
n=int(input())
lx=[]
ly=[]
for i in range(n):
x,y=map(int,input().split())
lx.append(x+y)
ly.append(x-y)
ax,bx,ay,by=max(lx),min(lx),max(ly),min(ly)
print(max(ax-bx,ay-by))
|
p02556 | s072712800 | Accepted | n = int(input())
pnts = [tuple(map(int, input().split())) for i in range(n)]
mxsum = max(map(lambda p: p[0]+p[1], pnts))
mnsum = min(map(lambda p: p[0]+p[1], pnts))
mxdif = max(map(lambda p: p[0]-p[1], pnts))
mndif = min(map(lambda p: p[0]-p[1], pnts))
print(max([mxsum - mnsum, mxdif-mndif]))
|
p02556 | s596299018 | Accepted | import sys
#import time
from collections import deque, Counter, defaultdict
#from fractions import gcd
import bisect
import heapq
#import math
import itertools
import numpy as np
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
inf = 10**18
MOD = 1000000007
ri = lambda : int(input())
rs = lambda : input().strip()
rl = lambda : list(map(int, input().split()))
n = ri()
a = []
b = []
for i in range(n):
x,y = rl()
a.append(x+y)
b.append(x-y)
a.sort()
b.sort()
print(max(a[-1]-a[0], b[-1]-b[0])) |
p02556 | s614067214 | Accepted | def main():
n = int(input())
z = []
w = []
for _ in range(n):
x,y = tuple(map(int,input().split()))
z.append(x+y)
w.append(x-y)
print(max(max(z)-min(z),max(w)-min(w)))
if __name__ == "__main__":
main() |
p02556 | s049258127 | Accepted | n=int(input())
tens=[]
for i in range(n):
x,y=map(int,input().split())
tens.append([x,y])
tasu=[]
hiku=[]
for i in range(n):
tasu.append(tens[i][0]+tens[i][1])
hiku.append(tens[i][0]-tens[i][1])
#print(tasu,hiku)
a=max(tasu)-min(tasu)
b=max(hiku)-min(hiku)
print(max(a,b)) |
p02556 | s945839415 | Accepted | n = int(input())
x, y = map(int, input().split())
p, m = [x+y]*2, [x-y]*2
for i in range(n-1):
x, y = map(int, input().split())
p = [min(p[0], x+y), max(p[1], x+y)]
m = [min(m[0], x-y), max(m[1], x-y)]
print(max(p[1] - p[0], m[1] - m[0]))
|
p02556 | s805681668 | Accepted | n=int(input())
alist=[]
blist=[]
for i in range(n):
x,y=map(int, input().split())
alist.append(x+y)
blist.append(x-y)
print(max(max(alist)-min(alist),max(blist)-min(blist))) |
p02556 | s490713909 | Accepted | # -*- coding: utf-8 -*-
N = int(input())
pos_x_list = []
pos_y_list = []
for i in range(N):
x, y = map(int, input().split())
pos_x_list.append(x - y)
pos_y_list.append(x + y)
print(max(max(pos_x_list) - min(pos_x_list), max(pos_y_list) - min(pos_y_list))) |
p02556 | s138530503 | Accepted | def get_ints():
return list(map(int,input().split()))
n = int(input())
a,b = [],[]
for i in range(n):
x,y = get_ints()
a.append(x+y)
b.append(x-y)
a.sort()
b.sort()
ans = max(a[-1]-a[0], b[-1]-b[0])
print(ans)
|
p02556 | s336020833 | Accepted | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(input())
xy = [tuple(map(int, input().split())) for _ in range(n)]
l = [(item[0]+item[1], item[0]-item[1]) for item in xy]
l.sort()
v0 = l[-1][0]-l[0][0]
l.sort(key=lambda x: x[1])
v1 = l[-1][1]-l[0][1]
ans = max(v0,v1)
print(ans) |
p02556 | s791513687 | Accepted | n = int(input())
a = [0] * n
b = [0] * n
for i in range(n):
p, q = [int(j) for j in input().split(' ')]
a[i] = p+q
b[i] = p-q
a.sort()
b.sort()
print(max(a[-1] - a[0], b[-1] - b[0])) |
p02556 | s075997020 | Accepted | n=int(input())
l=[]
ll=[]
for i in range(n):
x,y=map(int,input().split())
l.append(x+y)
ll.append(x-y)
l.sort()
ll.sort()
print(max(l[-1]-l[0],ll[-1]-ll[0]))
|
p02556 | s420474136 | Accepted | n=int(input())
a=[]
b=[]
for i in range(n):
x,y=map(int,input().split())
a.append(x+y)
b.append(x-y)
a=sorted(a)
b=sorted(b)
ans=max(a[-1]-a[0],b[-1]-b[0])
print(ans) |
p02556 | s658689984 | Accepted | import random
N = int(input())
x = [0]*N
y = [0]*N
for i in range(N):
x[i], y[i] = map(int, input().split())
minn = 10**10
maxn = -10**10
minp = 10**10
maxp = -10**10
for i in range(N):
minn = min(minn, x[i]-y[i])
maxn = max(maxn, x[i]-y[i])
minp = min(minp, x[i]+y[i])
maxp = max(maxp, x[i]+y[i])
print(max(maxn-minn, maxp-minp))
|
p02556 | s232318165 | Accepted | n=int(input())
l=[list(map(int,input().split())) for i in range(n)]
a=10**9
z_max=-1*a
z_min=a
w_max=-1*a
w_min=a
for x,y in l: #点のx座標とy座標の和の最大値と最小値の差か座標の差の最大値と最小値の差が答え
z_max=max(z_max,x+y)
z_min=min(z_min,x+y)
w_max=max(w_max,x-y)
w_min=min(w_min,x-y)
print(max(z_max-z_min,w_max-w_min)) |
p02556 | s999501961 | Accepted | N=int(input())
a = []
b = []
for i in range(N):
x,y=map(int,input().split())
a.append(x+y)
b.append(x-y)
A = max(a)-min(a)
B = max(b)-min(b)
print(max(A,B)) |
p02556 | s108644086 | Accepted | N=int(input())
Sum=[]
Sub=[]
for _ in range(N):
x,y = map(int,input().split())
Sum.append(x+y)
Sub.append(x-y)
Sum = sorted(Sum)
Sub=sorted(Sub)
ans=max(abs(Sum[-1]-Sum[0]),abs(Sub[-1]-Sub[0]))
print(ans)
|
p02556 | s620176831 | Accepted | N = int(input())
z =[]
w = []
for i in range(N):
x,y = map(int, input().split())
z.append(x+y)
w.append(x-y)
print(max(max(z)-min(z),max(w)-min(w))) |
p02556 | s742791854 | Accepted | import sys
N=int(sys.stdin.readline().strip())
XY=[ map(int, sys.stdin.readline().split()) for _ in range(N) ]
X=[]
Y=[]
for x,y in XY:
X.append(x-y)
Y.append(x+y)
X.sort()
Y.sort()
print max(abs(X[0]-X[-1]),abs(Y[0]-Y[-1])) |
p02556 | s411971568 | Accepted | N = int(input())
xy = [list(map(int, input().split())) for _ in range(N)]
mx = 9
L = [0] * N
for i in range(N):
x, y = xy[i]
L[i] = x + y
mx = max(mx, x)
L.sort()
ans = L[-1] - L[0]
for i in range(N):
x, y = xy[i]
L[i] = mx - x + y
L.sort()
ans = max(ans, L[-1] - L[0])
print(ans) |
p02556 | s644107617 | Accepted | import sys
def f(x, y):
return x - y, x + y
def main():
input = sys.stdin.buffer.readline
n = int(input())
x = [0] * n
y = [0] * n
for i in range(n):
x[i], y[i] = map(int, input().split())
f0 = [0] * n
f1 = [0] * n
for i in range(n):
f0[i], f1[i] = f(x[i], y[i])
print(max(max(f0) - min(f0), max(f1) - min(f1)))
if __name__ == "__main__":
main()
|
p02556 | s301429183 | Accepted | n=int(input())
ans=[]
a=[]
b=[]
c=[]
d=[]
for i in range(n):
x,y=map(int,input().split())
a.append(x-y)
b.append(x+y)
a=sorted(a)
b=sorted(b)
ans=[a[-1]-a[0],b[-1]-b[0]]
print(max(ans))
|
p02556 | s598545164 | Accepted | pnt=[]
n=int(input())
for i in range(n):
pnt.append(list(map(int,input().split())))
z=[]
w=[]
for i in pnt:
z.append(i[0]+i[1])
w.append(i[0]-i[1])
print(max(max(z)-min(z),max(w)-min(w)))
|
p02556 | s421588284 | Accepted | N = int(input())
xy = [map(int, input().split()) for _ in range(N)]
def get_output():
dist = [0 for _ in range(N)]
X, Y = [], []
for i, (x, y) in enumerate(xy):
x, y = x-y, x+y
X.append(x)
Y.append(y)
a = max(X) - min(X)
b = max(Y)-min(Y)
return max(a, b)
print(get_output())
|
p02556 | s304837897 | Accepted | n = int(input())
plus,minus = [],[]
for i in range(n):
a,b = map(int,input().split())
plus.append(a+b)
minus.append(a-b)
plus.sort()
minus.sort()
print(max(plus[-1]-plus[0],minus[-1]-minus[0])) |
p02556 | s295449671 | Accepted | N=int(input())
x=[0 for i in range(N)]
y=[0 for i in range(N)]
for i in range(N):
x[i],y[i]=map(int,input().split())
A=[(x[i],y[i]) for i in range(N)]
B=[(x[i],y[i]) for i in range(N)]
A.sort(key=lambda p:p[0]+p[1])
B.sort(key=lambda p:p[0]-p[1])
def dist(a,b):
return abs(a[0]-b[0])+abs(a[1]-b[1])
ans0=dist(A[0],A[-1])
ans1=dist(B[0],B[-1])
print(max(ans0,ans1)) |
p02556 | s297371256 | Accepted | def main():
n = int(input())
X, Y = [], []
for _ in range(n):
x, y = map(int, input().split())
X.append(x + y)
Y.append(x - y)
X.sort()
Y.sort()
print(max(X[-1] - X[0], Y[-1] - Y[0]))
if __name__ == '__main__':
main()
|
p02556 | s552666645 | Accepted | N = int(input())
A = [[int(a) for a in input().split()] for _ in range(N)]
for i in range(N):
z = A[i][0] + A[i][1]
w = A[i][0] - A[i][1]
if i==0:
M_z = m_z = z
M_w = m_w = w
if z > M_z: M_z = z
if z < m_z: m_z = z
if w > M_w: M_w = w
if w < m_w: m_w = w
print(max(M_z-m_z,M_w-m_w)) |
p02556 | s574899786 | Accepted | def f(x, y):
return x-y, x+y
n = int(input())
p = [list(map(int, input().split())) for i in range(n)]
max_x = -2000000000
min_x = 2000000000
max_y = -2000000000
min_y = 2000000000
for xi, yi in p:
f1, f2 = f(xi, yi)
max_x = max(max_x, f1)
min_x = min(min_x, f1)
max_y = max(max_y, f2)
min_y = min(min_y, f2)
print(max(max_x - min_x, max_y - min_y)) |
p02556 | s443622419 | Accepted | #!/usr/bin/env python3
def get_points_and_convert(pts):
x, y = pts
return x + y, x - y
def main():
n = int(input())
points = [
get_points_and_convert(map(int, input().split()))
for _ in range(n)
]
plus_coords, minus_coords = list(zip(*points))
plus_dist = max(plus_coords) - min(plus_coords)
minus_dist = max(minus_coords) - min(minus_coords)
print(max(plus_dist, minus_dist))
if __name__ == '__main__':
main()
|
p02556 | s853563652 | Accepted | import numpy as np
a = input()
N = int(a)
xy = [map(int, input().split()) for _ in range(N)]
x, y = np.array([list(i) for i in zip(*xy)])
z = x + y
w = x - y
ans = max((max(z)-min(z)),(max(w)-min(w)))
print(ans) |
p02556 | s028010676 | Accepted | n=int(input())
a=[]
b=[]
for i in range(n):
x,y=map(int,input().split())
a.append([x+y,x,y])
b.append([x-y,x,y])
a.sort()
b.sort()
ans=abs(a[0][1]-a[n-1][1])+abs(a[0][2]-a[n-1][2])
aa=abs(b[0][1]-b[n-1][1])+abs(b[0][2]-b[n-1][2])
print(max(ans,aa))
|
p02556 | s691673437 | Accepted | n = int(input())
point_dict1 = {}
point_dict2 = {}
for i in range(n):
x, y = map(int, input().split())
point_dict1[x + y] = (x, y)
point_dict2[y - x] = (x, y)
min_point1 = min(point_dict1)
max_point1 = max(point_dict1)
min_point2 = min(point_dict2)
max_point2 = max(point_dict2)
print(max(max_point1 - min_point1, max_point2 - min_point2)) |
p02556 | s508358223 | Accepted | N = int(input())
A = []
B = []
for i in range(N):
x, y = map(int, input().split())
A.append(x+y)
B.append(x-y)
print(max(max(A)-min(A), max(B)-min(B))) |
p02556 | s403165333 | Accepted | import sys
input = sys.stdin.readline
N = int(input())
XY = [tuple(map(int,input().split())) for i in range(N)]
A = []
B = []
for x,y in XY:
A.append(x+y)
B.append(x-y)
a = max(A) - min(A)
b = max(B) - min(B)
print(max(a,b)) |
p02556 | s491229395 | Accepted | N = int(input())
A = [list(map(int, input().split())) for _ in range(N)]
Z = sorted([x+y for x,y in A])
W = sorted([x-y for x,y in A])
print(max(Z[-1]-Z[0], W[-1]-W[0])) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.