problem_id stringclasses 100 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 6 806 |
|---|---|---|---|
p02556 | s390376475 | Wrong Answer | n = int(input())
x = [0]*n
y = [0]*n
max = 0
s = 0
for i in range(n):
x[i],y[i] = map(int,input().split())
for j in range(n):
if max < abs(x[0] - x[j]) + abs(y[0] - y[j]):
max = abs(x[0] - x[j]) + abs(y[0] - y[j])
s = j
for k in range(n):
if max < abs(x[s] - x[k]) + abs(y[s] - y[k]):
max = abs(x[s] - x[k]) + abs(y[s] - y[k])
print(max) |
p02556 | s425775993 | Wrong Answer | N = int(input())
xy = []
xmin , xmax, ymin, ymax= 10 ** 9, 0, 10 ** 9, 0
for _ in range(N):
x, y = map(int, input().split())
if x + y <= xmin + ymin:
xmin = x
ymin = y
if x + y >= xmax + ymax:
xmax = x
ymax = y
print(xmax - xmin + ymax - ymin)
|
p02556 | s022033755 | Wrong Answer | n = int(input())
xy = [map(int, input().split()) for _ in range(n)]
x, y = [list(i) for i in zip(*xy)]
maxx = 0
result = [0]
for i in range(n):
if maxx < i:
for j in range(n):
result.append(abs(x[i] - x[j]) + abs(y[i] - y[j]))
maxx = x[i]
print(max(result)) |
p02556 | s989927646 | Wrong Answer | n=int(input())
a=[]
b=[]
for _ in range(n):
x,y=map(int,input().split())
a+=[abs(x-y)]
b+=[x+y]
a.sort()
b.sort()
print(max(a[-1]-a[0],b[-1]-b[0])) |
p02556 | s519577543 | Wrong Answer | n=int(input())
x=[]
for i in range(n):
x.append(list(map(int, input().split())))
a=2*(10**9)
b=0
for j in range(n):
if sum(x[j])<a:
a=sum(x[j])
c=j
if sum(x[j])>b:
b=sum(x[j])
d=j
if c==d:
print(0)
else:
print(abs(x[d][0]-x[c][0])+abs(x[d][1]-x[c][1])) |
p02556 | s758228463 | Wrong Answer | import numpy as np
N=int(input())
X=[]
for i in range(N):
array = list(map(int,input().split()))
X.append(array)
a = np.array(X).T
xmax=[]
xmin=[]
xmax=np.argmax(a,axis=1)
xmin=np.argmin(a,axis=1)
x1=X[xmax[0]]
y1=X[xmax[1]]
x0=X[xmin[0]]
y0=X[xmin[1]]
print(x1)
x=abs(x1[0]-x0[0])+abs(x1[1]-x0[1])
y=abs(y1[0]-y0[0])+abs(y1[1]-y0[1])
print(max(x,y))
|
p02556 | s152938342 | Wrong Answer | N = int(input())
xy = [list(map(int, input().split())) for _ in range(N)]
ans = 0
ur = sorted(xy, key=lambda x: x[0]+x[1])[-1]
ul = sorted(xy, key=lambda x: x[1]-x[0])[-1]
dr = sorted(xy, key=lambda x: x[0]-x[1])[-1]
dl = sorted(xy, key=lambda x: -x[0]-x[1])[-1]
ans = max(ans, abs(ur[0]-dl[0])+abs(ur[1]-dl[1]))
ans = max(ans, abs(ul[0]-dr[0])+abs(ul[1]-dr[0]))
print(ans) |
p02556 | s730745513 | Wrong Answer | N = int(input())
A = [list(map(int, input().split())) for _ in range(N)]
ans = []
B = sorted([x+y for x,y in A])
ans.append(B[-1] - B[0])
# min_y - max_x
ax = sorted(A, key=lambda a: a[0])[-1]
ay = sorted(A, key=lambda a: a[1])[0]
ans.append(abs(ax[0] - ay[0]) + abs(ax[1] - ay[1]))
print(max(ans))
|
p02556 | s667823504 | Wrong Answer | n=int(input())
l=[list(map(int,input().split())) for _ in range(n)]
l.sort()
t=l[-1][0]-l[0][0]+l[-1][1]-l[0][1]
l.sort(key=lambda x: (x[1],x[0]))
# print(l)
t=max(t,l[-1][0]-l[0][0]+l[-1][1]-l[0][1])
print(t)
|
p02556 | s382119136 | 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])
dist(xy[0], xy[-1])
ans = 0
l = int((n//2)**0.5)
for i in range(l):
for j in range(l+1):
ans = max(ans, dist(xy[i], xy[n-1-j]))
print(ans)
|
p02556 | s045168854 | Wrong Answer |
n = int(input())
points = []
min1, max1 = float('inf'), float('-inf')
min2, max2 = float('inf'), float('-inf')
for tp in range(n):
x, y = map(int, input().split())
max1 = max(max1, x+y)
min1 = min(min1, x+y)
max2 = max(max1, x-y)
min2 = max(min2, x-y)
ans = max(max1 - min1, max2 - min2)
print(ans)
|
p02556 | s836894778 | Wrong Answer | N=int(input())
XY=[list(map(int,input().split())) for i in range(N)]
x0,y0=XY[0]
d=0
p,q=XY[0]
for x,y in XY:
if abs(x-x0)+abs(y-y0)>d:
p,q=x,y
d=abs(x-x0)+abs(y-y0)
d=0
for x,y in XY:
if abs(x-p)+abs(y-q)>d:
d=abs(x-p)+abs(y-q)
print(d) |
p02556 | s337042986 | Wrong Answer | n = int(input())
arr = []
for _ in range(n):
x,y = map(int,input().split(' '))
arr.append([x,y])
arr.sort(key = lambda x:x[0])
ans1 = abs(arr[0][0]-arr[-1][0]) + abs(arr[0][1] - arr[-1][1])
arr.sort(key = lambda x:x[1])
ans2 = abs(arr[0][0]-arr[-1][0]) + abs(arr[0][1] - arr[-1][1])
print(max(ans1,ans2)) |
p02556 | s898786579 | Wrong Answer | INF=10**6
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 | s686942523 | Wrong Answer | n=int(input())
max_d=(1,1)
min_d=(10**9,10**9)
for _ in range(n):
x,y=map(int,input().split())
d=(x,y)
if sum(max_d)<sum(d):
max_d=d
if sum(min_d)>sum(d):
min_d=d
print(sum(max_d)-sum(min_d)) |
p02556 | s002854534 | Wrong Answer | N = int(input())
table = [[int(i) for i in input().split()] for N in range(N)]
a = 0
b = 10**9 * 2
c = 0
d = 10**9 * 2
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 | s329227854 | Wrong Answer | n = int(input())
xsum = []
for i in range(n):
a, b = map(int, input().split())
xsum.append(a+b)
result = abs(min(xsum)-max(xsum))
print(result) |
p02556 | s134663080 | Wrong Answer | n = int(input())
xy = [[int(i) for i in input().split()] for j in range(n)]
a = xy[0][0]
b = xy[0][1]
m_len = -1
for i in range(n-1):
tmp = abs(xy[i+1][0]-a)+abs(xy[i+1][1]-b)
if m_len < tmp:
m_len = tmp
idx = i
a = xy[i][0]
b = xy[i][1]
for i in range(n):
if i == idx:
continue
tmp = abs(xy[i][0]-a)+abs(xy[i][1]-b)
if m_len < tmp:
m_len = tmp
print(m_len) |
p02556 | s627936629 | Wrong Answer | n = int(input())
lst, result = [], []
for _ in range(n):
x, y = map(int, input().split())
lst.append([x, y])
for i in range(n - 1):
a = lst[i][0] - lst[i + 1][0]
b = lst[i][1] - lst[i + 1][1]
result.append(abs(a) + abs(b))
print(max(result)) |
p02556 | s246062937 | Wrong Answer | N = int(input())
i = 0
x = [0]
y = [0]
for i in range(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 | s398306439 | Wrong Answer | n = int(input())
xy = [map(int, input().split()) for _ in range(n)]
x, y = [list(i) for i in zip(*xy)]
maxx = 0
result = [0]
for i in range(n):
if maxx < i:
for j in range(n - 1):
result.append(abs(x[i] - x[j]) + abs(y[i] - y[j]))
maxx = x[i]
print(max(result)) |
p02556 | s819021290 | Wrong Answer | N = int(input())
ma = 0
mi = 10**18
for i in range(N):
x,y = map(int,input().split())
ma=max(ma,x+y)
mi=min(mi,x+y)
print(ma-mi) |
p02556 | s573238062 | Wrong Answer | N=int(input())
xy=[map(int,input().split()) for i in range(0,N-1)]
x,y=[list(j) for j in zip(*xy)]
m=0
for k in range(0,len(x)-1):
for l in range(k,len(y)):
if abs(x[k]-x[l])+abs(y[k]-y[l])>m:
m=abs(x[k]-x[l])+abs(y[k]-y[l])
print(m)
|
p02556 | s463388442 | 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)
if math.fabs(x-y)>b:
m=b
b=max(math.fabs(x-y),b)
print(int(max(c-v, b+m))) |
p02556 | s744622245 | 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,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 | s411672929 | Wrong Answer | n = int(input())
x = [0 for _ in range(n)]
for i in range(n):
x[i] = list(map(int, input().split()))
x.sort(key = lambda s:s[0])
ans = 0
for i in x:
ans = max(ans, abs(x[0][0] - i[0]) + abs(x[0][1] - i[1]))
x.sort(key = lambda w:w[1])
for i in x:
ans = max(ans, abs(x[0][0] - i[0]) + abs(x[0][1] - i[1]))
print(ans) |
p02556 | s292432526 | Wrong Answer | N = int(input())
x_plus_y = set()
x_minus_y = set()
for _ in range(N):
x, y = map(int, input().split())
x_plus_y.add(x+y)
x_minus_y.add(x+y)
print(max([abs(max(x_plus_y)-min(x_plus_y)), abs(max(x_minus_y)-min(x_minus_y))]))
|
p02556 | s801485183 | Wrong Answer | N = int(input())
XY = [list(map(int, input().split())) for _ in range(N)]
min_diff = 10**9
max_diff = 0
min_sum = 2 * 10**9
max_sum = 2
for x,y in XY:
min_diff = min(abs(x-y), min_diff)
max_diff = max(abs(x-y), max_diff)
min_sum = min(x+y, min_sum)
max_sum = max(x+y, max_sum)
print(max(max_sum-min_sum, max_diff-min_diff)) |
p02556 | s010283802 | Wrong Answer | N = int(input())
p = [list(map(int, input().split())) for _ in range(N)]
a = []
for i, pos in enumerate(p):
a.append((sum(pos), i))
a.sort(key=lambda x:x[0])
xi, yi = p[a[0][1]]
xj, yj = p[a[-1][1]]
print(abs(xi - xj) + abs(yi - yj))
|
p02556 | s007655231 | Wrong Answer | N = int(input())
xy = []
x1 = 0
y1 = 0
for _ in range(N):
x, y = map(int, input().split())
xy.append([x, y])
if abs(x) + abs(y) > abs(x1) + abs(y1):
x1 = x
y1 = y
ans = 0
for x, y in xy:
ans = max(ans, abs(x1 - x) + abs(y1 - y))
print(ans)
|
p02556 | s192066439 | Wrong Answer | from collections import defaultdict
dic = defaultdict(list)
N = int(input())
l = []
z = []
for _ in range(N):
x, y = map(int, input().split())
l.append([x, y])
z.append(x+y)
z.sort()
temp = z[-1]-z[0]
for t in l:
a = t[0]+t[1]
dic[a].append(t)
for u in dic:
dic[u].sort()
b = dic[u][-1][0]-dic[u][0][0]
ans = max(2*b, temp)
print(ans) |
p02556 | s614538178 | Wrong Answer | 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)
print(abs(max(max(a),max(b)))-abs(min(min(a),min(b)))) |
p02556 | s024949357 | Wrong Answer |
N = int(input())
x = []
y = []
for i in range(N):
in1, in2 = list(map(int,input().split()))
x.append(in1)
y.append(in2)
#f = [[0]*2 for i in range(N)]
X=[]
Y=[]
for i in range(N):
#f[i][0] = x[i]-x[i]
#f[i][1] = x[i]+y[i]
X.append(x[i]-x[i])
Y.append(x[i]+y[i])
dam1 = max(X) - min(X)
dam2 = max(Y) - min(Y)
print(max(dam1,dam2)) |
p02556 | s054916729 | 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 | s097877026 | Wrong Answer | N=int(input())
kouho=[0]*4#xmax,ymax,xmin,ymin
kouho[2]=10**9+1
kouho[3]=10**9+1
ans=0
for i in range(N):
x,y=map(int,input().split())
newx=x-y
newy=x+y
if newx>kouho[0]:
kouho[0]=newx
if newx<kouho[2]:
kouho[2]=newx
if newy>kouho[1]:
kouho[1]=newy
if newy<kouho[3]:
kouho[3]=newy
ans=max(kouho[0]-kouho[2],kouho[1]-kouho[3])
print(ans) |
p02556 | s898005856 | Wrong Answer | N = int(input())
p = []
for _ in range(N):
x, y = map(int, input().split())
p.append((x, y))
p = sorted(p, key=lambda i: i[0] + i[1])
x1, y1 = p[0]
x2, y2 = p[-1]
if (x1 <= x2 and y1 <= y2) or (x1 >= x2 and y1 >= y2):
print(abs((x1 + y1) - (x2 + y2)))
else:
print(abs((x1 - y1) - (x2 + y2)))
|
p02556 | s747505495 | Wrong Answer | import math
n = int(input())
x = list(range(n))
y = list(range(n))
m = list(range(n))
for i in range(n):
x[i],y[i] = map(int,input().split())
m[i] = x[i] + y[i]
m.sort()
res = abs(m[0]-m[n-1])
print(res) |
p02556 | s195412369 | Wrong Answer | from itertools import combinations
N = int(input())
p = []
for _ in range(N):
x, y = map(int, input().split())
p.append((x, y))
px = sorted(p, key=lambda i: i[0] + i[1])
py = sorted(p, key=lambda i: abs(i[0] - i[1]))
print(max(abs(sum(px[0]) - sum(px[-1])), abs(sum(py[0]) - sum(py[-1])))) |
p02556 | s952918345 | Wrong Answer | import numpy as np
N=int(input())
X=[]
for i in range(N):
array = list(map(int,input().split()))
X.append(array)
a = np.array(X).T
xmax=[]
xmin=[]
xmax=np.argmax(a,axis=1)
xmin=np.argmin(a,axis=1)
x1=X[xmax[0]]
y1=X[xmax[1]]
x0=X[xmin[0]]
y0=X[xmin[1]]
x=abs(x1[0]-x0[0])+abs(x1[1]-x0[1])
y=abs(y1[0]-y0[0])+abs(y1[1]-y0[1])
print(max(x,y))
|
p02556 | s498722276 | Wrong Answer | n=int(input())
s,p=10**10,10**10
t,q=0,0
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 | s118197787 | Wrong Answer | N = int(input())
xy = []
for _ in range(N):
x, y = map(int, input().split())
xy.append([x, y])
xy1 = sorted(xy, key=lambda x: x[0])
xy2 = sorted(xy, key=lambda x: x[1])
# print(xy1)
# print(xy2)
dist1 = abs(xy1[0][0] - xy1[-1][0]) + abs(xy1[0][1] - xy1[-1][1])
dist2 = abs(xy2[0][0] - xy2[-1][0]) + abs(xy2[0][1] - xy2[-1][1])
ans = max(dist1, dist2)
print(ans)
|
p02556 | s112409183 | Wrong Answer | import random
N = int(input())
x = [0]*N
y = [0]*N
for i in range(N):
x[i], y[i] = map(int, input().split())
S = set()
for i in range(N):
S.add((x[i], y[i]))
S = list(S)
ans = 0
for i in range(6):
o = random.randint(0, len(S)-1)
m = 0
mp = 0
for i in range(N):
d = abs(x[i]-S[o][0])+abs(y[i]-S[o][1])
if d>m:
m = d
mp = i
for i in range(N):
ans = max(ans, abs(x[i]-x[mp])+abs(y[i]-y[mp]))
print(ans)
|
p02556 | s848456519 | Wrong Answer | N = int(input())
x, y = [0]*N, [0]*N
for i in range(N):
a, b = map(int, input().split())
x[i] = a
y[i] = b
maxZ, minZ, maxW, minW = -1, float("inf"), -1, float("inf")
for i in range(N):
z = x[i] + y[i]
w = x[i] - y[i]
maxZ = max(maxZ, z)
minZ = min(minZ, z)
maxW = max(maxW, w)
minW = min(minW, w)
ans = max(maxZ-minZ, maxW-minW)
print(ans)
|
p02556 | s562441273 | Wrong Answer | n=int(input())
a= [list(map(int, input().split())) for i in range(n)]
a1=float('inf')
a2=0
for i in range(n):
cnt=a[i][0]+a[i][1]
a1=min(a1,cnt)
a2=max(a2,cnt)
print(a2-a1) |
p02556 | s686416762 | 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
d = abs(x[ima] - x[imi]) + abs(y[ima] - y[imi])
print(d) |
p02556 | s469162325 | Wrong Answer | n = int(input())
x = [0 for _ in range(n)]
for i in range(n):
x[i] = list(map(int, input().split()))
for i in x:
i.append(abs(x[0][0]-i[0]) + abs(x[0][1]-i[1]))
x.sort(key = lambda s:s[2])
ans = 0
for j in range(n):
ans = max(ans, abs(x[-1][0] - x[j][0]) + abs(x[-1][1] - x[j][1]))
print(ans) |
p02556 | s896665041 | Wrong Answer | N = int(input())
xy = [list(map(int, input().split())) for _ in range(N)]
dist = [None] * N
for i in range(N):
dist[i] = abs(xy[i][0] - xy[0][0]) + abs(xy[i][1] - xy[0][1])
for j in range(100):
s = dist.index(max(dist))
for i in range(N):
dist[i] = abs(xy[i][0] - xy[s][0]) + abs(xy[i][1] - xy[s][1])
print(max(dist)) |
p02556 | s850453413 | Wrong Answer | n = int(input())
max_t = -float('inf')
min_t = float('inf')
dic_p_x = {}
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
if c not in dic_p_x:
dic_p_x[c] = []
dic_p_x[c].append(x)
max_d = max_t - min_t
for lst in dic_p_x.values():
a, b = max(lst), min(lst)
dis = 2 * (a - b)
max_d = max(max_d, dis)
print(max_d)
|
p02556 | s601785405 | Wrong Answer | N=int(input())
minab=10**11
maxab=0
mina=10**11
minb=10**11
maxa=0
maxb=0
for i in range(N):
a,b=map(int,input().split())
if a+b>maxab:
maxab=a+b
maxa=a
maxb=b
if a+b<minab:
minab=a+b
mina=a
minb=b
print(abs(maxa-mina)+abs(maxb-minb))
|
p02556 | s728288050 | Wrong Answer | N=int(input())
t=10**9
k=0
for i in range(N):
a,b=map(int,input().split())
t=min(t,a+b)
k=max(k,a+b)
print(k-t) |
p02556 | s388529207 | Wrong Answer | from copy import copy
N = int(input())
XY = [list(map(int,input().split())) for _ in range(N)]
for i in range(N):
x, y = copy(XY[i][0]), copy(XY[i][1])
XY[i][0] = x-y
XY[i][1] = x+y
ans = 0
for i in range(2):
tmp_1 = 0
tmp_2 = float("inf")
for j in range(N):
tmp_1 = max(tmp_1, XY[j][i])
tmp_2 = min(tmp_2, XY[j][i])
ans = max(ans, tmp_1-tmp_2)
print(ans) |
p02556 | s310770322 | Wrong Answer | N = int(input())
p = set()
for _ in range(N):
x, y = map(int, input().split())
if (x, y) not in p:
p.add((x, y))
p = [x + y for x, y in p]
p.sort()
print(abs(p[0] - p[-1])) |
p02556 | s773312824 | Wrong Answer | n=int(input())
x=[0]*n
y=[0]*n
z=[0]*n
a=-1
b=-1
for i in range(n):
x[i],y[i] = list(map(int, input().strip().split()))
for i in range(n):
z[i]=x[i]**2+y[i]**2
s=max(z)
t=min(z)
for i in range(n):
if z[i]==s:
a=i
if z[i]==t:
b=i
print(abs(x[a]-x[b])+abs(y[a]-y[b]))
|
p02556 | s266852837 | Wrong Answer | N = int(input())
XY_max = -10**10
XY_min = 10**10
YX_max = -10**10
YX_min = 10**10
for _ in range(N):
x,y = map(int, input().split())
XY_max = max(XY_max,x+y)
XY_min = min(XY_min,x+y)
YX_max = max(YX_max,x-y)
YX_min = max(XY_max,x-y)
print(max(XY_max-XY_min,YX_max-YX_min)) |
p02556 | s068525492 | Wrong Answer | N = int(input())
ma = -float("inf")
mi = float("inf")
for i in range(N):
x,y = list(map(int,input().split()))
ma = max(ma,x+y)
mi = min(mi,x+y)
print(ma-mi) |
p02556 | s453444177 | Wrong Answer | N = int(input())
table = [[int(i) for i in input().split()] for N in range(N)]
a = 0
b = 10**9 * 2
c = 0
d = 10**9 * 2
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 < abs(p-q):
c = abs(p-q)
if d > abs(p-q):
d = abs(p-q)
print(max(a-b,c-d))
|
p02556 | s543081523 | Wrong Answer | import numpy as np
n = int(input())
x = []
y = []
for i in range(n):
l = list(map(int, input().split()))
x.append(l[0])
y.append(l[1])
x = np.array(x)
y = np.array(y)
xy0 = x + y
xy1 = x - y
print(int(max(max(xy0)-min(xy1),max(xy1)-min(xy0))/2)) |
p02556 | s294964669 | Wrong Answer | n = int(input())
# 各点のy=xへの写像を考える
x = []
y = []
t = []
for i in range(n):
xi, yi = map(int, input().split())
x.append(xi)
y.append(yi)
t.append([xi+yi, i])
t.sort(key=lambda x:x[0])
#print(t)
min_idx = t[0][1]
max_idx = t[-1][1]
ans = abs(x[max_idx]-x[min_idx]) + abs(y[max_idx]-y[min_idx])
print(ans) |
p02556 | s646861814 | Wrong Answer | N = int(input())
XY = [list(map(int, input().split())) for _ in range(N)]
min_diff = 10**9
max_diff = 1
min_sum = 2 * 10**9
max_sum = 2
for x,y in XY:
min_diff = min(x-y, min_diff)
max_diff = max(x-y, max_diff)
min_sum = min(x+y, min_sum)
max_sum = max(x+y, max_sum)
print(max(max_sum-min_sum, max_diff-min_diff)) |
p02556 | s167614927 | Wrong Answer | import numpy as np
from scipy.spatial import distance
def main():
n = int(input())
try:
lis = []
for i in range(n):
x,y = map(int, input().split())
lis.append([x,y])
M = np.array(lis)
dist_M = distance.cdist(M, M, metric='cityblock')
print(int(np.max(dist_M)))
except:
print(0)
if __name__ == '__main__':
main() |
p02556 | s182326091 | 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(max-min) |
p02556 | s819575790 | Wrong Answer | n = int(input())
# 各点のy=xへの写像を考える
x = []
y = []
t = []
for i in range(n):
xi, yi = map(int, input().split())
x.append(xi)
y.append(yi)
t.append([xi+yi, i])
t.sort(key=lambda x:x[0])
print(t)
min_idx = t[0][1]
max_idx = t[-1][1]
ans = abs(x[max_idx]-x[min_idx]) + abs(y[max_idx]-y[min_idx])
print(ans) |
p02556 | s232297976 | Wrong Answer | N = int(input())
l = [tuple(map(int, input().split())) for i in range(N)]
d=set()
for i, j in zip(list(range(N)),list(range(1,N))):
d.add(abs(l[i][0]-l[j][0]) + abs(l[i][1]-l[j][1]))
print(max(d)) |
p02556 | s034440107 | Wrong Answer | from sys import *
N = int(stdin.readline())
a = []
for i in range(N):
tmp = list(map(int, stdin.readline().split()))
a.append(tmp)
a.sort(key = lambda k: k[0]+k[1])
best = 0
for i in range(N-1):
best = max(best, abs(a[i][0] - a[-1][0]) + abs(a[i][1] - a[-1][1]))
print(best)
|
p02556 | s406787252 | Wrong Answer | n = int(input())
xy = [map(int, input().split()) for _ in range(n)]
x, y = [list(i) for i in zip(*xy)]
maxx = -10 ** 10
result = [0]
for i in range(n):
if maxx <= x[i]:
for j in range(n):
result.append(abs(x[i] - x[j]) + abs(y[i] - y[j]))
maxx = x[i]
print(max(result)) |
p02556 | s224001056 | Wrong Answer | n = int(input())
x,y = list(map(int,input().split()))
c = 0
for i in range(n-1):
a,b = list(map(int,input().split()))
c = max(abs(x-a)+abs(y-b),c)
x,y = a,b
print(c) |
p02556 | s153177191 | Wrong Answer | #!/usr/bin/env python3
def main():
n = int(input())
xy = [list(map(int, input().split())) for i in range(n)]
max_z, max_w, min_z, min_w = 0, 0, 10**10, 10**10
ans = 0
for p in xy:
max_z, max_w = max(max_z, p[0] + p[1]), max(max_w, p[0] - p[1])
min_z, min_w = min(min_z, p[0] + p[1]), min(min_w, p[0] - p[1])
ans = max(max_z - min_z, max_w - min_w)
print(ans)
if __name__ == "__main__":
main()
|
p02556 | s452691726 | Wrong Answer | n = int(input())
x_y = [[] for i in range(n)]
for i in range(n):
x_y[i] = list(map(int, input().split()))
x_ = sorted(x_y, key=lambda x: x[0])
#print(x_)
ans = 0
for l in range(n):
for r in range(n-1,l,-1):
# print(l,r)
kyori = (x_[r][0] - x_[l][0]) * (x_[r][1] - x_[l][1])
if kyori < 0:
kyori = -kyori
if kyori > ans:
ans = kyori
print(ans) |
p02556 | s320178898 | Wrong Answer | n=int(input())
r=[list(map(int,input().split())) for _ in range(n)]
a,c,b,d=0,10**10,0,10**10
for i in range(n):
x,y=r[i]
a=max(a,x+y)
c=min(c,x+y)
b=max(b,x-y)
d=min(d,x-y)
d=max(0,d)
print(abs(max(a-c,b-d))) |
p02556 | s780978303 | Wrong Answer | n=int(input())
def distant(d1,d2):
return abs(d1[0]-d2[0])+abs(d1[1]-d2[1])
d0=tuple(map(int,input().split()))
d1=tuple(map(int,input().split()))
dist=distant(d0,d1)
for i in range(n-2):
d=list(map(int,input().split()))
tmp=distant(d0,d)
if tmp>dist:
d0=d
dist=tmp
tmp=distant(d1,d)
if tmp>dist:
d1=d
dist=tmp
print(dist) |
p02556 | s090412180 | Wrong Answer | n=int(input())
m=0
t1,t2=map(int,input().split())
for i in range(n-1):
x,y=map(int,input().split())
xn=(x-t1)
yn=(y-t2)
if xn<0:
xn=-xn
if yn<0:
yn=-yn
l=xn+yn
if l>=m:
m=l
t1=x
t2=y
print(m) |
p02556 | s119187365 | Wrong Answer | def main():
n = int(input())
xy = [list(map(int, input().split())) for _ in [0]*n]
z = [max(x+y, x-y) for x, y in xy]
print(max(z)-min(z))
main()
|
p02556 | s568219601 | Wrong Answer | import bisect
n = int(input())
xy = [tuple(map(int, input().split())) for i in range(n)]
xy.sort()
a = xy[0]
xy.sort(key=lambda x: -x[0])
b = xy[0]
xy.sort(key=lambda x: x[1])
c = xy[0]
xy.sort(key=lambda x: -x[1])
d = xy[0]
def man(a:tuple, b:tuple):
return abs(a[0]-b[0])+abs(a[1]-b[1])
ans = 0
ans = max(ans, man(a, b))
ans = max(ans, man(a, c))
ans = max(ans, man(a, d))
ans = max(ans, man(b, c))
ans = max(ans, man(b, d))
ans = max(ans, man(d, d))
print(ans) |
p02556 | s336599450 | Wrong Answer | n=int(input())
l=[list(map(int,input().split())) for i in range(n)]
import math
ll=[]
for i in range(n):
ll.append([l[i][0]+l[i][1],i])
ll.sort()
print(int(math.fabs(l[ll[0][1]][0]-l[ll[-1][1]][0])+math.fabs(l[ll[0][1]][1]-l[ll[-1][1]][1])))
|
p02556 | s637921883 | 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,abs(x-y))
mi = min(mi,abs(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)
print(ans) |
p02556 | s641885661 | Wrong Answer | N=int(input())
t=10**9*2
k=0
for i in range(N):
a,b=map(int,input().split())
t=min(t,a+b)
k=max(k,a+b)
print(k-t) |
p02556 | s811761840 | Wrong Answer | charo={}
for i in range(int(input())):
x,y=list(map(int,input().split()))
sum1=x+y
charo[sum1]=[x,y]
min1=min(charo)
max1=max(charo)
a=charo[min1]
b=charo[max1]
print(abs(a[0]-b[0])+abs(a[1]-b[1]))
|
p02556 | s975856261 | Wrong Answer | n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
f0 = sorted([x+y for x, y in xy])
f1 = sorted([x-y for x, y in xy])
print(max(f0[-1]+f1[0], f0[0]+f1[-1])) |
p02556 | s699943732 | Wrong Answer | import numpy as np
from scipy.special import comb
n = int(input())
p = [list(map(int,input().split())) for _ in range(n)]
p = np.array(p)
ans = 0
for _ in range(n):
ans = max(ans,max((np.sum(p-p[0],axis=1))))
p = np.delete(p,0,0)
print(ans) |
p02556 | s122258997 | Wrong Answer | N = int(input())
min_dist_o = 10**10
max_dist_o = 0
min_dist_edge = 10**10
max_dist_edge = 0
for i in range(N):
x,y = map(int,input().split())
dist_o = x+y
dist_edge = 10**9+1-x+y
if dist_o > max_dist_o:
max_dist_o=dist_o
if dist_o < min_dist_o:
min_dist_o=dist_o
if dist_edge > max_dist_edge:
max_dist_edge=dist_edge
if dist_o < min_dist_o:
min_dist_edge=dist_edge
print(max(max_dist_o-min_dist_o,max_dist_edge-min_dist_edge)) |
p02556 | s069189826 | 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(abs(x + y))
count4.append(abs(x - y))
z = min(count3)
zz = min(count4)
print(max(count-z, count2-zz))
|
p02556 | s819168862 | Wrong Answer | N=int(input())
minz=10**11
minw=10**11
maxz=0
maxw=0
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 | s171420939 | Wrong Answer | n = int(input())
xy = list(list(map(int,input().split())) for _ in range(n))
l = []
for i in range(n):
l.append(abs(xy[i][0])+abs(xy[i][1]))
d = abs(xy[l.index(max(l))][0]-xy[l.index(min(l))][0])+abs(xy[l.index(max(l))][1]-xy[l.index(min(l))][1])
print(d) |
p02556 | s128899429 | Wrong Answer | n=int(input())
zmax=0
zmin=float("inf")
wmax=0
wmin=float("inf")
for i in range(n):
a,b=map(int,input().split())
zmax=max(zmax,a+b)
zmin=min(zmin,a+b)
wmax=max(wmax,a-b)
wmin=min(wmin,a-b)
print(max(zmax-zmin,wmax-wmin)) |
p02556 | s919485248 | Wrong Answer | from collections import deque
N = int(input())
AM, Am, BM, Bm = 0, 10**18, 0, 10**18
for _ in range(N):
x, y = map(int, input().split())
AM = max(AM, x+y)
Am = min(Am, x+y)
BM = max(BM, x-y)
Bm = min(Bm, x-y)
print(max(AM-Am, BM-Bm)) |
p02556 | s630898893 | 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,abs(x-y))
mi = min(mi,abs(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)
print(ans) |
p02556 | s962112261 | Wrong Answer | n = int(input())
matrix = []
for i in range(n):
a=[]
for j in range(1):
k = input()
a= [int(i) for i in k.split()]
matrix.append(a)
mu = []
for i in range(n):
for j in range (n):
sum = abs(matrix[i][0]-matrix[j][0])+ abs(matrix[i][1]-matrix[j][0])
mu.append(sum)
mu.sort()
print(mu[-1])
|
p02556 | s879624384 | Wrong Answer | n = int(input())
mm = 10**12
mx = 0
for _ in range(n):
x, y = map(int, input().split())
mm = min(mm, x+y)
mx = max(mx, x+y)
print(mx-mm) |
p02556 | s051178971 | Wrong Answer | import numpy as np
N=int(input())
s_max,s_min=0,float('inf')
t_max,t_min=0,float('inf')
for i in range(N):
a,b=map(int,input().split())
s,t=a+b,a-b
s_max,s_min=max(s_max,s),min(s_min,s)
t_max,t_min=max(t_max,t),min(t_min,t)
print(max(s_max-s_min,t_max-t_min)) |
p02556 | s033751135 | Wrong Answer | N = int(input())
XYs = [list(map(int, input().split())) for _ in range(N)]
XYs.sort()
prevX = None
minY = maxY = XYs[0][1]
ans = 0
for x, y in XYs:
if prevX != x and prevX is not None:
minY -= 1
maxY += 1
ans = max(ans, abs(minY-y), abs(maxY-y))
minY = minY if minY < y else y
maxY = maxY if maxY > y else y
prevX = x
print(ans)
|
p02556 | s808481005 | Wrong Answer | N=int(input())
XY=[]
for i in range(N):
x,y=input().split()
XY.append((int(x),int(y)))
Md=[]
for s in range(N):
for t in range(N):
d=abs(XY[s][0])-abs(XY[t][0])+abs(XY[s][1])-abs(XY[t][1])
Md.append(d)
print(max(Md)) |
p02556 | s888170402 | Wrong Answer | n = int(input())
x = [list(map(int,input().split())) for i in range(n)]
c = 0
d = 0
y = sorted(x)
z = []
for i in range(n):
z.append([x[i][1],x[i][0]])
a = sorted(z)
for i in range(n-1):
c = max(abs(y[i][0]-y[i+1][0])+abs(y[i][1]-y[i+1][1]),c)
d = max(abs(a[i][0]-a[i+1][0])+abs(a[i][1]-a[i+1][1]),c)
print(max(c,d)) |
p02556 | s011040683 | Wrong Answer | n=int(input())
xy=[list(map(int,input().split()))for _ in range(n)]
xy1ma=0
xy1mi=10**9
xy2ma=0
xy2mi=10**9
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 | s242026058 | Wrong Answer | N = int(input())
i = []
j = []
for k in range(N):
x, y = map(int, input().split())
i.append(x+y)
j.append(-x-y)
print(max(max(i)+max(j), abs(min(i)+min(j))))
|
p02556 | s621618642 | Wrong Answer | #!/usr/bin/env python3
def maximize(ps):
zs = sorted(x + y for x, y in ps)
return abs(zs[0] - zs[-1])
def main():
n = int(input())
ps = []
for _ in range(n):
ps.append(tuple(int(z) for z in input().split()))
res = maximize(ps)
print(res)
if __name__ == '__main__':
main() |
p02556 | s219887996 | Wrong Answer | N = int(input())
xy = [list(map(int, input().split())) for _ in range(N)]
xy.sort()
dist = [None] * N
for i in range(N):
dist[i] = abs(xy[i][0] - xy[0][0]) + abs(xy[i][1] - xy[0][1])
s = dist.index(max(dist))
dist2 = [None] * N
for i in range(N):
dist2[i] = abs(xy[i][0] - xy[s][0]) + abs(xy[i][1] - xy[s][1])
print(max(dist2)) |
p02556 | s041057613 | Wrong Answer | n = int(input())
table = []
maxl,minl = [],[]
for _ in range(n):
x,y = map(int,input().split())
table.append([x,y])
xmax,xmin = max(table)[0],min(table)[0]
ymax,ymin = max(table,key=lambda x:x[1])[1],min(table,key=lambda x:x[1])[1]
for x,y in table:
if x==xmax or y==ymax:
maxl.append([x,y])
if x==xmin or y==ymin:
minl.append([x,y])
ans = 0
for x,y in maxl:
for k,l in minl:
ans = max(abs(x-k)+abs(y-k),ans)
print(ans) |
p02556 | s598522494 | Wrong Answer | def main():
n = int(input())
candidates = []
for _ in range(n):
x,y = tuple(map(int,input().split()))
candidates.append(x+y)
print(max(candidates)-min(candidates))
if __name__ == "__main__":
main() |
p02556 | s847020388 | Wrong Answer | N = int(input())
L = [list(map(int, input().split())) for _ in range(N)]
L.sort(key = lambda x: abs(x[0] + x[1]), reverse = True)
base_x = L[0][0]
base_y = L[0][1]
ans = 0
for l in L:
ans = max(ans, abs(l[0] - base_x) + abs(l[1] - base_y))
print(ans) |
p02556 | s416440141 | Wrong Answer | n = int(input())
x = [0]*n
y = [0]*n
max = 0
s = 0
for i in range(n):
x[i],y[i] = map(int,input().split())
for j in range(n):
if max < abs(x[0] - x[j]) + abs(y[0] - y[j]):
max = abs(x[0] - x[j]) + abs(y[0] - y[j])
s = j
for k in range(n):
if max < abs(x[s] - x[j]) + abs(y[s] - y[j]):
max = abs(x[s] - x[j]) + abs(y[s] - y[j])
print(max) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.