Submission #2792441

Source Code Expand

Copy
import math
N = int(raw_input())
xy = [map(int,raw_input().split()) for i in range(N)]
maxd = 0
for i in range(N-1):
  xi,yi = xy[i]
  for j in range(i+1,N):
    xj,yj = xy[j]
    d = math.hypot(xj-xi, yj-yi)
    maxd = max(maxd, d)
print maxd

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User naoya_t
Language Python2 (2.7.6)
Score 100
Code Size 255 Byte
Status
Exec Time 14 ms
Memory 2568 KB

Test Cases

Set Name Score / Max Score Test Cases
All 100 / 100 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 10 ms 2568 KB
00_sample_01.txt 10 ms 2568 KB
00_sample_02.txt 11 ms 2568 KB
00_sample_03.txt 10 ms 2568 KB
00_sample_04.txt 11 ms 2568 KB
00_sample_05.txt 10 ms 2568 KB
01_rnd_00.txt 14 ms 2568 KB
01_rnd_01.txt 14 ms 2568 KB
01_rnd_02.txt 13 ms 2568 KB
01_rnd_03.txt 13 ms 2568 KB
01_rnd_04.txt 13 ms 2568 KB
01_rnd_05.txt 13 ms 2568 KB
01_rnd_06.txt 13 ms 2568 KB
01_rnd_07.txt 13 ms 2568 KB
01_rnd_08.txt 13 ms 2568 KB
01_rnd_09.txt 13 ms 2568 KB
01_rnd_10.txt 13 ms 2568 KB
01_rnd_11.txt 13 ms 2568 KB
01_rnd_12.txt 13 ms 2568 KB
01_rnd_13.txt 13 ms 2568 KB
01_rnd_14.txt 13 ms 2568 KB
01_rnd_15.txt 13 ms 2568 KB
01_rnd_16.txt 13 ms 2568 KB
01_rnd_17.txt 13 ms 2568 KB
01_rnd_18.txt 13 ms 2568 KB
01_rnd_19.txt 13 ms 2568 KB