Submission #3792268

Source Code Expand

n = int(input())
xy = [list(map(int, input().split())) for i in range(n)]
res = -1
for i in range(n-1):
    for j in range(i+1, n):
        dist = abs(xy[i][0] - xy[j][0])**2 + abs(xy[i][1] - xy[j][1])**2
        if res < dist:
            res = dist
print(res**0.5)

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User yasu42810
Language Python (3.4.3)
Score 100
Code Size 276 Byte
Status AC
Exec Time 22 ms
Memory 3444 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 19 ms 3444 KB
00_sample_01.txt AC 17 ms 2940 KB
00_sample_02.txt AC 17 ms 2940 KB
00_sample_03.txt AC 17 ms 2940 KB
00_sample_04.txt AC 17 ms 2940 KB
00_sample_05.txt AC 17 ms 2936 KB
01_rnd_00.txt AC 22 ms 3060 KB
01_rnd_01.txt AC 22 ms 2940 KB
01_rnd_02.txt AC 22 ms 2940 KB
01_rnd_03.txt AC 22 ms 2940 KB
01_rnd_04.txt AC 22 ms 2940 KB
01_rnd_05.txt AC 22 ms 2940 KB
01_rnd_06.txt AC 22 ms 2940 KB
01_rnd_07.txt AC 22 ms 3060 KB
01_rnd_08.txt AC 22 ms 2940 KB
01_rnd_09.txt AC 22 ms 3060 KB
01_rnd_10.txt AC 22 ms 2940 KB
01_rnd_11.txt AC 22 ms 2940 KB
01_rnd_12.txt AC 22 ms 2940 KB
01_rnd_13.txt AC 22 ms 3060 KB
01_rnd_14.txt AC 22 ms 2940 KB
01_rnd_15.txt AC 22 ms 3060 KB
01_rnd_16.txt AC 22 ms 2940 KB
01_rnd_17.txt AC 22 ms 2940 KB
01_rnd_18.txt AC 22 ms 2940 KB
01_rnd_19.txt AC 22 ms 3060 KB