Submission #1404279
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define DB long double struct point{ DB x,y; }a,b,c; DB dis(point a,point b){ return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)); } DB area(DB p1,DB p2,DB p3){ DB p=(p1+p2+p3)/2; return sqrt(p*(p-p1)*(p-p2)*(p-p3)); } bool check(DB d){ DB p[3]={dis(a,b),dis(b,c),dis(c,a)};DB r=1,h; for(int i=0;i<3;i++){ h=area(p[0],p[1],p[2])*2/p[i]*r; if(h<d) return false; r*=(h-d)/h; } return max(p[0],max(p[1],p[2]))*r>d*2; } int main(){ cin>>a.x>>a.y>>b.x>>b.y>>c.x>>c.y; DB l=0,r=1e3; while(r-l>1e-10){ DB mid=(l+r)/2; if(check(mid)) l=mid; else r=mid; } printf("%.10lf",(double)l); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Inscribed Bicycle |
User | Wuvin |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 694 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 384 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 | 3 ms | 384 KB |
001.txt | AC | 1 ms | 256 KB |
002.txt | AC | 1 ms | 256 KB |
003.txt | AC | 1 ms | 256 KB |
004.txt | AC | 1 ms | 256 KB |
005.txt | AC | 1 ms | 256 KB |
006.txt | AC | 1 ms | 256 KB |
007.txt | AC | 1 ms | 256 KB |
008.txt | AC | 1 ms | 256 KB |
009.txt | AC | 1 ms | 256 KB |
010.txt | AC | 1 ms | 256 KB |
011.txt | AC | 1 ms | 256 KB |
012.txt | AC | 1 ms | 256 KB |
013.txt | AC | 1 ms | 256 KB |
014.txt | AC | 1 ms | 256 KB |
015.txt | AC | 1 ms | 256 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |