Codeforces Global Round 19 D. Yet Another Minimization Problem

#include<bits/stdc++.h>
using namespace std;
const int N=1e4+10;
bool dp[2][N];
int t,n,a[N],b[N];
int main(){
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		int suma=0,sumb=0,sum=0;
		for(int i=1;i<=n;i++) scanf("%d",&a[i]),suma+=a[i]*a[i],sum+=a[i];
		for(int i=1;i<=n;i++) scanf("%d",&b[i]),sumb+=b[i]*b[i],sum+=b[i];
		memset(dp,false,sizeof dp);
		dp[0][0]=1;
		for(int i=1;i<=n;i++){
			for(int j=0;j<N;j++){
				if(j>=a[i]) dp[i&1][j]=dp[i&1][j]|dp[(i-1)&1][j-a[i]];
				if(j>=b[i]) dp[i&1][j]=dp[i&1][j]|dp[(i-1)&1][j-b[i]];
			}
			// for(int j=0;j<N;j++) if(dp[i&1][j]) cout<<j<<" ";cout<<endl;
			for(int j=0;j<N;j++) dp[(i-1)&1][j]=0;
		}
		int res=1e9;
		for(int i=0;i<N;i++){
			if(dp[n&1][i]==1){
				// cout<<i*i+(sum-i)*(sum-i)<<" "<<i<<endl;
				 res=min(res,i*i+(sum-i)*(sum-i));
			}
		}
		cout<<res+suma*(n-2)+sumb*(n-2)<<endl;
	}
}