Submission #4086948
Source Code Expand
#include<iostream> #include<cmath> #include<iomanip> using namespace std; int main() { int x[3], y[3]; for (int i = 0; i < 3; ++i) { cin >> x[i] >> y[i]; } double a[3]; double max = 0.0; double sum = 0.0; for (int i = 0; i < 3; ++i) { a[i] = sqrt(pow(x[i] - x[(i + 1 == 3) ? 0 : i + 1], 2) + pow(y[i] - y[(i + 1 == 3) ? 0 : i + 1], 2)); sum += a[i]; if (max < a[i]) { max = a[i]; } } double s = sum / 2; //heron's formula double area = sqrt(s * (s - a[0]) * (s - a[1]) * (s - a[2])); //内接円の半径の公式 double r = area / s; double left = 0.0, right = max; while (right - left > 0.0000000001) { double x = (left + right) / 2; //内側の三角形の1番大きい辺 if (max * (r - x) / r >= 2 * x) { left = x; } else { right = x; } } cout << fixed << setprecision(10) << left << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Inscribed Bicycle |
User | tac_ |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1032 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 |