Submission #4028434


Source Code Expand

import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

from math import sqrt

points = [tuple(li()) for _ in range(3)]

# 3つの辺を求める
sides = []
angles = []
for i in range(3):
    p1,p2 = points[i], points[(i+1)%3]
    sides.append(sqrt((p2[0]-p1[0])**2 + (p2[1]-p1[1])**2))

# 内接円の半径
s = (sum(sides)) / 2
a,b,c = sides
area = sqrt(s* (s-a) * (s-b) * (s-c))
r = 2*area / sum(sides)

print(max(sides)*r / (2*r + max(sides)))

Submission Info

Submission Time
Task B - Inscribed Bicycle
User polarbear08
Language Python (3.4.3)
Score 500
Code Size 853 Byte
Status AC
Exec Time 19 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 2
AC × 18
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 3064 KB
001.txt AC 18 ms 3064 KB
002.txt AC 18 ms 3064 KB
003.txt AC 18 ms 3064 KB
004.txt AC 18 ms 3064 KB
005.txt AC 18 ms 3064 KB
006.txt AC 18 ms 3064 KB
007.txt AC 18 ms 3064 KB
008.txt AC 18 ms 3064 KB
009.txt AC 18 ms 3064 KB
010.txt AC 18 ms 3064 KB
011.txt AC 18 ms 3064 KB
012.txt AC 18 ms 3064 KB
013.txt AC 18 ms 3064 KB
014.txt AC 18 ms 3064 KB
015.txt AC 19 ms 3064 KB
example0.txt AC 18 ms 3064 KB
example1.txt AC 18 ms 3064 KB