1336B - Xenia and Colorful Gems - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
#define int long long 
const int N=2e5+5;
const int M=1e9+7;



int32_t main(){
ios_base::sync_with_stdio(false);
    cin.tie(NULL); 

int tt;
cin>>tt;

while(tt--){

int nr,ng,nb;

cin>>nr>>ng>>nb;


vector<int>r(nr),g(ng),b(nb);


for(int i=0;i<nr;i++)
cin>>r[i];

for(int i=0;i<ng;i++)
cin>>g[i];

for(int i=0;i<nb;i++)
cin>>b[i];

sort(r.begin(),r.end());
sort(g.begin(),g.end());
sort(b.begin(),b.end());

int ans=LLONG_MAX;

for(int i=0;i<nr;i++){
    
    int z=r[i];
    
    vector<int>A,B;
    
    {
    auto it=upper_bound(g.begin(),g.end(),r[i]);
    
    if(it!=g.end()){
        A.push_back(*it);
    }
    if(it!=g.begin()){
        it--;
        A.push_back(*it);
    }
    }
    {
          auto it=upper_bound(b.begin(),b.end(),r[i]);
    
    if(it!=b.end()){
        B.push_back(*it);
    }
    if(it!=b.begin()){
        it--;
        B.push_back(*it);
    }
    }
    
    for(auto x:A){
        for(auto y:B){
          //  cout<<z<<" "<<x<<" "<<y<<"\n";
            int now=(x-y)*(x-y)+(y-z)*(y-z)+(x-z)*(x-z);
            ans=min(ans,now);
        }
    }
    
}

swap(nr,ng);
swap(r,g);

for(int i=0;i<nr;i++){
    
    int z=r[i];
    
    vector<int>A,B;
    
    {
    auto it=upper_bound(g.begin(),g.end(),r[i]);
    
    if(it!=g.end()){
        A.push_back(*it);
    }
    if(it!=g.begin()){
        it--;
        A.push_back(*it);
    }
    }
    {
          auto it=upper_bound(b.begin(),b.end(),r[i]);
    
    if(it!=b.end()){
        B.push_back(*it);
    }
    if(it!=b.begin()){
        it--;
        B.push_back(*it);
    }
    }
    
    for(auto x:A){
        for(auto y:B){
          //  cout<<z<<" "<<x<<" "<<y<<"\n";
            int now=(x-y)*(x-y)+(y-z)*(y-z)+(x-z)*(x-z);
            ans=min(ans,now);
        }
    }
    
}

swap(nr,nb);
swap(r,b);

for(int i=0;i<nr;i++){
    
    int z=r[i];
    
    vector<int>A,B;
    
    {
    auto it=upper_bound(g.begin(),g.end(),r[i]);
    
    if(it!=g.end()){
        A.push_back(*it);
    }
    if(it!=g.begin()){
        it--;
        A.push_back(*it);
    }
    }
    {
          auto it=upper_bound(b.begin(),b.end(),r[i]);
    
    if(it!=b.end()){
        B.push_back(*it);
    }
    if(it!=b.begin()){
        it--;
        B.push_back(*it);
    }
    }
    
    for(auto x:A){
        for(auto y:B){
          //  cout<<z<<" "<<x<<" "<<y<<"\n";
            int now=(x-y)*(x-y)+(y-z)*(y-z)+(x-z)*(x-z);
            ans=min(ans,now);
        }
    }
    
}


cout<<ans<<"\n";
}
}