Codeforces Round #635 (Div. 2) D. Xenia and Colorful Gems（二分）

链接 D. Xenia and Colorful Gems

题意

给出三组数，从三组数中各选一个数，求$min(x-y{)}^2+(y-z{)}^2+(x-z{)}^2$；

思路

由式子可知，三个数相差越小，得到的答案越小；
遍历一个数组， 每次二分查找接近 i 的两个数即可，注意遇到数组边界情况；

AC代码

#include <bits/stdc++.h>
#define hz020 return
#define mes memset
#define mec memcpy
#define x first
#define y second
#define pb push_back
#define be(x) (x).begin(), (x).end()
#define cl(x) memset((x), 0, sizeof (x))
#define sz(x) (int)(x).size()

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll,ll> PII;

const double pi = acos(-1);
const int N = 100010;
const int null = 0x3f3f3f3f,INF = 1e9;
const ll mod = 998244353;

int T;
int nr, ng, nb;
ll ans;

void solve(vector<ll> a, vector<ll> b, vector<ll> c)
{
	for (auto i:a)
	{
		auto x = lower_bound(be(b), i);
		auto y = upper_bound(be(c), i);

		if (x == b.end() || y == c.begin()) continue;
		y --;
		ans = min(ans, (ll)(i - *x) * (i - *x) + (ll)(i - *y) * (i - *y) + (ll)(*x - *y) * (*x - *y));
	}
}

int main()
{
	cin >> T;
	while (T --)
	{
		cin >> nr >> ng >> nb;
		vector<ll> r, g, b;
		ll x;
		for (int i = 1; i <= nr; i ++) cin >> x, r.pb(x);
		for (int i = 1; i <= ng; i ++) cin >> x, g.pb(x);
		for (int i = 1; i <= nb; i ++) cin >> x, b.pb(x);

		sort(be(r)), sort(be(g)), sort(be(b));

		ans = 0x3f3f3f3f3f3f3f3f;

		solve(r, g, b);
		solve(r, b, g);
		solve(b, r, g);
		solve(b, g, r);
		solve(g, r, b);
		solve(g, b, r);

		cout << ans << endl;
	}
	hz020 0;	
}

END