题目大意:
给定三个数组,从三个数组中分别选出一个数字,使得要求的结果表达式最小
解题思路:
由题意可知三个数x<=y<=z,枚举y,二分查找找到最接近与y的x与z,求结果,取所有结果的最小值
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=1e5+10;
ll ans;
int n,t;
void solve(vector<int> a,vector<int> b,vector<int> c)
{
for(auto y:b)
{
auto x=upper_bound(c.begin(),c.end(),y);
auto z=lower_bound(a.begin(),a.end(),y);
if(x==c.begin()||z==a.end()) continue;
x--;
ans=min(ans,(ll)(y-*x)*(y-*x)+(ll)(y-*z)*(y-*z)+(ll)(*x-*z)*(*x-*z));
}
}
int main()
{
scanf("%d",&t);
while(t--)
{
int n1,n2,n3;
scanf("%d%d%d",&n1,&n2,&n3);
vector<int> a(n1),b(n2),c(n3);
for(int i=0;i<n1;++i) scanf("%d",&a[i]);
for(int i=0;i<n2;++i) scanf("%d",&b[i]);
for(int i=0;i<n3;++i) scanf("%d",&c[i]);
ans=0x3f3f3f3f3f3f3f3f;
sort(a.begin(),a.end());
sort(b.begin(),b.end());
sort(c.begin(),c.end());
solve(a,b,c);
solve(a,c,b);
solve(b,a,c);
solve(b,c,a);
solve(c,a,b);
solve(c,b,a);
printf("%lld\n",ans);
}
return 0;
}