Contest Duration: ~ (local time)

Submission #2118930

Source Code Expand

Copy
```#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

typedef vector<int> vi;
typedef pair<int,int> pii;

int main(void) {
double x1,x2,x3;
double y1,y2,y3;
cin>>x1>>y1;
cin>>x2>>y2;
cin>>x3>>y3;

double a=hypot(abs(x1-x2),abs(y1-y2));
double b=hypot(abs(x2-x3),abs(y2-y3));
double c=hypot(abs(x3-x1),abs(y3-y1));
double len=max(a,max(b,c));

double s=(a+b+c)/2;
double area=sqrt(s*(s-a)*(s-b)*(s-c));
double r=area/s;

double ok=0,ng=len;
rep(i,100000){
double x=(ok+ng)/2;
if(len*(r-x) >= 2*x*r)ok=x;
else ng=x;
}

cout<<shosu(13)<<ok<<endl;
}
```

#### Submission Info

Submission Time 2018-02-21 00:04:23+0900 B - Inscribed Bicycle rika0384 C++14 (GCC 5.4.1) 500 1154 Byte AC 2 ms 256 KB

#### Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 example0.txt, example1.txt
All 500 / 500 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 2 ms 256 KB
001.txt 2 ms 256 KB
002.txt 2 ms 256 KB
003.txt 2 ms 256 KB
004.txt 2 ms 256 KB
005.txt 2 ms 256 KB
006.txt 2 ms 256 KB
007.txt 2 ms 256 KB
008.txt 2 ms 256 KB
009.txt 2 ms 256 KB
010.txt 2 ms 256 KB
011.txt 2 ms 256 KB
012.txt 2 ms 256 KB
013.txt 2 ms 256 KB
014.txt 2 ms 256 KB
015.txt 2 ms 256 KB
example0.txt 2 ms 256 KB
example1.txt 2 ms 256 KB