problem_id
stringclasses 100
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 6
806
|
|---|---|---|---|
p02556
|
s813691230
|
Accepted
|
n=int(input())
M=[]
N=[]
for i in range(n):
x,y=map(int,input().split())
M.append(x+y)
N.append(x-y)
p=max(M)-min(M)
q=max(N)-min(N)
print(max(p,q))
|
p02556
|
s721914142
|
Accepted
|
N = int(input())
xys = [list(map(int, input().split())) for _ in range(N)]
xys = sorted(xys, key= lambda x: x[0])
answer = 0
a = []
b = []
for xy in xys:
a.append(xy[0] + xy[1])
b.append(xy[0] - xy[1])
print(max(max(a)-min(a), max(b)-min(b)))
|
p02556
|
s809714749
|
Accepted
|
N = int(input())
Xmax = -2*10**9
Ymax = -2*10**9
Xmin = 2*10**9
Ymin = 2*10**9
for i in range(N):
x, y = map(int, input().split())
if (x + y >= Xmax):
Xmax = x + y
if (x + y <= Xmin):
Xmin = x + y
if (x - y >= Ymax):
Ymax = x - y
if (x - y <= Ymin):
Ymin = x - y
print(max(Xmax - Xmin, Ymax - Ymin))
|
p02556
|
s913663752
|
Accepted
|
n=int(input())
z=[]
c=[]
for j in range(n):
x1,y1=[int(j) for j in input().split()]
z.append(x1+y1)
c.append(x1-y1)
za=max(z)
zi=min(z)
ca=max(c)
ci=min(c)
mx=max(za-zi,ca-ci)
print(mx)
|
p02556
|
s676623635
|
Accepted
|
n=int(input())
l1=[]
l2=[]
for _ in range(n):
x,y=map(int,input().split())
l1.append(x+y)
l2.append(x-y)
print(max(max(l1)-min(l1),max(l2)-min(l2)))
|
p02556
|
s444961537
|
Accepted
|
def resolve():
N = int(input())
Z = []
W = []
for i in range(N):
x, y = map(int, input().split())
Z.append(x + y)
W.append(x - y)
a = max(Z) - min(Z)
b = max(W) - min(W)
print(max(a, b))
if __name__ == "__main__":
resolve()
|
p02556
|
s219541270
|
Accepted
|
n=int(input())
l=[]
lans=[]
for i in range(n):
x,y=(map(int,input().split()))
l.append(x+y)
lans.append(x-y)
l.sort()
lans.sort()
#print(l)
print(max(l[-1]-l[0],lans[-1]-lans[0]))
'''
ll1=[ll[1],ll[0]]
lan.append(ll1)
l.sort()
lan.sort()
we=abs(l[0][0]-l[-1][0])+abs(l[0][1]-l[-1][1])
we1=abs(lan[0][0]-lan[-1][0])+abs(lan[0][1]-lan[-1][1])
print(max(we,we1))
'''
|
p02556
|
s557916218
|
Accepted
|
N = int(input())
L1, L2 = [], []
for i in range(N):
l = list(map(int, input().split()))
L1.append(l[0]-l[1])
L2.append(l[0]+l[1])
ans = max(max(L1)-min(L1), max(L2)-min(L2))
print(ans)
|
p02556
|
s479074482
|
Accepted
|
n=int(input())
s,p=10**100,10**100
t,q=-1000000000000,-1000000000000
for i in range(n):
x,y=map(int,input().split())
s=min(s,x+y)
t=max(t,x+y)
p=min(p,x-y)
q=max(q,x-y)
print(max(t-s,q-p))
|
p02556
|
s955823574
|
Accepted
|
n = int(input())
max_s = 1 - (10 ** 9)
min_s = 2 * (10 ** 9)
max_t = 1 - (10 ** 9)
min_t = 2 * (10 ** 9)
for _ in range(n):
x, y = map(int, input().split())
s = x - y
t = x + y
max_s = max(max_s, s)
min_s = min(min_s, s)
max_t = max(max_t, t)
min_t = min(min_t, t)
print(max(max_s - min_s, max_t - min_t))
|
p02556
|
s890270580
|
Accepted
|
n = int(input())
disadd = []
disminus = []
for i in range(n):
x, y = map(int, input().split())
disadd.append(x+y)
disminus.append(x-y)
print(max(max(disadd)-min(disadd), max(disminus) - min(disminus)))
|
p02556
|
s402432411
|
Accepted
|
N=int(input())
x=[0]*N
for i in range(N):
x[i]=list(map(int,input().split()))
#print(x)
z=[0]*N
w=[0]*N
for i in range(N):
z[i]=x[i][0]+x[i][1]
w[i]=x[i][0]-x[i][1]
print(max(max(z)-min(z),max(w)-min(w)))
|
p02556
|
s113012736
|
Accepted
|
N = int(input())
ma = 2*(10**9)+1
Ma = 0
mb = 10**9
Mb = 2-10**9
for i in range(N):
a,b = map(int,input().split())
tempa = a+b
ma = min(ma,tempa)
Ma = max(Ma,tempa)
tempb = b-a
mb = min(mb,tempb)
Mb = max(Mb,tempb)
print(max(Ma-ma,Mb-mb))
|
p02556
|
s085380337
|
Accepted
|
n = int(input())
z = list()
w = list()
for i in range(n):
x,y = list(map(int,input().split()))
z.append(x + y)
w.append(x - y)
ans = max(max(z) - min(z),max(w)-min(w))
print(ans)
|
p02556
|
s061008151
|
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)
z_max = max(z)
z_min = min(z)
w_max = max(w)
w_min = min(w)
print(max(z_max-z_min,w_max-w_min))
|
p02556
|
s788139756
|
Accepted
|
n = int(input())
ten = [list(map(int, input().split())) for i in range(n)]
for i in ten:
x = i[0]
y = i[1]
i[0] = x-y
i[1] = x+y
xmax = i[0]
xmin = i[0]
ymax = i[1]
ymin = i[1]
for i in ten:
xmax = max(xmax,i[0])
xmin = min(xmin,i[0])
ymax = max(ymax,i[1])
ymin = min(ymin,i[1])
print(max(xmax-xmin,ymax-ymin))
|
p02556
|
s813045160
|
Accepted
|
#from collections import deque,defaultdict
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7
#R = 998244353
def ddprint(x):
if DBG:
print(x)
n = inn()
x = []
y = []
for i in range(n):
xx,yy = inm()
x.append(xx)
y.append(yy)
dif = [x[i]-y[i] for i in range(n)]
sum = [x[i]+y[i] for i in range(n)]
print(max(max(dif)-min(dif),max(sum)-min(sum)))
|
p02556
|
s731479930
|
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()
print(max(a[-1] - a[0], b[-1] - b[0]))
|
p02556
|
s957995081
|
Accepted
|
max2 = lambda x,y: x if x > y else y
min2 = lambda x,y: x if x < y else y
N = int(input())
ru = -2*10**9
lu = -2*10**9
ld = -2*10**9
rd = -2*10**9
for _ in range(N):
x,y = map(int,input().split())
a = x+y
b = x-y
ru = max2(ru,a)
lu = max2(lu,-b)
ld = max2(ld,-a)
rd = max2(rd,b)
print(max2(ru+ld,lu+rd))
|
p02556
|
s824481229
|
Accepted
|
n = int(input())
max_x = max_y = - 5 * 10**9
min_x = min_y = 5 * 10**9
for i in range(n):
X, Y = map(int, input().split())
x = X + Y
y = X - Y
max_x = max(max_x, x)
max_y = max(max_y, y)
min_x = min(min_x, x)
min_y = min(min_y, y)
print(max(max_x - min_x, max_y - min_y))
|
p02556
|
s361986630
|
Accepted
|
import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
n = int(input())
xy = [[] for _ in range(n)]
f1 = []
f2 = []
for i in range(n):
x, y = map(int, input().split())
f1.append(x + y)
f2.append(x - y)
xy[i].append(x + y)
xy[i].append(abs(-x - y))
print(max(max(f1) - min(f1), max(f2) - min(f2)))
|
p02556
|
s019033582
|
Accepted
|
n = int(input())
x_plus_y = []
x_minus_y = []
for i in range(n):
x, y = map(int, input().split())
x_plus_y.append(x+y)
x_minus_y.append(x-y)
x_plus_y_max = max(x_plus_y)
x_plus_y_min = min(x_plus_y)
x_minus_y_max = max(x_minus_y)
x_minus_y_min = min(x_minus_y)
print(max(x_plus_y_max - x_plus_y_min,
x_minus_y_max - x_minus_y_min))
|
p02556
|
s678392773
|
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)
print(ans)
|
p02556
|
s979871042
|
Accepted
|
n = int(input())
d1 = []
d2 = []
for _ in range(n):
a,b = map(int,input().split())
d1.append(a+b)
d2.append(a-b)
print(max(max(d1)-min(d1),max(d2)-min(d2)))
|
p02556
|
s058888975
|
Accepted
|
N=int(input())
A=list()
B=list()
for i in range(N):
x,y=map(int,input().split())
A.append(x+y)
B.append(x-y)
s=max(A)-min(A)
t=max(B)-min(B)
print(max(s,t))
|
p02556
|
s915734552
|
Accepted
|
n = int(input())
x = []
y = []
for i in range(n):
l = list(map(int, input().split()))
x.append(l[0]+l[1])
y.append(l[0]-l[1])
print(max(max(x)-min(x), max(y)-min(y)))
|
p02556
|
s970201211
|
Accepted
|
INF=10**10
n=int(input())
f=lambda:map(int,input().split())
s_min=t_min=INF
s_max=t_max=-INF
for _ in range(n):
x,y=f()
s_min=min(s_min,x+y)
s_max=max(s_max,x+y)
t_min=min(t_min,x-y)
t_max=max(t_max,x-y)
print(max(s_max-s_min,t_max-t_min))
|
p02556
|
s793639049
|
Accepted
|
# coding: utf-8
# Your code here!
N=int(input())
Z=[]
W=[]
for _ 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
|
s180149791
|
Accepted
|
N = int(input())
p = [0] * N
m = [0] * N
for i in range(N):
x, y = map(int, input().split())
p[i] = x + y
m[i] = x - y
pm = max(p) - min(p)
mm = max(m) - min(m)
print(max(pm, mm))
|
p02556
|
s055680604
|
Accepted
|
def main():
N = int(input())
x, y = map(int, input().split())
a1 = x + y
a2 = x + y
b1 = y - x
b2 = y - x
N -= 1
while N != 0:
x, y = map(int, input().split())
a1 = max(a1, x + y)
a2 = min(a2, x + y)
b1 = max(b1, y - x)
b2 = min(b2, y - x)
N = N - 1
print(max(a1 - a2, b1 - b2))
main()
|
p02556
|
s020353016
|
Accepted
|
def main():
n = int(input())
plus = []
minus = []
for _ in range(n):
x, y = map(int, input().split())
plus.append(x + y)
minus.append(x - y)
plus_max = max(plus)
plus_min = min(plus)
minus_max = max(minus)
minus_min = min(minus)
print(max(plus_max - plus_min, minus_max - minus_min))
if __name__ == "__main__":
main()
|
p02556
|
s738126756
|
Accepted
|
n = int(input())
xy = [list(map(int,input().split()))for _ in range(n)]
iti = -float("inf")
ni = -float("inf")
san = -float("inf")
yon = -float("inf")
for x,y in xy:
iti = max(iti,x+y)
ni = max(ni,x-y)
san = max(san,-x+y)
yon = max(yon,-x-y)
print(max(iti+yon,ni+san))
|
p02556
|
s161956576
|
Accepted
|
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
f0 = [x - y for x, y in xy]
f1 = [x + y for x, y in xy]
f0.sort()
f1.sort()
ans = max((f0[-1] - f0[0]), (f1[-1] - f1[0]))
print(ans)
|
p02556
|
s023698681
|
Accepted
|
n = int(input())
f0, f1 = [0] * n, [0] * n
for i in range(n):
x, y = map(int, input().split())
f0[i] = x - y
f1[i] = x + y
print(max(max(f0) - min(f0), max(f1) - min(f1)))
|
p02556
|
s231747879
|
Accepted
|
n=int(input())
minx=10**10
maxx=-10**10
miny=10**10
maxy=-10**10
for _ in range(n):
x,y=map(int,input().split())
maxx=max(maxx,x+y)
minx=min(minx,x+y)
maxy=max(maxy,x-y)
miny=min(miny,x-y)
print(max(maxx-minx,maxy-miny))
|
p02556
|
s787792913
|
Accepted
|
#coding:utf-8
N = int(input())
sa_lis = []
wa_lis = []
for i in range(N):
x,y = map(int,input().split())
sa_lis.append(x-y)
wa_lis.append(x+y)
sa = max(sa_lis) - min(sa_lis)
wa = max(wa_lis) - min(wa_lis)
ans = max(sa,wa)
print("{}".format(ans))
|
p02556
|
s140482287
|
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
|
s263503901
|
Accepted
|
n=int(input())
zl,wl=[],[]
for i in range(n):
x,y=map(int,input().split())
z=x+y
w=x-y
zl.append(z)
wl.append(w)
zl.sort()
wl.sort()
print(max(zl[-1]-zl[0],wl[-1]-wl[0]))
|
p02556
|
s420952061
|
Accepted
|
# import sys
# input = sys.stdin.readline
def mp(): return map(int, input().split())
def lmp(): return list(map(int, input().split()))
n = int(input())
point = []
p = []
m = []
for i in range(n):
a,b = mp()
point.append((a,b))
p.append(a+b)
m.append(a-b)
print(max(max(p)-min(p), max(m)-min(m)))
|
p02556
|
s686610571
|
Accepted
|
N = int(input())
xy = [tuple(map(int, input().split())) for i in range(N)]
F = [0]*N
for i in range(N):
F[i] = xy[i][0] - xy[i][1]
ans = max(F) - min(F)
for i in range(N):
F[i] = xy[i][0] + xy[i][1]
ans2 = max(F) - min(F)
print(max(ans, ans2))
|
p02556
|
s079798234
|
Accepted
|
import numpy as np
n = int(input())
xy = np.array([list(map(int,input().split())) for _ in range(n)],int)
x = xy[:,0]
y = xy[:,1]
a = x+y
b = -x+y
ans = max(a.max() - a.min(), b.max()-b.min())
print(ans)
|
p02556
|
s837302680
|
Accepted
|
from sys import stdin
input = stdin.readline
N = int(input())
xy = [list(map(int, input().split())) for _ in range(N)]
z = []
w = []
for x, y in xy:
z.append(x + y)
w.append(x - y)
ans = max(max(z) - min(z), max(w) - min(w))
print(ans)
|
p02556
|
s759610830
|
Accepted
|
def main():
import sys
N=int(sys.stdin.readline())
xpy=[]
xmy=[]
for i in range(N):
x,y=list(map(int,sys.stdin.readline().split()))
xpy.append(x+y)
xmy.append(x-y)
t1=max(xpy)-min(xpy)
t2=max(xmy)-min(xmy)
print(max(t1,t2))
main()
|
p02556
|
s075993286
|
Accepted
|
import sys
def input(): return sys.stdin.readline().rstrip()
N = int(input())
X = []
Y = []
for i in range(N):
x,y = map(int,input().split())
X.append(x)
Y.append(y)
ans1 = []
ans2 = []
for i in range(N):
ans1.append(X[i] + Y[i])
ans2.append(Y[i] - X[i])
ans1.sort()
ans2.sort()
a = ans1[-1] - ans1[0]
b = ans2[-1] - ans2[0]
print(max(a,b))
|
p02556
|
s516517720
|
Accepted
|
n = int(input())
fx_list = []
fy_list = []
for i in range(n):
x,y = (int(x) for x in input().split())
fx_list.append(x-y)
fy_list.append(x+y)
a = max(fx_list) - min(fx_list)
b = max(fy_list) - min(fy_list)
print(max([a,b]))
|
p02556
|
s414828415
|
Accepted
|
N = int(input())
M0 = M1 = -float('inf')
m0 = m1 = float('inf')
for _ in range(N):
x, y = map(int, input().split())
M0 = max(M0, x - y)
m0 = min(m0, x - y)
M1 = max(M1, x + y)
m1 = min(m1, x + y)
print(max(M0 - m0, M1 - m1))
|
p02556
|
s553335902
|
Accepted
|
n=int(input())
xy=[[0]*n,[0]*n,[0]*n,[0]*n]
for i in range(n):
x,y=map(int,input().split())
xy[0][i]=x+y
xy[1][i]=x-y
xy[2][i]=-x+y
xy[3][i]=-x-y
print(max(max(xy[0])-min(xy[0]),max(xy[1])-min(xy[1]),max(xy[2])-min(xy[2]),max(xy[3])-min(xy[3])))
|
p02556
|
s395148806
|
Accepted
|
n = int(input())
xy = [list(map(int,input().split())) for _ in range(n)]
L1 = [i[0] + i[1] for i in xy]
L2 = [i[0] - i[1] for i in xy]
m1 = max(L1) - min(L1)
m2 = max(L2) - min(L2)
print( max(m1, m2) )
|
p02556
|
s795640518
|
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
|
s420060435
|
Accepted
|
n=int(input())
num=[list(map(int,input().split())) for _ in range(n)]
n1=[]
num1=10**9
ans=0
for i in range(n):
n1.append(num[i][0]+num[i][1])
ans=max(ans,max(n1)-min(n1))
n1=[]
for i in range(n):
n1.append(num1-num[i][0]+num[i][1])
ans=max(ans,max(n1)-min(n1))
print(ans)
|
p02556
|
s795575966
|
Accepted
|
n = int(input())
min_x = 10 ** 9
max_x = -(10 ** 9)
min_y = 10 ** 9
max_y = -(10 ** 9)
for i in range(n):
a, b = map(int, input().split())
x = a + b
y = a - b
min_x = min(min_x, x)
max_x = max(max_x, x)
min_y = min(min_y, y)
max_y = max(max_y, y)
print(max(max_x - min_x, max_y - min_y))
|
p02556
|
s075074018
|
Accepted
|
N = int(input())
plus = []
minus = []
for _ in range(N):
x,y = map(int,input().split())
plus.append(x+y)
minus.append(x-y)
ans1 = max(plus) - min(plus)
ans2 = max(minus) - min(minus)
print(max(ans1,ans2))
|
p02556
|
s839880659
|
Accepted
|
N=int(input())
xx=[]
yy=[]
for i in range(N):
x,y=map(int,input().split())
xx.append(x+y)
yy.append(x-y)
xx.sort()
yy.sort()
print(max(xx[-1]-xx[0],yy[-1]-yy[0]))
|
p02556
|
s960147919
|
Accepted
|
N = int(input())
XY = [[int(_) for _ in input().split()] for _ in range(N)]
ans = -1
for dx, dy in ((1, 1), (-1, 1), (-1, -1), (1, -1)):
xy2 = sorted(x * dx + y * dy for x, y in XY)
ans = max(ans, max(xy2) - min(xy2))
print(ans)
|
p02556
|
s676044013
|
Accepted
|
def main():
point_count = int(input())
sums = set()
diffs = set()
for _ in range(point_count):
x, y = [int(x) for x in input().split()]
sums.add(x + y)
diffs.add(x - y)
pat_sum = max(sums) - min(sums) # max (Xi + Yi) - (Xj + Yj)
pat_diff = max(diffs) - min(diffs) # max (Xi - Yi) - (Xj - Yj)
return max(pat_sum, pat_diff)
if __name__ == '__main__':
print(main())
|
p02556
|
s444084483
|
Accepted
|
N = int(input())
p_list = []
for i in range(N):
x, y = map(int, input().split())
p_list.append((x, y))
f0_list = [x+y for x, y in p_list]
f1_list = [x-y for x, y in p_list]
max_f0 = max(f0_list) - min(f0_list)
max_f1 = max(f1_list) - min(f1_list)
print(max([max_f0, max_f1]))
|
p02556
|
s102811507
|
Accepted
|
N = int(input())
plus = []
minus = []
for i in range(N):
x,y = map(int,input().split())
plus.append(x+y)
minus.append(x-y)
plus.sort()
minus.sort()
ans_1 = plus[-1]-plus[0]
ans_2 = abs(minus[-1]-minus[0])
print(max(ans_1,ans_2))
|
p02556
|
s821760009
|
Accepted
|
import numpy as np
N = int(input())
XY = []
for i in range(N):
XY.append([int(i) for i in input().split()])
XY = np.array(XY)
X = XY[:,0]
Y = XY[:,1]
pxpy = X + Y
pxmy = X - Y
mxpy =-X + Y
mxmy =-X - Y
candi = [np.argmax(pxpy),np.argmax(pxmy),np.argmax(mxpy),np.argmax(mxmy)]
cand = [XY[candi[i]] for i in range(4)]
manh = [abs(cand[0][0] - cand[3][0]) + abs(cand[0][1] - cand[3][1]), abs(cand[1][0] - cand[2][0]) + abs(cand[1][1] - cand[2][1])]
print(max(manh))
|
p02556
|
s002406967
|
Accepted
|
n=int(input())
p=[]
m=[]
for i in range(n):
x,y=list(map(int,input().split()))
p.append(x+y)
m.append(x-y)
minp=min(p)
maxp=max(p)
minm=min(m)
maxm=max(m)
ans=[maxp-minp,maxm-minm,minm,maxm,minp-maxp]
print(max(ans))
|
p02556
|
s115171724
|
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)
print(max(max(lx)-min(lx),max(ly)-min(ly)))
|
p02556
|
s131063497
|
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)
ans = max(max(z) - min(z), max(w) - min(w))
print(ans)
|
p02556
|
s204281632
|
Accepted
|
N = int(input())
x = []
y = []
for i in range(N):
a = tuple(map(int, input().split()))
x.append(a[0] + a[1])
y.append(a[0] - a[1])
x.sort()
y.sort()
print(max(abs(y[0] - y[-1]), abs(x[-1] - x[0])) if x and y else abs(x[-1] - x[0]) if x else abs(y[0] - y[-1]))
|
p02556
|
s157355784
|
Accepted
|
n=int(input())
ans=0
xway=[]
xsay=[]
for i in range(n):
t1,t2=map(int,input().split())
xway.append(t1+t2)
xsay.append(t1-t2)
xway.sort()
xsay.sort()
ans=max(ans,xway[-1]-xway[0])
ans=max(ans,xsay[-1]-xsay[0])
print(ans)
|
p02556
|
s992452704
|
Accepted
|
n = int(input())
x = []
y = []
for i in range(n):
tmp_x, tmp_y = list(map(int, input().split()))
x.append(tmp_x + tmp_y)
y.append(tmp_x - tmp_y)
max_x = max(x) - min(x)
max_y = max(y) - min(y)
print(max(max_x, max_y))
|
p02556
|
s903622562
|
Accepted
|
def main():
point_count = int(input())
sums = []
diffs = []
for _ in range(point_count):
x, y = [int(x) for x in input().split()]
sums.append(x + y)
diffs.append(x - y)
pat_sum = max(sums) - min(sums) # max (Xi + Yi) - (Xj + Yj)
pat_diff = max(diffs) - min(diffs) # max (Xi - Yi) - (Xj - Yj)
return max(pat_sum, pat_diff)
if __name__ == '__main__':
print(main())
|
p02556
|
s533831283
|
Accepted
|
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
n = int(input())
INF = float('inf')
plusmax = minusmax =-INF
plusmin = minusmin = INF
for i in range(n):
x, y = map(int, input().split())
x_minus_y = x-y
x_plus_y = x+y
plusmax = max(plusmax, x_plus_y)
plusmin = min(plusmin, x_plus_y)
minusmax = max(minusmax, x_minus_y)
minusmin = min(minusmin, x_minus_y)
ans0 = plusmax - plusmin
ans1 = minusmax - minusmin
print( max(ans0, ans1))
|
p02556
|
s185337591
|
Accepted
|
import sys
input=sys.stdin.readline
n=int(input())
ab=[]
A=-1e20
B=-1e20
C=1e20
D=1e20
for i in range(n):
x,y=map(int,input().split())
A=max(A,x+y)
B=max(B,x-y)
C=min(C,x+y)
D=min(D,x-y)
print(max(A-C,B-D))
|
p02556
|
s002295071
|
Accepted
|
N = int(input())
a = []
b = []
for i in range(N):
x,y = (list(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
|
s794677811
|
Accepted
|
n=int(input())
a=[]
b=[]
for _ in range(n):
x,y=map(int,input().split())
a+=[x-y]
b+=[x+y]
a.sort()
b.sort()
print(max(a[-1]-a[0],b[-1]-b[0]))
|
p02556
|
s514638533
|
Accepted
|
N = int(input())
xy = [list(map(int, input().split())) for _ in range(N)]
p1 = []
p2 = []
p3 = []
for i in range(N):
p1.append(xy[i][0] + xy[i][1])
p2.append(xy[i][0] - xy[i][1])
p3.append(-xy[i][0] + xy[i][1])
p1_r = max(p1) - min(p1)
p2_r = max(p2) - min(p2)
p3_r = max(p3) - min(p3)
print(max(p1_r, p2_r, p3_r))
|
p02556
|
s666831156
|
Accepted
|
N = int(input())
X, Y = zip(*[[int(a) for a in input().split()] for _ in range(N)])
L = [(x, y, x + y, y - x) for x, y in zip(X, Y)]
L.sort(key = lambda a : a[2]) # x+yでソート
ans = abs(L[0][0] - L[-1][0]) + abs(L[0][1] - L[-1][1])
L.sort(key = lambda a : a[3]) # y-xでソート
ans = max(ans, abs(L[0][0] - L[-1][0]) + abs(L[0][1] - L[-1][1]))
print(ans)
|
p02556
|
s106381659
|
Accepted
|
n = int(input())
answer1 = 0
answer2 = 0
answer = 0
a = [0]*n
b = [0]*n
x = 0
y = 0
for i in range(n):
x,y = map(int,input().split())
a[i] = x-y
b[i] = x+y
answer1 = max(a)-min(a)
answer2 = max(b)-min(b)
print(max(answer1,answer2))
|
p02556
|
s303223457
|
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()
answer = max(a[-1] - a[0], b[-1] - b[0])
print(answer)
|
p02556
|
s927121346
|
Accepted
|
n = int(input())
p, m = [], []
for i in range(n):
x, y = map(int, input().split())
p.append(x + y)
m.append(x - y)
p.sort()
m.sort()
print(max(p[-1] - p[0], m[-1] - m[0]))
|
p02556
|
s348922661
|
Accepted
|
n = int(input())
l1 = []
l2 = []
for i in range(n):
x1,y1 = map(int,input().split())
l1.append(x1-y1)
l2.append(x1+y1)
l1 = sorted(l1)
l2 = sorted(l2)
a = l1[-1]
b = l1[0]
c = l2[-1]
d = l2[0]
ans = max(a-b, c-d)
print(ans)
|
p02556
|
s694149607
|
Accepted
|
n = int(input())
LIST=[list(map(int,input().split()))for i in range(n)]
plus=[i[0]+i[1]for i in LIST]
minus=[i[0]-i[1]for i in LIST]
d_plus=max(plus)-min(plus)
d_minus=max(minus)-min(minus)
print(max(d_plus, d_minus))
|
p02556
|
s805409751
|
Accepted
|
N = int(input())
XY = [list(map(int, input().split())) for _ in range(N)]
for i in range(N):
XY[i] = [XY[i][0] - XY[i][1], XY[i][0] + XY[i][1]]
X = [XY[i][0] for i in range(N)]
Y = [XY[i][1] for i in range(N)]
X.sort()
Y.sort()
print(max(X[-1] - X[0], Y[-1] - Y[0]))
|
p02556
|
s948442493
|
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
|
s292406691
|
Accepted
|
# -*- coding: utf-8 -*-
"""
Created on Sun Sep 13 20:41:42 2020
@author: liang
"""
#E
N = int(input())
d = list()
for i in range(N):
x, y = map(int,input().split())
d.append((x,y))
d.sort(key=lambda x:x[0]+x[1])
#print(d)
ans1 = abs(d[0][0] - d[N-1][0]) + abs(d[0][1] - d[N-1][1])
d.sort(key=lambda x:x[0]-x[1])
ans2 = abs(d[0][0] - d[N-1][0]) + abs(d[0][1] - d[N-1][1])
ans = max(ans1, ans2)
print(ans)
|
p02556
|
s518457292
|
Accepted
|
n = int(input())
d0 = []
d1 = []
for i in range(n):
xi,yi = map(int,input().split())
d0.append(xi-yi)
d1.append(xi+yi)
print(max(max(d0)-min(d0),max(d1)-min(d1)))
|
p02556
|
s718818919
|
Accepted
|
n = int(input())
xy = []
for _ in range(n):
x,y = map(int,input().split())
xy.append((x,y))
al,be = 1000000000,1000000000
f = [(1,1),(1,-1),(-1,1),(-1,-1)]
ans = -1145141919810364
for k,l in f:
alfa = al * k
beta = be * l
man = []
for i,j in xy:
man.append(abs(alfa-i) + abs(beta-j))
ans = max(ans,max(man) - min(man))
print(ans)
|
p02556
|
s916071972
|
Accepted
|
n = int(input())
point = []
ans = -1
for i in range(n):
point.append(list(map(int, input().split())))
x_sub_y = []
x_plus_y = []
for i in range(n):
x_sub_y.append(point[i][0] - point[i][1])
x_plus_y.append(point[i][0] + point[i][1])
x_sub_y.sort()
x_plus_y.sort()
ans = max(ans, x_sub_y[-1] - x_sub_y[0], x_plus_y[-1] - x_plus_y[0])
print(ans)
|
p02556
|
s284272809
|
Accepted
|
N = int(input())
ls = []
lt= []
for _ in range(N):
x,y = map(int, input().split())
s = x+y
t = x-y
ls.append(s)
lt.append(t)
print(max(max(ls) - min(ls),max(lt) - min(lt)))
|
p02556
|
s147055797
|
Accepted
|
n = int(input())
x,y = map(int,input().split())
max_xpy = x+y
min_xpy = x+y
max_xmy = x-y
min_xmy = x-y
for i in range(n-1):
x,y = map(int,input().split())
max_xpy = max(max_xpy,x+y)
min_xpy = min(min_xpy,x+y)
max_xmy = max(max_xmy,x-y)
min_xmy = min(min_xmy,x-y)
print(max(max_xpy-min_xpy,max_xmy-min_xmy))
|
p02556
|
s579966333
|
Accepted
|
N = int(input())
XY = [list(map(int, input().split())) for _ in range(N)]
XplusY = [x + y for x, y in XY]
XminusY = [x - y for x, y in XY]
print(max([max(XplusY) - min(XplusY), max(XminusY) - min(XminusY)]))
|
p02556
|
s437805122
|
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,b=max(A)-min(A),max(B)-min(B)
print(max(a,b))
|
p02556
|
s746642473
|
Accepted
|
N=int(input())
X=[list(map(int,input().split())) for i in range(N)]
for i in range(N):
X[i]=[X[i][0]+X[i][1],X[i][0]-X[i][1]]
print(max([max([X[i][j] for i in range(N)])-min([X[i][j] for i in range(N)]) for j in range(2)]))
|
p02556
|
s938955005
|
Accepted
|
N,*f = map(int, open(0).read().split())
xy = [f[i*2:i*2+2] for i in range(N)]
s = [sum(z) for z in xy]
a = max(s) - min(s)
t = [z[0]-z[1] for z in xy]
b = max(t) - min(t)
print(max(a,b))
|
p02556
|
s640374695
|
Accepted
|
N = int(input())
a = - (10 ** 9 + 3) # max(x + y)
b = 10 ** 9 + 3 # min(x + y)
c = - (10 ** 9 + 3) # max(x - y)
d = 10 ** 9 + 3 # min(x - y)
for i in range(N):
x, y = map(int, input().split())
a = max(a, x + y)
b = min(b, x + y)
c = max(c, x - y)
d = min(d, x - y)
ans = max([a - b, c - d])
print(ans)
|
p02556
|
s712624921
|
Accepted
|
N = int(input())
def dist(A, B):
return abs(A[0] - B[0]) + abs(A[1] - B[1])
XY = [tuple(map(int, input().split())) for _ in range(N)]
INF = -10**10
ans = 0
for O in [(INF, INF), (-INF, INF), (INF, -INF), (-INF, -INF)]:
S = XY[0]
for xy in XY:
if dist(O, S) < dist(O, xy):
S = xy
O = S
for xy in XY:
if dist(O, S) < dist(O, xy):
S = xy
ans = max(ans, dist(O, S))
print(ans)
|
p02556
|
s807167512
|
Accepted
|
def e_dist_max():
N = int(input())
Pos_z, Pos_w = [], [] # editorial に準ずる
for _ in range(N):
x, y = [int(i) for i in input().split()]
Pos_z.append(x + y)
Pos_w.append(x - y)
Pos_z.sort()
Pos_w.sort()
return max(Pos_z[-1] - Pos_z[0], Pos_w[-1] - Pos_w[0])
print(e_dist_max())
|
p02556
|
s004572415
|
Accepted
|
N = int(input())
x = [0]*N
y = [0]*N
f_0 = [0]*N
f_1 = [0]*N
for i in range(N):
x[i],y[i] = map(int, input().split())
f_0[i] = x[i] - y[i]
f_1[i] = x[i] + y[i]
print(max(max(f_0)-min(f_0),max(f_1)-min(f_1)))
|
p02556
|
s990059848
|
Accepted
|
n=int(input())
a=[]
b=[]
for i in range(n):
x,y=list(map(int,input().split()))
a.append(x+y)
b.append(x-y)
mnp=min(a)
mxp=max(a)
mnm=min(b)
mxm=max(b)
res=[mxp-mnp,mxm-mnm,mnm,mxm,mnp-mxp]
print(max(res))
|
p02556
|
s318431738
|
Accepted
|
beforex_plus_y=[]
beforex_minus_y=[]
for i in range(int(input())):
xy=list(map(int,input().split()))
beforex_plus_y.append(xy[0]+xy[1])
beforex_minus_y.append(xy[0]-xy[1])
print(max(max(beforex_plus_y)-min(beforex_plus_y),max(beforex_minus_y)-min(beforex_minus_y)))
|
p02556
|
s080626806
|
Accepted
|
n = int(input())
dist = []
max1 = -pow(10, 11)
min1 = pow(10, 11)
max2 = -pow(10, 11)
min2 = pow(10, 11)
for i in range(n):
x, y = (int(x) for x in input().split())
if max1 < x + y:
max1 = x + y
if min1 > x + y:
min1 = x + y
if max2 < x - y:
max2 = x - y
if min2 > x - y:
min2 = x - y
print(max(max1-min1, max2-min2))
|
p02556
|
s723534436
|
Accepted
|
n = int(input())
# マンハッタン距離
# 45度回転
z = []
w = []
for i in range(n):
x, y = map(int, input().split())
z.append(x + y)
w.append(x - y)
z.sort()
w.sort()
print(max(z[-1]-z[0], w[-1]-w[0]))
|
p02556
|
s362857559
|
Accepted
|
import sys; input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
mod = 10 ** 9 + 7; INF = float("inf")
def getlist():
return list(map(int, input().split()))
def inverse(N, mod):
return (pow(N, mod - 2, mod))
def main():
N = int(input())
L1 = []
L2 = []
for i in range(N):
x, y = getlist()
L1.append(x + y)
L2.append(x - y)
L1.sort()
L2.sort()
ans1 = L1[-1] - L1[0]
ans2 = L2[-1] - L2[0]
ans = max(ans1, ans2)
print(ans)
if __name__ == '__main__':
main()
|
p02556
|
s891190408
|
Accepted
|
N = int(input())
X = []
Y = []
P = []
Q = []
for i in range(N):
x, y = map(int, input().split())
X.append(x)
Y.append(y)
P.append(x + y)
Q.append(x - y)
print(max(max(P) - min(P), max(Q) - min(Q)))
|
p02556
|
s638672829
|
Accepted
|
n = int(input())
xy = [tuple(map(int, input().split())) for _ in range(n)]
w = [xy[i][0] - xy[i][1] for i in range(n)]
z = [xy[i][0] + xy[i][1] for i in range(n)]
print(max((max(w) - min(w)), (max(z)-min(z))))
|
p02556
|
s590379789
|
Accepted
|
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(input())
XY = [list(map(int, input().split())) for _ in range(N)]
MAX_P = 0
MIN_P = 10 ** 10
MAX_M = -(10 ** 10)
MIN_M = 10 ** 10
for x, y in XY:
P = x + y
M = x - y
MAX_P = max(MAX_P, P)
MIN_P = min(MIN_P, P)
MAX_M = max(MAX_M, M)
MIN_M = min(MIN_M, M)
ans = max(MAX_P - MIN_P, MAX_M - MIN_M)
print(ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.