Submission #3089810
Source Code Expand
import math ps = [tuple(map(int,input().split())) for i in range(3)] def dist(p1,p2): x1,y1 = p1 x2,y2 = p2 return math.hypot(x1-x2, y1-y2) es = [dist(ps[0],ps[1]), dist(ps[1],ps[2]), dist(ps[2],ps[0])] longest = max(es) #Heron s = sum(es) / 2 area = math.sqrt(s * (s-es[0]) * (s-es[1]) * (s-es[2])) h = 2 * area / longest r = (longest * h) / (sum(es) + 2*h) print(r)
Submission Info
Submission Time | |
---|---|
Task | B - Inscribed Bicycle |
User | prd_xxx |
Language | Python (3.4.3) |
Score | 500 |
Code Size | 400 Byte |
Status | AC |
Exec Time | 18 ms |
Memory | 3188 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
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, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, example0.txt, example1.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | AC | 18 ms | 3188 KB |
001.txt | AC | 17 ms | 3064 KB |
002.txt | AC | 17 ms | 3064 KB |
003.txt | AC | 17 ms | 3064 KB |
004.txt | AC | 17 ms | 3064 KB |
005.txt | AC | 17 ms | 3064 KB |
006.txt | AC | 17 ms | 3064 KB |
007.txt | AC | 17 ms | 3064 KB |
008.txt | AC | 17 ms | 3064 KB |
009.txt | AC | 17 ms | 3064 KB |
010.txt | AC | 17 ms | 3064 KB |
011.txt | AC | 17 ms | 3064 KB |
012.txt | AC | 17 ms | 3064 KB |
013.txt | AC | 17 ms | 3064 KB |
014.txt | AC | 17 ms | 3064 KB |
015.txt | AC | 17 ms | 3064 KB |
example0.txt | AC | 17 ms | 3064 KB |
example1.txt | AC | 17 ms | 3064 KB |