problem_id
stringclasses 100
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 6
806
|
|---|---|---|---|
p02556
|
s980792344
|
Wrong Answer
|
n = int(input())
max_t = -float('inf')
min_t = float('inf')
for _ in range(n):
x, y = map(int, input().split())
c = x + y
if c > max_t:
max_t = c
if c < min_t:
min_t = c
print(max_t - min_t)
|
p02556
|
s182489253
|
Wrong Answer
|
N = int(input())
xy = [list(map(int,input().split())) for _ in range(N)]
ma = 0
mi = float('inf')
for x,y in xy:
ma = max(ma,x-y)
mi = min(mi,x-y)
ans = ma - mi
ma = 0
mi = float('inf')
for x,y in xy:
ma = max(ma,x+y)
mi = min(mi,x+y)
ans = max(ans, ma - mi)
if ans<0:
while True:
continue
print(ans)
|
p02556
|
s589223027
|
Wrong Answer
|
n = int(input())
l=[]
for i in range(n):
l.append(list(map(int,list(input().split()))))
l.sort()
c=0
print(l)
for i in range(1,n):
t = abs(l[i][0]-l[0][0])+abs(l[i][1]-l[0][1])
if t>c:
c=t
print(c)
|
p02556
|
s345021789
|
Wrong Answer
|
N = int(input())
i, j, k = 0, 0, 0
x = [0]
y = [0]
while i < N:
a, b = map(int, input().split())
x.append(a)
y.append(b)
ma = max(x[i+1]*y[i+1], x[i]*y[i])
mi = min(x[i+1]*y[i+1], x[i]*y[i])
if ma == x[i+1]*y[i+1]:
cma = i
if mi == x[i+1]*y[i+1]:
cmi = i
i += 1
print(abs(x[cma] - x[cmi]) + abs(y[cma] - y[cmi]))
|
p02556
|
s704821786
|
Wrong Answer
|
n = input()
n = int(n)
p = []
for i in range(n):
x,y = map(int, input().split(' '))
p.append([x, y])
maXP = max(p, key=lambda x:x[0])
miXP = min(p, key=lambda x:x[0])
maYP = max(p, key=lambda x:x[1])
miYP = min(p, key=lambda x:x[1])
mp = [maXP, miXP, maYP, miYP]
md = -1
for i in range(3):
for j in range(i+1, 4):
x1, y1 = mp[i]
x2, y2 = mp[j]
md = abs(x1 - x2) + abs(y1 - y2)
md = int(md)
print(md)
|
p02556
|
s914516031
|
Wrong Answer
|
n=int(input())
ansx=[]
ansy=[]
for i in range(n):
x,y=map(int,input().split())
ansx.append([x,y])
ansy.append([y,x])
ansx=sorted(ansx)
ansy=sorted(ansy)
ans=0
for i in range(n-1):
ans=max(ans,ansx[i+1][0]-ansx[0][0]+abs(ansx[0][1]-ansx[i+1][1]))
for i in range(n-1):
ans=max(ans,ansy[i+1][0]-ansy[0][0]+abs(ansy[0][1]-ansy[i+1][1]))
print(ans)
|
p02556
|
s559749955
|
Wrong Answer
|
def dist(p, q):
return abs(p[0] - q[0]) + abs(p[1] - q[1])
n = int(input())
P = [tuple(map(int, input().split())) for _ in range(n)]
P.sort()
ans = dist(P[0], P[1])
P.sort(key=lambda p: (p[0], -p[1]))
ans = max(ans, dist(P[0], P[-1]))
P.sort(key=lambda p: (p[1], p[0]))
ans = max(ans, dist(P[0], P[-1]))
P.sort(key=lambda p: (p[1], -p[0]))
ans = max(ans, dist(P[0], P[-1]))
print(ans)
|
p02556
|
s468180936
|
Wrong Answer
|
N = int(input())
xy = [list(map(int,input().split())) for _ in range(N)]
man = [0] * N
for i in range(N):
man[i] = xy[i][0] + xy[i][1]
print(max(man) - min(man))
|
p02556
|
s545392953
|
Wrong Answer
|
n=int(input())
xbox=[]
ybox=[]
for i in range(n):
x,y = map(int,input().split())
xbox.append(x)
ybox.append(y)
xmax=max(xbox)
ymax=max(ybox)
box=[]
for i in range(n):
box.append(xmax+ymax-xbox[i]-ybox[i])
print(max(box)-min(box))
|
p02556
|
s929750007
|
Wrong Answer
|
N=int(input())
xy=[tuple(map(int,input().split())) for _ in range(N)]
t=[]
for x,y in xy:
t.append((x*y,x,y))
t=sorted(t)
tt=[]
tt.append(t[0])
tt.append(t[-1])
t=sorted(t,key=lambda x:x[1])
tt.append(t[0])
tt.append(t[-1])
t=sorted(t,key=lambda x:x[2])
tt.append(t[0])
tt.append(t[-1])
n=len(tt)
ans=0
for i in range(n):
for j in range(i+1,n):
ans=max(ans,abs(tt[i][1]-tt[j][1])+abs(tt[i][2]-tt[j][2]))
print(ans)
|
p02556
|
s866992673
|
Wrong Answer
|
N=int(input())
answer=0
xylist=[]
pxylist=[]
mxylist=[]
for _ in range(N):
x,y=map(int,input().split())
xylist.append((x,y))
pxylist.append(x+y)
mxylist.append(x-y)
pxylist.sort()
mxylist.sort()
answer=max(pxylist[-1]-pxylist[0],mxylist[-1],mxylist[0])
print(answer)
|
p02556
|
s995628730
|
Wrong Answer
|
count = 0
count2 = 0
count3 = []
count4 = []
for _ in range(int(input())):
x, y = list(map(int, input().split()))
count = max(count, abs(x + y))
count2 = max(count2, abs(x - y))
count3.append((x + y))
count4.append((x - y))
z = min(count3)
zz = min(count4)
print(max(count-z, count2-zz))
|
p02556
|
s594414417
|
Wrong Answer
|
n = int(input())
x = []
y = []
distance = []
for i in range(n):
x1, y1 = input().split()
x1 = int(x1)
y1 = int(y1)
x.append(x1)
y.append(y1)
for i in range(len(x)):
for j in range(i+1,len(x)):
temp = abs(x[i] - x[j]) + abs(y[i] - y[j])
distance.append(temp)
print(distance)
max = distance[0]
for i in range(1,len(distance)-1):
if distance[i] >= max:
max = distance[i]
print(max)
|
p02556
|
s081443185
|
Wrong Answer
|
import sys
input = sys.stdin.readline
n = int(input())
xy = tuple(map(int, input().split()))
M = sum(xy)
Mxy = xy
m = M
mxy = xy
for _ in range(n - 1):
xy = tuple(map(int, input().split()))
s = sum(xy)
if s > M:
M = s
Mxy = xy
if s < m:
m = s
mxy = xy
print(abs(Mxy[0]-mxy[0])+abs(Mxy[1]-mxy[1]))
|
p02556
|
s418927475
|
Wrong Answer
|
n = int(input())
a = []
b = []
for i in range(n):
x,y = map(int, input().split())
a.append(x+y)
b.append(abs(x-y))
a.sort()
b.sort()
ans = a[-1]-a[0]
c = b[-1]-b[0]
print (max(ans,c))
|
p02556
|
s273264840
|
Wrong Answer
|
N = int(input())
tmp1 = []
for i in range(N):
x,y = map(int,input().split())
tmp1.append([x,y,abs(x)+abs(y)])
if len(tmp1) > 0:
tmp = []
for i in range(len(tmp1)):
tmp.append(tmp1[i][2])
ans = max(tmp)-min(tmp)
print(ans)
|
p02556
|
s762131608
|
Wrong Answer
|
input=__import__('sys').stdin.readline
def getdist(a,b):return abs(a[0]-b[0])+abs(a[1]-b[1])
n=int(input())
s=[]
for _ in range(n):
s+=[*map(int,input().split())],
s.sort()
ans=0
for i in s:
ans=max(ans,getdist(s[0],i))
ans=max(ans,getdist(s[-1],i))
s.sort(key=lambda x:x[1])
for i in s:
ans=max(ans,getdist(s[0],i))
ans=max(ans,getdist(s[-1],i))
print(ans)
|
p02556
|
s765500891
|
Wrong Answer
|
n = int(input())
maxx, minx, maxy, miny = -1**10, 1**10, -1**10, 1**10
for _ in range(n):
x, y = map(int, input().split())
x, y = x+y, x-y
maxx = max(maxx, x)
minx = min(minx, x)
maxy = max(maxy, y)
miny = min(miny, y)
print(max(maxx - minx, maxy - miny))
|
p02556
|
s907249795
|
Wrong Answer
|
N = int(input())
v = [list(map(int, input().split())) for i in range(N)]
v.sort(key = lambda x:abs(x[0]) + abs(x[1]))
d = abs(v[0][0] - v[N-1][0]) + abs(v[0][1] - v[N-1][1])
print(d)
|
p02556
|
s370137610
|
Wrong Answer
|
N = int(input())
x = []
for _ in range(N):
x.append(list(map(int, input().split())))
x.sort(key=lambda x: x[0])
def dist(x_1, y_1, x_2, y_2):
return abs(x_1 - x_2) + abs(y_1 - y_2)
ans = 0
for i in range(1, N):
tmp = dist(*x[i], *x[0])
if tmp > ans:
ans = tmp
x.sort(key=lambda x: x[1])
for i in range(1, N):
tmp = dist(*x[i], *x[0])
if tmp > ans:
ans = tmp
print(ans)
|
p02556
|
s640579101
|
Wrong Answer
|
import sys
from itertools import combinations
def input(): return sys.stdin.readline().strip()
def main():
"""
https://www.quora.com/How-can-I-find-the-maximum-Manhattan-distance-between-2-points-from-a-given-set-of-points
"""
N = int(input())
x, y = map(int, input().split())
maximal = x + y
minimal = x + y
for _ in range(N - 1):
x, y = map(int, input().split())
maximal = max(maximal, x + y)
minimal = min(minimal, x + y)
print(maximal - minimal)
if __name__ == "__main__":
main()
|
p02556
|
s313472420
|
Wrong Answer
|
N = int(input())
ls = []
for i in range(N):
x,y = map(int,input().split())
ls.append(x+y)
print(max(ls)-min(ls))
|
p02556
|
s083923043
|
Wrong Answer
|
n=int(input())
a_list=[list(map(int,input().split())) for i in range(n)]
A=[]
for i in range(n):
A.append(a_list[i][0]**2+a_list[i][1]**2)
X=A.index(max(A))
X=int(X)
Y=A.index(min(A))
Y=int(Y)
print(abs(a_list[X][0]-a_list[Y][0])+abs(a_list[X][1]-a_list[Y][1]))
|
p02556
|
s839606055
|
Wrong Answer
|
from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))
n=int(input())
if n==1:
print(0)
exit()
z_max=0
z_min=10**10
w_max=0
w_min=10**10
for i in range(n):
x,y=nii()
z=x+y
z_max=max(z_max,z)
z_min=min(z_min,z)
w=x-y
w_max=max(w_max,w)
w_min=min(w_min,w)
ans=max(z_max-z_min,w_max-w_min)
print(ans)
|
p02556
|
s436437129
|
Wrong Answer
|
N = int(input())
xy = [map(int, input().split()) for _ in range(N)]
x, y = [list(i) for i in zip(*xy)]
z = []
for i in range(0,len(x)):
z.append(x[i]+y[i])
max = max(z)
min = min(z)
print(abs(max-min))
|
p02556
|
s109446758
|
Wrong Answer
|
N = int(input())
A = [list(map(int, (input().split(' ')))) for i in range(N)]
hoge = [sum(a) for a in A]
print(max(hoge) - min(hoge))
|
p02556
|
s344616396
|
Wrong Answer
|
N = int(input())
Array = []
for i in range(N):
next_x, next_y = map(int, input().split())
Array.append([next_x,next_y])
print(Array)
Array2 = []
Point1x = 0
Point1y = 0
Point2x = 0
Point2y = 0
for i in range(N):
for j in range(N):
Point1x = Array[i][0]
Point1y = Array[i][1]
Point2x = Array[j][0]
Point2y = Array[j][1]
Dist = abs(Point1x-Point2x) + abs(Point1y-Point2y)
Array2.append(Dist)
print(max(Array2))
|
p02556
|
s188938488
|
Wrong Answer
|
n = int(input())
tab = []
rtab = []
for i in range(n):
a, b = map(int, input().split())
tab.append([a, b])
rtab.append([b, a])
tab.sort()
rtab.sort()
m = 0
j = n - 1
for i in range(n):
m = max(m, abs(tab[i][0] - tab[j][0]) + abs(tab[i][1] - tab[j][1]))
m = max(m, abs(rtab[i][0] - rtab[j][0]) + abs(rtab[i][1] - rtab[j][1]))
j -= 1
print(m)
|
p02556
|
s214483522
|
Wrong Answer
|
N = int(input())
xy = [list(map(int,input().split())) for _ in range(N)]
ma = 0
mi = float('inf')
for x,y in xy:
ma = max(ma,x-y)
mi = min(mi,x-y)
ans = ma - mi
for x,y in xy:
ma = max(ma,x+y)
mi = min(mi,x+y)
ans = max(ans, ma - mi)
print(ans)
|
p02556
|
s959581356
|
Wrong Answer
|
import math
n=int(input())
a,b=0,0
c,v,b,m=0,0,0,0
for i in range(n):
x,y=map(int,input().split())
c=max(x+y,c)
if i==0:
v=x+y
else:
v=min(x+y,v)
b=max(math.fabs(x-y),b)
if i==0:
m=math.fabs(x-y)
else:
m=min(math.fabs(x-y),m)
print(int(max(c-v, b-m)))
|
p02556
|
s857594397
|
Wrong Answer
|
n = int(input())
M1, M2 = 0, 0
m1 = m2 = float('inf')
for i in range(n):
x, y = map(int, input().split())
d1 = x+y
d2 = x-y
M1 = max(M1, d1)
m1 = min(m1, d1)
M2 = max(M2, d2)
m2 = min(m2, d2)
d1 = M1-m1
d2 = M2-m2
print(max(d1, d2))
|
p02556
|
s713058316
|
Wrong Answer
|
n = int(input())
p = [list(map(int, input().split())) for i in range(n)]
a = 2000000000
b = 0
for x, y in p:
a = min(a, x + y)
b = max(b, x + y)
print(b - a)
|
p02556
|
s631612083
|
Wrong Answer
|
n = int(input())
dist = []
max = -pow(10, 10)
min = pow(10, 10)
for i in range(n):
x, y = (int(x) for x in input().split())
if max < x + y:
max = x + y
if min > x + y:
min = x + y
print(max-min)
|
p02556
|
s475431453
|
Wrong Answer
|
N=int(input())
listA=[]
while True:
try:
a,b=map(int, input().split())
listA.append(a+b)
except:
break;
listB=set(listA)
print(max(listB)-min(listB))
|
p02556
|
s257578033
|
Wrong Answer
|
import sys
input = sys.stdin.readline
N = int(input())
xy = [[int(i) for i in input().split()] for _ in range(N)]
d1 = []
d2 = []
for x, y in xy :
d1.append(x + y)
d2.append(x - y)
d1.sort(reverse=True)
d2.sort(reverse=True)
print(max(
d1[0] - d1[-1],
d1[-1] - d1[0],
d2[0] + d2[-1],
d2[-1] - d2[0])
)
|
p02556
|
s432752814
|
Wrong Answer
|
n=int(input())
D=0
d=10**10
for i in range(n):
x,y=[int(x) for x in input().split()]
l=x+y
d=min(d,l)
D=max(D,l)
print(D-d)
|
p02556
|
s068271587
|
Wrong Answer
|
N = int(input())
plus = []
for i in range(N):
x,y = map(int,input().split())
plus.append([x+y,x,y])
plus.sort()
ans = 0
fxy,fx,fy = plus[0]
for i in range(1,N):
sxy,sx,sy = plus[i]
if fxy == sxy:
if fx != sx or fy != sy:
ans = max(ans, abs(fx-sx)-abs(fy-sy))
else:
ans = max(ans, sxy-fxy)
print(ans)
|
p02556
|
s050882945
|
Wrong Answer
|
n = int(input())
s = []
for i in range(n):
x = list(map(int, input().split()))
s.append(x)
t = sorted(s)
u = sorted(s, key=lambda x: x[1])
res = 0
for X in [t[0], u[0]]:
for Y in [t[-1], u[-1]]:
tmp = abs(X[0] - Y[0]) + abs(X[1] - Y[1])
res = max(res, tmp)
print(res)
|
p02556
|
s179879391
|
Wrong Answer
|
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[1]
b = ans2[-1] - ans2[1]
print(max(a,b))
|
p02556
|
s382236713
|
Wrong Answer
|
n=int(input())
xy=[]
for i in range(n):
tmp=list(map(int,input().split()))
xy.append(tmp)
maxz,minz,maxw,minw=0,10**10,0,10**10
for i in range(n):
maxz=max(maxz,xy[i][0]+xy[i][1])
minz=min(minz,xy[i][0]+xy[i][1])
maxw=max(maxw,xy[i][0]-xy[i][1])
minw=min(minw,xy[i][0]-xy[i][1])
print(max(maxz-minz,maxw-minw))
|
p02556
|
s223723731
|
Wrong Answer
|
N=int(input())
for i in range(N):
x,y = map(int,input().split())
if i == 0:
max = x+y
min = x+y
else:
if max > x+y:
max = x+y
if min < x+y:
min = x+y
print(abs(max-min))
|
p02556
|
s518708217
|
Wrong Answer
|
N = int(input())
Xmax = 0
Ymax = 0
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
|
s896434107
|
Wrong Answer
|
import math
n=int(input())
c,v,b,m=0,0,0,0
for i in range(n):
x,y=map(int,input().split())
c=max(x+y,c)
if i==0:
v=x+y
else:
v=min(x+y,v)
b=max(math.fabs(x-y),b)
if i==0:
m=math.fabs(x-y)
else:
m=min(math.fabs(x-y),m)
print(int(max(c-v, b-m)))
|
p02556
|
s413268891
|
Wrong Answer
|
n = int(input())
mi, ma = 0, 0
for i in range(n):
x, y = map(int, input().split())
x, y = abs(x), abs(y)
mi = min(mi, x + y)
ma = max(ma, x + y)
print(ma - mi)
|
p02556
|
s871481942
|
Wrong Answer
|
N=int(input())
arr=[list(map(int,input().split())) for i in range(N)]
za,wa=0,0
zi,wi=10**10,10**10
for i in range(N):
z=arr[i][0]+arr[i][1]
w=arr[i][0]-arr[i][1]
za=max(z,za)
zi=min(z,zi)
wa=max(w,wa)
wi=min(w,wi)
print(max(za-zi,wa-wi))
|
p02556
|
s777790866
|
Wrong Answer
|
n=int(input())
x,y=map(int, input().split())
mn = x+y
minx = x
miny = y
mx = x+y
maxx = x
maxy = y
for i in range(n-1):
x,y=map(int, input().split())
if mn > x+y:
mn = x+y
minx = x
miny = y
elif mx < x+y:
mx = x+y
maxx = x
maxy = y
print(abs(maxx-minx)+abs(maxy-miny))
|
p02556
|
s326813554
|
Wrong Answer
|
n = int(input())
xy_array = [list(map(int, input().split())) for _ in range(n)]
th = pow(10, 9)
right_up_max = 1
left_down_min = th + 1
left_up_max = 1
right_down_min = th + 1
for x, y in xy_array:
right_up_max = max(x + y, right_up_max)
left_down_min = min(x + y, left_down_min)
left_up_max = max(th - x + y, left_up_max)
right_down_min = min(th - x + y, right_down_min)
ans = max(right_up_max - left_down_min, left_up_max - right_down_min)
print(ans)
|
p02556
|
s134546423
|
Wrong Answer
|
import itertools
n = int(input())
ps = list({
tuple(map(int, input().split()))
for _ in range(n)
})
g0 = sum([p[0] for p in ps]) / len(ps)
g1 = sum([p[1] for p in ps]) / len(ps)
maxd = 0
maxp = ps[0]
for p in ps:
d = p[0] + p[1]
if d > maxd:
maxp = p
maxd = d
maxd = 0
for p in ps:
maxd = max(maxd, abs(maxp[0] - p[0]) + abs(maxp[1] - p[1]))
print(maxd)
|
p02556
|
s152107111
|
Wrong Answer
|
n=int(input())
a = sorted([list(map(int, input().split(" "))) for i in range(n)])
base = a[0][0] + a[0][1]
maxi = 0
for i in range(n):
if a[0][0] + a[0][1] > base:
continue
else:
for j in range(i + 1, n):
maxi = max(maxi, (a[j][0] - a[i][0]) + (a[j][1] - a[i][1]))
print(maxi)
|
p02556
|
s854601511
|
Wrong Answer
|
n = int(input())
zmax = 0
zmin = 10**10
wmax = 0
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
|
s484747358
|
Wrong Answer
|
def LI():
return list(map(int, input().split()))
pu = []
mi = []
N = int(input())
for _ in range(N):
x, y = LI()
pu.append(x+y)
mi.append(x-y)
P = max(pu)
p = min(pu)
M = max(mi)
m = max(mi)
print(max(P-p, M-m))
|
p02556
|
s025193140
|
Wrong Answer
|
from sys import stdin
readline = stdin.readline
N = int(readline())
xy = [tuple(map(int, readline().split())) for _ in range(N)]
xy.sort()
c = set(xy[:500])
c = c | set(xy[-500:])
xy.sort(key=lambda x: x[1])
c = c | set(xy[:500])
c = c | set(xy[-500:])
c = list(c)
result = 0
for i in range(len(c)):
for j in range(i + 1, len(c)):
result = max(result, abs(c[i][0] - c[j][0]) + abs(c[i][1] - c[j][1]))
print(result)
|
p02556
|
s896967071
|
Wrong Answer
|
from sys import stdin
input = stdin.readline
N = int(input())
xy = [list(map(int, input().split())) for _ in range(N)]
for i in range(N):
xy[i].append(sum(xy[i]))
xy.sort(key=lambda x: x[2])
x, y, tmp = xy[0]
ans = 0
for i in range(1, N):
ans = max(ans, abs(x - xy[i][0]) + abs(y - xy[i][1]))
print(ans)
|
p02556
|
s828345747
|
Wrong Answer
|
n=int(input())
l1=[]
l2=[]
for _ in range(n):
x,y=map(int,input().split())
l1.append(x+y)
l2.append(abs(x-y))
print(max(max(l1)-min(l1),max(l2)-min(l2)))
|
p02556
|
s806324656
|
Wrong Answer
|
n=int(input())
a=[]
j=k=0
def s(a):
return a[0]+a[1]
for i in range(n):
f=list(map(int,input().split()))
a.append(f)
print(max(map(s,a))-min(map(s,a)))
|
p02556
|
s386450521
|
Wrong Answer
|
n = int(input())
list1 = []
for i in range(n):
x, y = map(int, input().split())
d = abs(x) + abs(y)
list1.append(d)
ans = max(list1) - min(list1)
print(ans)
|
p02556
|
s431396665
|
Wrong Answer
|
n = int(input())
x_list = []
y_list = []
for _ in range(n):
x, y = map(int, input().split())
x_list.append(x)
y_list.append(y)
x_list.sort()
y_list.sort()
ans = x_list[-1] - x_list[0] + y_list[-1] - y_list[0]
print(ans)
|
p02556
|
s523780765
|
Wrong Answer
|
N = int(input())
A = 0
Xmin = Ymin = 1e9 + 5
Xmax = Ymax = 0
for _ in range(N):
x, y = map(int, input().split())
X = x + y
Y = x - y
Xmin = min(Xmin, X)
Xmax = max(Xmax, X)
Ymin = min(Ymin, Y)
Ymax = max(Ymax, Y)
if Xmin == 1e9 + 5:
Xmin = Xmax
if Ymin == 1e9 + 5:
Ymin = Ymax
Z = max(Xmax - Xmin, Ymax - Ymin)
print(Z)
|
p02556
|
s046195626
|
Wrong Answer
|
from collections import deque
def dist(A,B):
return abs(A[0]-B[0])+abs(A[1]-B[1])
N=int(input())
P=[0]*N
for i in range(N):
x,y=map(int,input().split())
P[i]=(x,y)
I=0
M=-1
for i in range(N):
if M<dist(P[0],P[i]):
I=i
M=dist(P[0],P[i])
J=0
M=-1
for j in range(N):
if M<dist(P[I],P[j]):
J=j
M=dist(P[I],P[j])
print(dist(P[I],P[J]))
|
p02556
|
s371772859
|
Wrong Answer
|
import sys
import itertools
# import numpy as np
import time
import math
from heapq import heappop, heappush
from collections import defaultdict
from collections import Counter
from collections import deque
from itertools import permutations
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
N = int(input())
C = [0] * N
for i in range(N):
x, y = map(int, input().split())
C[i] = x + y
C = sorted(C)
print(abs(C[-1] - C[0]))
|
p02556
|
s868577900
|
Wrong Answer
|
n = int(input())
manhat_list = []
for num in range(n):
x, y = map(int, input().split())
manhat_list.append(x+y)
print(max(manhat_list) - min(manhat_list))
|
p02556
|
s775528798
|
Wrong Answer
|
N = int(input())
L = [list(map(int, input().split())) for _ in range(N)]
L = [l[0]+l[1] for l in L]
L.sort()
print(L[-1]-L[0])
|
p02556
|
s450191053
|
Wrong Answer
|
N = int(input())
memo = []
for i in range(N):
x,y = map(int,input().split())
memo.append(x+y)
memo.sort()
print(memo[-1]-memo[0])
|
p02556
|
s312568469
|
Wrong Answer
|
n = int(input())
points = []
for i in range(n):
a, b = map(int,input().split())
points.append(a + b)
ans = max(points) - min(points)
print(ans)
|
p02556
|
s635173126
|
Wrong Answer
|
n = int(input())
m = []
for _ in range(n):
l = list(map(int,input().split()))
m.append(l)
mx = float('-inf')
for i in range(n):
for j in range(i+1,n):
mx = max(mx,abs(m[i][0]+m[j][0])+abs(m[i][1]+m[i][1]))
print(mx)
|
p02556
|
s453951638
|
Wrong Answer
|
Row=int(input())
X=[]
Y=[]
for i in range(Row):
n,a=input().split()
X.append(int(n))
Y.append(int(a))
A=[]
B=[]
for i in range(len(X)):
A.append(X[i]-Y[i])
B.append(X[i]+Y[i])
maxmax1=0
maxmax2=0
minmin1=10**10
minmin2=10**12
for i in range(len(A)):
maxmax1=max(maxmax1,A[i])
minmin1=min(minmin1,A[i])
for i in range(len(B)):
maxmax2=max(maxmax2,B[i])
minmin2=min(minmin2,B[i])
print(max((maxmax1-minmin1),(maxmax2-minmin2)))
|
p02556
|
s581598844
|
Wrong Answer
|
pos = []
n = int(input())
for i in range(n):
pos.append(list(map(int,input().split())))
pos.sort()
print(abs(pos[0][0]-pos[n-1][0])+abs(pos[0][1]-pos[n-1][1]))
|
p02556
|
s645377450
|
Wrong Answer
|
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(map(int, input().split()))
n = ii()
l = []
for i in range(n):
l += [li()]
p, q, r, s = [0,0,1000000000,1000000000]
for x in l:
p = max(p, x[0] + x[1])
q = max(q, x[0] - x[1])
r = min(r, x[0] + x[1])
s = min(s, x[0] - x[1])
print(p,q,r,s)
print(max(abs(p-r), abs(q-s)))
|
p02556
|
s563451439
|
Wrong Answer
|
n = int (input())
xy = []
def dist(a, b):
return abs(a[0]-b[0]) + abs(a[1]-b[1])
for i in range(n):
x, y = map(int,input().split())
xy.append([x, y])
xy.sort(key = lambda x: x[0]+x[1])
print(dist(xy[0], xy[-1]))
|
p02556
|
s350926268
|
Wrong Answer
|
def dist(i, j):
return abs(i[0]-j[0])+ abs(i[1] - j[1])
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] = list(map(int, input().split()))
ans = 0
tmp = 0
ind1 = 0
ind2 = 0
for i in range(N):
for j in range(N):
if dist((x[ind1], y[ind1]), (x[j], y[j])) >tmp:
tmp = dist((x[ind1], y[ind1]), (x[j], y[j]))
ind2 = j
if ans == tmp:
break
else:
ans = tmp
ind1 = ind2
print(ans)
|
p02556
|
s679963912
|
Wrong Answer
|
from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:tuple(map(int,stdin.readline().split()))
n=int(input())
l=set(tuple([lnii() for i in range(n)]))
x_max=0
x_min=10**10
y_max=0
y_min=10**10
for x,y in l:
s=x-y
x_max=max(x_max,s)
x_min=min(x_min,s)
t=x+y
y_max=max(y_max,t)
y_min=min(y_min,t)
x_ans=x_max-x_min
y_ans=y_max-y_min
print(max(x_ans,y_ans))
|
p02556
|
s319571620
|
Wrong Answer
|
n = int(input())
point_sum = []
for i in range(n):
a,b = map(int, input().split())
point_sum.append(max(a+b,a-b,b-a))
print(max(point_sum) - min(point_sum))
|
p02556
|
s870370404
|
Wrong Answer
|
N = int(input())
x = [list(map(int, input().split())) for i in range(N)]
ma = x[0][0] * x[0][1] / 2
mai = 0
mii = 0
mi = x[0][0] * x[0][1] / 2
for i in range(1,N):
a = x[i][0] * x[i][1] / 2
if ma < a:
ma = a
mai = i
elif mi > a:
mi = a
mii = i
print(abs(x[mii][0]-x[mai][0])+abs(x[mii][1]-x[mai][1]))
|
p02556
|
s401715037
|
Wrong Answer
|
(n,),*e=[[*map(int,i.split())]for i in open(0)]
a=sorted(e)
b=sorted(e,key=lambda x: x[1])
c=a[:10]+a[:10]+b[10:]+b[:10]
ans=0
for i,j in c:
for ii,jj in c:
ans=max(ans,abs(i-ii)+abs(j-jj))
|
p02556
|
s645753436
|
Wrong Answer
|
def main():
N = int(input())
pts = []
m = 0
a1 = 0
a2 = 0
b1 = 0
b2 = 0
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(b1, y - x)
N = N - 1
print(max(a1 - a2, b1 - b2))
main()
|
p02556
|
s805526270
|
Wrong Answer
|
from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))
n=int(input())
z_max=0
z_min=10**10
w_max=0
w_min=10**10
for i in range(n):
x,y=nii()
z=x-y
z_max=max(z_max,z)
z_min=min(z_min,z)
w=x+y
w_max=max(w_max,w)
w_min=min(w_min,w)
ans=max(z_max-z_min,w_max-w_min)
print(ans)
|
p02556
|
s474999910
|
Wrong Answer
|
n=int(input())
data=[list(map(int,input().split())) for i in range(n)]
ans=0
i=0
for i in range(n-1):
j=i+1
while j<n:
m=abs(data[i][0]-data[j][0])+abs(data[i][0]-data[j][0])
ans=max(ans,m)
j+=1
print(ans)
|
p02556
|
s583919919
|
Wrong Answer
|
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N = int(input())
XY = []
for _ in range(N):
x, y = mapint()
XY.append((x, y))
sx, sy = XY[0]
tmp = -1
for nx, ny in XY[1:]:
if abs(sx-nx)+abs(sy-ny)>tmp:
tmp = abs(sx-nx)+abs(sy-ny)
ex, ey = nx, ny
ans = -1
for nx, ny in XY:
if abs(ex-nx)+abs(ey-ny)>ans:
ans = abs(ex-nx)+abs(ey-ny)
print(ans)
|
p02556
|
s195406525
|
Wrong Answer
|
n = int(input())
x = []
y = []
distance = []
for i in range(n):
x1, y1 = input().split()
x1 = int(x1)
y1 = int(y1)
x.append(x1)
y.append(y1)
for i in range(len(x)):
for j in range(i+1,len(x)):
temp = abs(x[i] - x[j]) + abs(y[i] - y[j])
distance.append(temp)
print(distance)
max = distance[0]
for i in range(1,len(distance)-1):
if distance[i] >= max:
max = distance[i]
print(max)
|
p02556
|
s123587569
|
Wrong Answer
|
N = int(input())
x = [] * N
y = [] * N
for i in range(N):
a, b = list(map(int, input().split()))
x.append(a)
y.append(b)
d = 0
ma = x[0] + y[0]
ima = 0
mi = x[0] + y[0]
imi = 0
for i in range(N):
if x[i] + y[i] < mi:
mi = x[i] + y[i]
imi = i
if x[i] + y[i] > ma:
ma = x[i] + y[i]
ima = i
print (ima, imi)
d = abs(x[ima] - x[imi]) + abs(y[ima] - y[imi])
print(d)
|
p02556
|
s991757178
|
Wrong Answer
|
N = int(input())
List = set([])
x,y = map(int,input().split())
for i in range(N-1):
x1,y1 = map(int,input().split())
List.add(abs(x-x1)+abs(y-y1))
x,y= x1,y1
print(max(List))
|
p02556
|
s927336774
|
Wrong Answer
|
n=int(input())
a= [list(map(int, input().split())) for i in range(n)]
a1=float('inf')
a2=0
a3=float('inf')
a4=0
for i in range(n):
cnt=a[i][0]+a[i][1]
cnt1=a[i][0]-a[i][1]
a1=min(a1,cnt)
a2=max(a2,cnt)
a3=min(cnt1,a3)
a4=max(cnt1,a4)
print(max(a2-a1,a4-a3))
|
p02556
|
s341829713
|
Wrong Answer
|
n = int(input())
n_list = []
# dist_max = 0
for i in range(n):
x, y = map(int, input().split())
n_list.append(x+y)
print(max(n_list) - min(n_list))
|
p02556
|
s322963150
|
Wrong Answer
|
arr = []; arr2 = []
for i in range(int(input())):
a, b = list(map(int, input().split(" ")))
arr.append([a, b])
arr2.append([b, a])
# print(arr)
m1, m2 = min(arr), max(arr)
n1, n2 = min(arr2), max(arr2)
print(max(abs(m1[0]-m2[0]) + abs(m1[1] - m2[1]), abs(n1[0]-n2[0]) + abs(n1[1] - n2[1])))
|
p02556
|
s950784535
|
Wrong Answer
|
N = int(input())
A = [map(int, input().split()) for _ in range(N)]
B = sorted([x+y for x,y in A])
print(B[-1] - B[0])
|
p02556
|
s704338196
|
Wrong Answer
|
N = int(input())
list_x = []
list_y = []
for i in range(N):
x, y = map(int, input().split())
list_x.append(x)
list_y.append(y)
ans = 0
for i in range(N):
for j in range(N):
if i == j:
continue
else:
tmp = abs(list_x[i] - list_x[j]) + abs(list_x[i] - list_y[j])
if tmp > ans:
ans = tmp
print(ans)
|
p02556
|
s728560040
|
Wrong Answer
|
from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))
n=int(input())
z_max=0
z_min=10**10
w_max=0
w_min=10**10
for i in range(n):
x,y=nii()
z=x+y
z_max=max(z_max,z)
z_min=min(z_min,z)
w=x-y
w_max=max(w_max,w)
w_min=min(w_min,w)
ans=max(z_max-z_min,w_max-w_min)
print(ans)
|
p02556
|
s294923679
|
Wrong Answer
|
N = int(input())
X = [list(map(int, input().split())) for _ in range(N)]
cand = []
X.sort(key=lambda x: x[0])
cand.append(abs(X[0][0] - X[-1][0]) + abs(X[0][1] - X[-1][1]))
X.sort(key=lambda x: x[1])
cand.append(abs(X[0][0] - X[-1][0]) + abs(X[0][1] - X[-1][1]))
print(max(cand))
|
p02556
|
s109380661
|
Wrong Answer
|
# coding: utf-8
n = int(input())
a=0
b=float('inf')
c=0
d=float('inf')
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)
print(max(abs(a-b),abs(c-d)))
|
p02556
|
s908561881
|
Wrong Answer
|
n = int(input())
mi, ma = 1000000000000, 0
for i in range(n):
x, y = map(int, input().split())
x, y = abs(x), abs(y)
mi = min(mi, x + y)
ma = max(ma, x + y)
print(ma - mi)
|
p02556
|
s883267969
|
Wrong Answer
|
def main():
point_count = int(input())
inf = 10 ** 9 * 2 + 1
max_sum, min_sum, max_diff, min_diff = 0, inf, 0, inf
for _ in range(point_count):
x, y = [int(x) for x in input().split()]
max_sum = max(x + y, max_sum)
min_sum = min(x + y, min_sum)
max_diff = max(x - y, max_diff)
min_diff = min(x - y, min_diff)
return max(max_sum - min_sum, max_diff - min_diff)
if __name__ == '__main__':
print(main())
|
p02556
|
s716296105
|
Wrong Answer
|
N=int(input())
P=[tuple(map(int,input().split())) for _ in [0]*N]
if N>=4:
P.sort(lambda x:x[0])
goodP=[P[0],P[-1]]
P.sort(lambda x:x[1])
goodP.append(P[0])
goodP.append(P[-1])
else:
goodP=P[:]
res=[]
for i in range(len(goodP)):
for j in range(len(goodP)):
if not i<j:
continue
res.append(abs(goodP[i][0]-goodP[j][0])+abs(goodP[i][1]-goodP[j][1]))
print(max(res))
|
p02556
|
s803505846
|
Wrong Answer
|
from collections import defaultdict
from collections import deque
from collections import Counter
import math
import itertools
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
n = readInt()
data = []
for i in range(n):
x,y = readInts()
data.append([x+y,x,y])
data.sort(key=lambda x:x[0])
print(abs(data[-1][1]-data[0][1])+abs(data[-1][2]-data[0][2]))
|
p02556
|
s232618007
|
Wrong Answer
|
n = int(input())
x = [None]*n
y = [None]*n
for i in range(n):
x[i],y[i] = map(int,input().split())
d_from0 = 0
p_far = 0
x_0 = x[0]
y_0 = y[0]
for i in range(n):
d = abs(x[i]-x_0)+abs(y[i]-y_0)
if d > d_from0:
d_from0 = d
p_far = i
x_p = x[p_far]
y_p = y[p_far]
ans = 0
for i in range(n):
d = abs(x[i]-x_p)+abs(y[i]-y_p)
if d > ans:
ans = d
print(ans)
|
p02556
|
s400605647
|
Wrong Answer
|
minn=10**18
maxx=-10**18
for _ in range(input()):
x,y=[int(i)+10**9 for i in raw_input().split()]
minn=min(minn,x+y)
maxx=max(maxx,x+y)
print maxx-minn
|
p02556
|
s640771921
|
Wrong Answer
|
n=int(input())
l=[]
for i in range(n):
x,y=map(int, input().split())
l.append(x+y)
print(max(l)-min(l))
|
p02556
|
s278451542
|
Wrong Answer
|
n = int(input())
x = []
y = []
for _ in range(n):
X,Y = map(int,input().split())
x.append(X)
y.append(Y)
res = 0
for p, q in [[1, 1], [1, -1], [-1, 1], [-1, -1]]:
smallest = p * x[0] + q * y[0] + 0
for i in range(n):
cur = p * x[i] + q * y[i] + i
res = max(res, cur - smallest)
smallest = min(smallest, cur)
print(res-1)
|
p02556
|
s776409045
|
Wrong Answer
|
n=int(input())
xy=[list(map(int,input().split()))for _ in range(n)]
xy1ma=0
xy1mi=10**10
xy2ma=0
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
|
s241771109
|
Wrong Answer
|
n = int(raw_input())
points = set([])
for _ in range(n):
p = map(int, raw_input().split())
points.add(tuple(p))
points = list(points)
def distance(p,q): return abs(p[0] - q[0]) + abs(p[1] - q[1])
def f(points):
r = 0
pss = []
for u in [-1,1]:
for v in [-1,1]:
pss.append(max(points, key = lambda x:(u*x[0],v*x[1])))
for p in pss:
for q in points: r = max(r, distance(p,q))
return r
print f(points)
|
p02556
|
s682915972
|
Wrong Answer
|
n = int(input())
xmax = 0
xmin = 10**10
ymax = 0
ymin = 10**10
for i in range(n):
x, y = map(int, input().split())
refx = x + y
refy = x - y
xmax = max(xmax, refx)
xmin = min(xmin, refx)
ymax = max(ymax, refy)
ymin = min(ymin, refy)
ans = max(xmax - xmin, ymax - ymin)
print(ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.