Submission #3782423

Source Code Expand

n = int(input())
r = [list(map(int, input().split())) for i in range(n)]
key = 0
for i in range(1,n):
    for j in range(i):
        lx = abs(r[i][0]-r[j][0])
        ly = abs(r[i][1]-r[j][1])
        if key < lx**2+ly**2:
            key = lx**2+ly**2
print(key**(1/2))

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User dn6049949
Language PyPy3 (2.4.0)
Score 100
Code Size 279 Byte
Status AC
Exec Time 201 ms
Memory 40432 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 167 ms 38256 KB
00_sample_01.txt AC 169 ms 38256 KB
00_sample_02.txt AC 168 ms 38256 KB
00_sample_03.txt AC 167 ms 38256 KB
00_sample_04.txt AC 168 ms 38256 KB
00_sample_05.txt AC 168 ms 38256 KB
01_rnd_00.txt AC 201 ms 40432 KB
01_rnd_01.txt AC 194 ms 39920 KB
01_rnd_02.txt AC 188 ms 39920 KB
01_rnd_03.txt AC 189 ms 39920 KB
01_rnd_04.txt AC 188 ms 39920 KB
01_rnd_05.txt AC 187 ms 39920 KB
01_rnd_06.txt AC 188 ms 39792 KB
01_rnd_07.txt AC 188 ms 39920 KB
01_rnd_08.txt AC 188 ms 39920 KB
01_rnd_09.txt AC 189 ms 39920 KB
01_rnd_10.txt AC 188 ms 39920 KB
01_rnd_11.txt AC 192 ms 39920 KB
01_rnd_12.txt AC 189 ms 39920 KB
01_rnd_13.txt AC 187 ms 39920 KB
01_rnd_14.txt AC 191 ms 39920 KB
01_rnd_15.txt AC 187 ms 39792 KB
01_rnd_16.txt AC 188 ms 39920 KB
01_rnd_17.txt AC 192 ms 39920 KB
01_rnd_18.txt AC 190 ms 39920 KB
01_rnd_19.txt AC 187 ms 39920 KB