Submission #1001524
Source Code Expand
import math as m p1 = list(map(int, input().split())) p2 = list(map(int, input().split())) p3 = list(map(int, input().split())) points = (m.sqrt((p1[0]-p2[0])**2+(p1[1]-p2[1])**2) for p1, p2 in zip((p1, p2, p3), (p2, p3, p1))) a, b, c = sorted(points) s = (a + b + c) / 2 T = m.sqrt(s*(s-a)*(s-b)*(s-c)) ans = 2*T / (a + b + c + 4*T/c) print(ans)
Submission Info
Submission Time | |
---|---|
Task | B - Inscribed Bicycle |
User | furikus |
Language | Python (3.4.3) |
Score | 500 |
Code Size | 359 Byte |
Status | AC |
Exec Time | 27 ms |
Memory | 3064 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 | 24 ms | 3064 KB |
001.txt | AC | 23 ms | 3064 KB |
002.txt | AC | 23 ms | 3064 KB |
003.txt | AC | 27 ms | 3064 KB |
004.txt | AC | 23 ms | 3064 KB |
005.txt | AC | 23 ms | 3064 KB |
006.txt | AC | 23 ms | 3064 KB |
007.txt | AC | 23 ms | 3064 KB |
008.txt | AC | 23 ms | 3064 KB |
009.txt | AC | 23 ms | 3064 KB |
010.txt | AC | 23 ms | 3064 KB |
011.txt | AC | 23 ms | 3064 KB |
012.txt | AC | 23 ms | 3064 KB |
013.txt | AC | 23 ms | 3064 KB |
014.txt | AC | 23 ms | 3064 KB |
015.txt | AC | 23 ms | 3064 KB |
example0.txt | AC | 23 ms | 3064 KB |
example1.txt | AC | 23 ms | 3064 KB |