Submission #457815


Source Code Expand

Copy
import math
n = input()
pos = [map(int, raw_input().split()) for i in xrange(n)]
ans = 0.0
for i in xrange(n):
    for j in xrange(i+1, n):
        ans = max(ans, (pos[i][0]-pos[j][0])**2 + (pos[i][1]-pos[j][1])**2)
print math.sqrt(ans)

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User yaketake08
Language Python (2.7.3)
Score 100
Code Size 245 Byte
Status
Exec Time 64 ms
Memory 3328 KB

Judge Result

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 57 ms 3268 KB
00_sample_01.txt 61 ms 3260 KB
00_sample_02.txt 57 ms 3252 KB
00_sample_03.txt 59 ms 3256 KB
00_sample_04.txt 57 ms 3264 KB
00_sample_05.txt 57 ms 3248 KB
01_rnd_00.txt 62 ms 3328 KB
01_rnd_01.txt 62 ms 3260 KB
01_rnd_02.txt 64 ms 3260 KB
01_rnd_03.txt 62 ms 3260 KB
01_rnd_04.txt 61 ms 3308 KB
01_rnd_05.txt 62 ms 3260 KB
01_rnd_06.txt 61 ms 3260 KB
01_rnd_07.txt 63 ms 3256 KB
01_rnd_08.txt 62 ms 3256 KB
01_rnd_09.txt 64 ms 3324 KB
01_rnd_10.txt 63 ms 3320 KB
01_rnd_11.txt 60 ms 3260 KB
01_rnd_12.txt 62 ms 3252 KB
01_rnd_13.txt 62 ms 3260 KB
01_rnd_14.txt 60 ms 3252 KB
01_rnd_15.txt 59 ms 3264 KB
01_rnd_16.txt 60 ms 3260 KB
01_rnd_17.txt 61 ms 3268 KB
01_rnd_18.txt 63 ms 3260 KB
01_rnd_19.txt 64 ms 3256 KB