Submission #3248897
Source Code Expand
#include <bits/stdc++.h> #define FOR(i, a, b) for(int i=(int)(a); i!=(int)(b); i++) #define RFOR(i, a, b) for(int i=(int)(a); i!=(int)(b); i--) #define REP(i, n) FOR(i, 0, n) using namespace std; using ll = long long; double len(double x1, double y1, double x2, double y2){ return sqrt((x1-x2)*(x1-x2) + (y1-y2)*(y1-y2)); } double Heron(double a, double b, double c){ double s = (a + b + c) / 2; return sqrt(s * (s-a) * (s-b) * (s-c)); } double solve(double* l){ sort(l, l+3); double s = Heron(l[0], l[1], l[2]); double h = 2 * s / l[2]; double t = (l[0] + l[1] + l[2]) / 2; return s / (t + h); } int main(){ double x[3], y[3]; REP(i, 3) cin >> x[i] >> y[i]; double l[3]; REP(i, 3){ l[i] = len(x[(i+1)%3], y[(i+1)%3], x[i], y[i]); } printf("%.10lf\n", solve(l)); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Inscribed Bicycle |
User | kobajin |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 857 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 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 | 1 ms | 256 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 |