제출 #119712

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
119712		tutis	두 개의 원 (balkan11_2circles)	C++17	60 / 100	4032 ms	12756 KiB

twocircles

/*input
6
0 0
8 0
8 6
4 8
2 8
0 4

*/
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
struct point
{
	ld x, y;
	point() {}
	point(ld x, ld y): x(x), y(y) {}
	ld r()
	{
		return sqrtl(x * x + y * y);
	}
};
point operator+(const point &a, const point &b)
{
	return point(a.x + b.x, a.y + b.y);
}
point operator-(const point &a, const point &b)
{
	return point(a.x - b.x, a.y - b.y);
}
point operator*(const point &a, const point &b)
{
	return point(a.x * b.x - a.y * b.y, a.x * b.y + a.y * b.x);
}
point operator*(point a, ld k)
{
	return point(a.x * k, a.y * k);
}
ld dot(const point &a, const point &b)
{
	return a.x * b.x + a.y * b.y;
}
ld cross(const point &a, const point &b)
{
	return a.x * b.y - a.y * b.x;
}
point x(const point &a, point b, const point &c, point d)
{
	b = b - a;
	d = d - c;
	ld y = cross(a - c, b) / cross(d, b);
	return c + d * y;
}
ld y(const point &a, point b, const point &c, point d)
{
	b = b - a;
	d = d - c;
	return cross(a - c, b) / cross(d, b);
}
struct line
{
	point a, b;
};
point x(const line &a, const line &b)
{
	return x(a.a, a.b, b.a, b.b);
}
ld y(const line &a, const line &b)
{
	return y(a.a, a.b, b.a, b.b);
}
int n;
point A[505050];
bool nereik(const line &a, const line &b, const line &c)
{
	return y(a, b) >= y(c, b);
}
void taisom(list<line> &a)
{
	if (a.size() <= 2)
	{
		a = {};
		return;
	}
	int dar = a.size() + 10;
	for (auto ii = a.begin(); dar > 0;)
	{
		if (a.size() <= 2)
		{
			a = {};
			return;
		}
		auto jj = ii; jj++;
		if (jj == a.end())jj = a.begin();
		auto kk = jj; kk++;
		if (kk == a.end())kk = a.begin();
		if (abs(cross(ii->b - ii->a, kk->b - kk->a)) > 0.5)
		{
			if (nereik(*ii, *jj, *kk))
			{
				a.erase(jj);
				dar = a.size() + 10;
				continue;
			}
		}
		else
		{
			if (cross(kk->a - ii->a, ii->b - ii->a) > 0)
			{
				a = {};
				return;
			}
		}
		ii++;
		dar--;
		if (ii == a.end())
			ii = a.begin();
	}
}
vector<point>x(vector<line>a)
{
	vector<point>ret;
	for (int i = 0; i < (int)a.size(); i++)
	{
		ret.push_back(x(a[i], a[(i + 1) % a.size()]));
	}
	return ret;
}
ld maxi(const vector<point> &a)
{
	ld ret = 0;
	for (int i = 0; i < (int)a.size(); i++)
	{
		for (int j = 0; j < i; j++)
		{
			ret = max(ret, (a[i] - a[j]).r());
		}
	}
	return ret;
}
bool ok(ld r)
{
	list<line>tieses;
	for (int i = 0; i < n; i++)
	{
		point v = (A[i + 1] - A[i]) * point(0, 1);
		v = v * (r / v.r());
		tieses.push_back(line());
		tieses.back().a = A[i] + v;
		tieses.back().b = A[i + 1] + v;
	}
	taisom(tieses);
	vector<line>z(tieses.begin(), tieses.end());
	ld rr = maxi(x(z));
	return rr >= 2 * r;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> A[i].x >> A[i].y;
	A[n] = A[0];
	ld lo = 0;
	ld hi = (1ll << 30);
	for (int t = 0; t < 100; t++)
	{
		ld r = (lo + hi) / 2;
		if (ok(r))
			lo = r;
		else
			hi = r;
	}
	ld r = (lo + hi) / 2;
	cout << fixed << setprecision(15) << r << "\n";
}

• Subtask 1: 60 / 100