Submission #28385988

Source Code Expand

n = int(input())
p = []
for i in range(n):
    p.append(list(map(int, input().split())))

ans = -1
for i in range(n):
    for j in range(n):
        ans = max(ans, abs(p[i][0]-p[j][0])**2 + abs(p[i][1]-p[j][1])**2)
print(ans**0.5)

Submission Info

Submission Time
Task B - Longest Segment
User sakakazu
Language PyPy3 (7.3.0)
Score 200
Code Size 239 Byte
Status AC
Exec Time 70 ms
Memory 72088 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 13
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt AC 62 ms 61684 KiB
001.txt AC 68 ms 71684 KiB
002.txt AC 52 ms 61988 KiB
003.txt AC 70 ms 71916 KiB
004.txt AC 62 ms 66392 KiB
005.txt AC 68 ms 71800 KiB
006.txt AC 63 ms 71560 KiB
007.txt AC 70 ms 71960 KiB
008.txt AC 51 ms 61936 KiB
009.txt AC 66 ms 70864 KiB
010.txt AC 68 ms 72088 KiB
example0.txt AC 50 ms 62072 KiB
example1.txt AC 52 ms 62052 KiB