Submission #1929230
Source Code Expand
#include <algorithm> #include <utility> #include <functional> #include <cstring> #include <queue> #include <stack> #include <math.h> #include <iterator> #include <vector> #include <string> #include <set> #include <math.h> #include <iostream> #include <random> #include<map> #include <iomanip> #include <time.h> #include <stdlib.h> #include <list> #include <typeinfo> #include <list> #include <set> #include <cassert> #include<fstream> #include <unordered_map> #include <cstdlib> using namespace std; #define Ma_PI 3.141592653589793 #define eps 0.00000001 #define LONG_INF 2000000000000000000 #define GOLD 1.61803398874989484820458 #define MAX_MOD 1000000007 #define REP(i,n) for(long long i = 0;i < n;++i) #define seg_size 524288 int main() { vector<pair<double, double>> wow; REP(i, 3) { double a, b; cin >> a >> b; wow.push_back(make_pair(a, b)); } wow.push_back(wow[0]); vector<double> lines; for (int i = 0;i < 3;++i) { lines.push_back(sqrt((wow[i].first - wow[i + 1].first) * (wow[i].first - wow[i + 1].first) + (wow[i].second - wow[i + 1].second) * (wow[i].second - wow[i + 1].second))); } double s = (lines[0] + lines[1] + lines[2]) / 2.0; double r = s; for (int i = 0;i < 3;++i) { r *= (s - lines[i]); } r = sqrt(r); r = (2 * r) / (lines[0]+lines[1]+lines[2]); double maximu = max({ lines[0],lines[1],lines[2] }); cout <<fixed << setprecision(10) << (maximu * r) / (maximu + 2 * r) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Inscribed Bicycle |
User | kotamanegi |
Language | C++14 (Clang 3.8.0) |
Score | 500 |
Code Size | 1492 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 |