Submission #2712975


Source Code Expand

import math

N = int(input())
X,Y = [],[]
d,dx,dy = 0,0,0

for i in range(N):
  x,y = map(int, input().split())
  X.append(x)
  Y.append(y)
  
for j in range(N):
  for x,y in zip(X,Y):
    if X[j] < x:
      dx = (X[j] - x)**2
      dy = (Y[j] - y)**2
    if d < math.sqrt(dx + dy):
      d = math.sqrt(dx + dy)

print("{:.6f}\n".format(d))
print()

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User ak3
Language Python (3.4.3)
Score 100
Code Size 368 Byte
Status AC
Exec Time 27 ms
Memory 3188 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 26
Set Name Test Cases
All 00_max.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt
Case Name Status Exec Time Memory
00_max.txt AC 17 ms 3060 KB
00_sample_01.txt AC 17 ms 3064 KB
00_sample_02.txt AC 17 ms 3064 KB
00_sample_03.txt AC 17 ms 3064 KB
00_sample_04.txt AC 18 ms 3064 KB
00_sample_05.txt AC 17 ms 3064 KB
01_rnd_00.txt AC 25 ms 3064 KB
01_rnd_01.txt AC 25 ms 3064 KB
01_rnd_02.txt AC 24 ms 3064 KB
01_rnd_03.txt AC 24 ms 3060 KB
01_rnd_04.txt AC 24 ms 3060 KB
01_rnd_05.txt AC 25 ms 3060 KB
01_rnd_06.txt AC 25 ms 3064 KB
01_rnd_07.txt AC 25 ms 3060 KB
01_rnd_08.txt AC 25 ms 3060 KB
01_rnd_09.txt AC 25 ms 3060 KB
01_rnd_10.txt AC 24 ms 3064 KB
01_rnd_11.txt AC 25 ms 3064 KB
01_rnd_12.txt AC 24 ms 3064 KB
01_rnd_13.txt AC 25 ms 3060 KB
01_rnd_14.txt AC 27 ms 3188 KB
01_rnd_15.txt AC 25 ms 3060 KB
01_rnd_16.txt AC 25 ms 3064 KB
01_rnd_17.txt AC 25 ms 3064 KB
01_rnd_18.txt AC 24 ms 3064 KB
01_rnd_19.txt AC 25 ms 3064 KB