【Plan 第七場】

A

一類題。。。類似最小乘積生成樹。。。。。。。。。。。。

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
#define rep(i,l,r) for(int i=(l),_=(r);i<=_;i++)
#define per(i,r,l) for(int i=(r),_=(l);i>=_;i--)
#define INE(i,u) for(int i=head[u];~i=i=e[i].next)
#define MS(arr,x) memset(arr,x,sizeof(arr))
#define LL long long
inline int read(){
	int r=0,k=1;char c=0;
	for(;c<'0'||c>'9';c=getchar())if(c=='-')k=-1;
	for(;c>='0'&&c<='9';c=getchar())r=r*10+c-'0';
	return r*k;
}
////////////////////////////////////////////////
const int inf=0x3f3f3f3f;
int n;
int A[77][77],B[77][77],W[77][77],d;
struct Point{
	int x,y;
	Point(){}
	Point(int x,int y):x(x),y(y){}
	Point operator-(const Point &b)const{return Point(x-b.x,y-b.y);}
	int operator^(const Point &b)const{return x*b.y-y*b.x;}
}ans;
int X[77],Y[77],pre[77];
bool S[77],T[77];
////////////////////////////////////////////////
void MAX(int &a,int b){if(a<b)a=b;}
void MIN(int &a,int b){if(a>b)a=b;}
bool dfs(int i)
{
	S[i]=1;
	rep(j,1,n)
	{
		if(X[i]+Y[j]==W[i][j]&&!T[j])
		{
			T[j]=1;
			if(pre[j]<0 || dfs(pre[j]))
			{
				pre[j]=i;
				return 1;
			}
		}
		else if(X[i]+Y[j]>W[i][j])
		    MIN(d,X[i]+Y[j]-W[i][j]);
	}
	return 0;
}
Point KM()
{
	rep(i,1,n)
	{
		X[i]=Y[i]=0; pre[i]=-1;
		rep(j,1,n) MAX(X[i],W[i][j]);
	}
	rep(i,1,n) for(;;)
	{
		rep(j,1,n) S[j]=T[j]=0;
		d=inf;
		if(dfs(i)) break;
		rep(j,1,n)
		{
			if(S[j]) X[j]-=d;
			if(T[j]) Y[j]+=d;
		}
	}
	int x=0,y=0;
	rep(i,1,n)
	{
		x+=A[pre[i]][i];
		y+=B[pre[i]][i];
	}
	if(x*y < ans.x*ans.y) ans=Point(x,y);
	return Point(x,y);
}
void cal(Point P,Point Q)
{
	rep(i,1,n) rep(j,1,n) W[i][j]=-(A[i][j]*(P.y-Q.y) + B[i][j]*(Q.x-P.x));
	Point M=KM();
	if((Q-M^P-M)<=0) return;
	cal(P,M); cal(M,Q);
}
////////////////////////////////////////////////
void input()
{
	n=read();
	rep(i,1,n) rep(j,1,n) A[i][j]=read();
	rep(i,1,n) rep(j,1,n) B[i][j]=read();
}
void solve()
{
	Point P,Q;
	ans.x=10000; ans.y=10000;
	
	rep(i,1,n) rep(j,1,n) W[i][j]=-A[i][j];
	P=KM();
	
	rep(i,1,n) rep(j,1,n) W[i][j]=-B[i][j];
	Q=KM();
	
	cal(P,Q);
	printf("%d\n",ans.x*ans.y);
}
int main()
{
	freopen("frame.in","r",stdin); freopen("frame.out","w",stdout);
	rep(i,1,read())
	input(),solve();
	return 0;
}

B

方伯伯的OJ。。。。。

C

鬼畜題不敢碰QwQ