Submission #119699

#	Time	Username	Problem	Language	Result	Execution time	Memory
119699		tutis	2circles (balkan11_2circles)	C++17	0 / 100	92 ms	65536 KiB

twocircles

/*input
4
0 0
1 0
1 1
0 1
*/
#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;
}
struct line
{
	point a, b;
};
point x(const line &a, const line &b)
{
	return x(a.a, a.b, b.a, b.b);
}
int n;
point A[50505];
bool nereik(line a, line b, line c)
{
	return cross(x(a, c) - b.a, b.b - b.a) < 0;
}
deque<line> taisom(deque<line>a)
{
	if (a.size() <= 2)
		return {};
	for (int i = 0; i < (int)a.size(); i++)
	{
		int j = (i + 1) % a.size();
		int k = (i + 2) % a.size();
		if (abs(cross(a[i].b - a[i].a, a[k].b - a[k].a)) > 1e-3)
		{
			if (nereik(a[i], a[j], a[k]))
			{
				a.erase(a.begin() + j);
				return taisom(a);
			}
		}
		else
		{
			if (cross(a[k].a - a[i].a, a[i].b - a[i].a) > 0)
				return {};
		}
	}
	return a;
}
deque<point>x(deque<line>a)
{
	deque<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 deque<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)
{
	deque<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;
	}
	tieses = taisom(tieses);
	ld rr = maxi(x(tieses));
	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 = 3e7;
	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: 0 / 100