Submission #1000742

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

int main() {
	vector<int> x(3), y(3);
	rep(i, 3) cin >> x[i] >> y[i];
	vector<double> a(3);
	rep(i, 3) {
		int dx = x[i] - x[(i + 1) % 3];
		int dy = y[i] - y[(i + 1) % 3];
		a[i] = sqrt(dx * dx + dy * dy);
	}
	double s = 0;
	rep(i, 3) s += x[i] * y[(i + 1) % 3] - y[i] * x[(i + 1) % 3];
	s = abs(s);
	double lb = 0, ub = 10000;
	rep(t, 300) {
		double r = (lb + ub) / 2;
		bool ok = false;
		rep(t, 3) {
			double S = 0;
			S += (a[0] + a[1]) * r + (a[2] + r * 2) * r;
			if (s / a[2] - r <= 0) S += 1e18;
			S += (s / a[2] - r) * r * 2;
			if (S <= s) ok = true;
			// rotate(a.begin(), a.begin() + 1, a.end());
		}
		if (ok) lb = r;
		else ub = r;
	}
	printf("%.15f\n", lb);
}

Submission Info

Judge Result