Submission #1136996
Source Code Expand
import math x=[list(map(int,input().split()))for i in range(int(input()))] print(max(math.hypot(i[0]-j[0],i[1]-j[1]) for i in x for j in x))
Submission Info
Submission Time | |
---|---|
Task | A - 2点間距離の最大値 ( The longest distance ) |
User | tosaka2 |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 142 Byte |
Status | AC |
Exec Time | 22 ms |
Memory | 3060 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
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 | 3060 KB |
00_sample_01.txt | AC | 17 ms | 2940 KB |
00_sample_02.txt | AC | 17 ms | 3060 KB |
00_sample_03.txt | AC | 17 ms | 2940 KB |
00_sample_04.txt | AC | 17 ms | 3060 KB |
00_sample_05.txt | AC | 17 ms | 2940 KB |
01_rnd_00.txt | AC | 21 ms | 2940 KB |
01_rnd_01.txt | AC | 21 ms | 3060 KB |
01_rnd_02.txt | AC | 22 ms | 2940 KB |
01_rnd_03.txt | AC | 22 ms | 2940 KB |
01_rnd_04.txt | AC | 21 ms | 2940 KB |
01_rnd_05.txt | AC | 22 ms | 3060 KB |
01_rnd_06.txt | AC | 21 ms | 2940 KB |
01_rnd_07.txt | AC | 22 ms | 3060 KB |
01_rnd_08.txt | AC | 21 ms | 2940 KB |
01_rnd_09.txt | AC | 21 ms | 2940 KB |
01_rnd_10.txt | AC | 21 ms | 3060 KB |
01_rnd_11.txt | AC | 21 ms | 3060 KB |
01_rnd_12.txt | AC | 21 ms | 2940 KB |
01_rnd_13.txt | AC | 21 ms | 2940 KB |
01_rnd_14.txt | AC | 22 ms | 2940 KB |
01_rnd_15.txt | AC | 21 ms | 3060 KB |
01_rnd_16.txt | AC | 21 ms | 2940 KB |
01_rnd_17.txt | AC | 21 ms | 2940 KB |
01_rnd_18.txt | AC | 21 ms | 2940 KB |
01_rnd_19.txt | AC | 21 ms | 3060 KB |