Submission #1001223
Source Code Expand
from math import sqrt P = [map(int, raw_input().split()) for i in [0,1,2]] def dist(p, q): return sqrt((p[0]-q[0])**2 + (p[1]-q[1])**2) D = [dist(P[i-1], P[i]) for i in xrange(3)] D = D*2 def rtanhalf(a, b, c): p = 2*a*b q = a**2 + b**2 - c**2 return sqrt(float(q + p) / float(p - q)) def solve(a, b, c): s = rtanhalf(a, b, c) t = rtanhalf(c, b, a) r = b / (2. + s + t) return r print max(solve(*D[i:i+3]) for i in xrange(3))
Submission Info
Submission Time | |
---|---|
Task | B - Inscribed Bicycle |
User | yaketake08 |
Language | Python (2.7.6) |
Score | 500 |
Code Size | 476 Byte |
Status | AC |
Exec Time | 16 ms |
Memory | 2692 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 | 16 ms | 2692 KB |
001.txt | AC | 16 ms | 2692 KB |
002.txt | AC | 16 ms | 2692 KB |
003.txt | AC | 16 ms | 2692 KB |
004.txt | AC | 16 ms | 2692 KB |
005.txt | AC | 16 ms | 2692 KB |
006.txt | AC | 16 ms | 2692 KB |
007.txt | AC | 16 ms | 2692 KB |
008.txt | AC | 16 ms | 2692 KB |
009.txt | AC | 16 ms | 2692 KB |
010.txt | AC | 16 ms | 2692 KB |
011.txt | AC | 16 ms | 2692 KB |
012.txt | AC | 16 ms | 2692 KB |
013.txt | AC | 16 ms | 2692 KB |
014.txt | AC | 16 ms | 2692 KB |
015.txt | AC | 16 ms | 2692 KB |
example0.txt | AC | 16 ms | 2692 KB |
example1.txt | AC | 16 ms | 2692 KB |