Submission #2237398
Source Code Expand
#include "bits/stdc++.h" using namespace std; #define FOR(i,a,b) for(int i =(a);i<(b);i++) #define REP(i,n) for(int i=0;i<(n);i++) #define REPm(i,n) for(int i=(n)-1;i>=0;i--) #define REP1(i,n) for(int i=1;i<=(n);i++) #define mp make_pair typedef long long ll; typedef pair<int,int> edge; typedef pair<int,edge> qdata; int main(){ double x1,x2,x3,y1,y2,y3; cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3; double S = abs((x2-x1)*(y3-y1)-(x3-x1)*(y2-y1))/2; double a = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)); double b = sqrt((x2-x3)*(x2-x3)+(y2-y3)*(y2-y3)); double c = sqrt((x1-x3)*(x1-x3)+(y1-y3)*(y1-y3)); double m = max(a,max(b,c)); double sum = a+b+c; double ans = 2.0*m*S/(m*sum+4.0*S); printf("%.12lf\n",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Inscribed Bicycle |
User | yankeiori |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 785 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 |