Submission #2097014


Source Code Expand

N = int(input())
x = [0 for i in range(N)]
y = [0 for i in range(N)]
for i in range(N):
    x[i], y[i] = map(int, input().split())
dis = [[0 for i in range(N)] for i in range(N)]
ds = [0 for i in range(N)]
for i in range(N):
    for j in range(N):
        dis[i][j] = (x[i] - x[j]) ** 2 + (y[i] - y[j]) ** 2
    ds[i] = max(dis[i])
import math
print(math.sqrt(max(ds)))

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User shakayami
Language Python (3.4.3)
Score 100
Code Size 383 Byte
Status AC
Exec Time 28 ms
Memory 3440 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 18 ms 3064 KB
00_sample_01.txt AC 17 ms 3064 KB
00_sample_02.txt AC 18 ms 3064 KB
00_sample_03.txt AC 18 ms 3064 KB
00_sample_04.txt AC 17 ms 3064 KB
00_sample_05.txt AC 17 ms 3064 KB
01_rnd_00.txt AC 27 ms 3316 KB
01_rnd_01.txt AC 27 ms 3316 KB
01_rnd_02.txt AC 27 ms 3312 KB
01_rnd_03.txt AC 27 ms 3316 KB
01_rnd_04.txt AC 27 ms 3308 KB
01_rnd_05.txt AC 27 ms 3304 KB
01_rnd_06.txt AC 27 ms 3312 KB
01_rnd_07.txt AC 27 ms 3312 KB
01_rnd_08.txt AC 28 ms 3436 KB
01_rnd_09.txt AC 27 ms 3436 KB
01_rnd_10.txt AC 27 ms 3440 KB
01_rnd_11.txt AC 27 ms 3304 KB
01_rnd_12.txt AC 27 ms 3316 KB
01_rnd_13.txt AC 27 ms 3308 KB
01_rnd_14.txt AC 27 ms 3312 KB
01_rnd_15.txt AC 27 ms 3304 KB
01_rnd_16.txt AC 27 ms 3312 KB
01_rnd_17.txt AC 27 ms 3308 KB
01_rnd_18.txt AC 27 ms 3312 KB
01_rnd_19.txt AC 27 ms 3312 KB