给定一个R,C矩阵。
先计算出每行的和xi , 和每一列的和yi
那么增加一个源点S和一个汇点T;
对所有的S->xi ,建立边,边权为xi - C;(减去C的原因是为了让每条边的 xi - >yi 的边流量为 0 - 19)
对所有的yi->T ,建立边,边权为yi - R;
对所有的xi->yi ,建立边,边权为19;
然后跑一边最大流就可以了。
特别说明的是初始化类时,点数为n+m+2.
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
#include <cmath>
#define ALL(a) a.begin(), a.end()
#define clr(a, x) memset(a, x, sizeof a)
#define fst first
#define snd second
#define pb push_back
#define lowbit(x) (x&(-x))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define rep1(i,x,y) for(int i=x;i<=y;i++)
#define rep(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
const double eps = 1e-10;
typedef long long LL;
typedef long long ll;
typedef pair<int, int> pii;
const int oo =0x3f3f3f3f;
const int maxn = 60;
const int maxm = 500;
int n,m,a[maxn],b[maxn],S,T,id[maxn][maxn];
struct Edge
{
int u, v, cap, flow;
Edge(int u, int v, int c, int f):u(u), v(v), cap(c), flow(f) {}
};
struct Dinic
{
int n, m, s, t, d[maxn], cur[maxn];
bool vis[maxn];
vector<Edge> edge;
vector<int> G[maxn];
void init(int n)
{
this->n=n;
for(int i=0; i<=n; i++)
G[i].clear();
edge.clear();
}
int AddEdge(int u, int v, int c)
{
edge.push_back(Edge(u, v, c, 0));
edge.push_back(Edge(v, u, 0, 0));
m=edge.size();
G[u].push_back(m-2);
G[v].push_back(m-1);
return m-2;
}
bool bfs()
{
clr(vis, 0);
queue<int> q;
q.push(s);
d[s]=0, vis[s]=1;
while(!q.empty())
{
int x=q.front();
q.pop();
for(int i=0; i<G[x].size(); i++)
{
Edge& e=edge[G[x][i]];
if(!vis[e.v] && e.cap>e.flow)
{
vis[e.v]=1;
d[e.v]=d[x]+1;
q.push(e.v);
}
}
}
return vis[t];
}
int dfs(int x, int a)
{
if(x==t || a==0)return a;
int flow=0, f;
for(int& i=cur[x]; i<G[x].size(); i++)
{
Edge& e=edge[G[x][i]];
if(d[x]+1==d[e.v] && (f=dfs(e.v, min(a, e.cap-e.flow)))>0)
{
e.flow+=f;
edge[G[x][i]^1].flow-=f;
flow+=f;
a-=f;
if(a==0)break;
}
}
return flow;
}
int MaxFlow(int s, int t)
{
this->s=s;
this->t=t;
int flow=0;
while(bfs())
{
clr(cur, 0);
flow+=dfs(s, oo);
}
return flow;
}
} net;
int main()
{
int Ta,kase=1;
scanf("%d",&Ta);
while(Ta--){
scanf("%d %d",&n,&m);
S = 0 , T = n+m+1;
rep1(i,1,n) scanf("%d",&a[i]);
rep1(i,1,m) scanf("%d",&b[i]);
a[0] = b[0] = 0;
net.init(n+m+3);
rep1(i,1,n) net.AddEdge(S,i,a[i]-a[i-1]-m);
rep1(i,1,m) net.AddEdge(i+n,T,b[i]-b[i-1]-n);
rep1(i,1,n) rep1(j,1,m){
id[i][j] = net.AddEdge(i,j+n,19);
}
net.MaxFlow(S,T);
printf("Matrix %d\n",kase++);
rep1(i,1,n){
for(int j=1;j<=m;j++){
if(j>1) printf(" ");
Edge te = net.edge[id[i][j]];
printf("%d",te.flow+1);
}
printf("\n");
}
printf("\n");
}
return 0;
}