题目描述:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=36866
/*
solution:
此题其实可以转换成最大网络流问题,可以想象每行是一个水管,每列也是一个水管。
把矩阵里的每个数都减少1,则A[i]减少c,B[i]减少r,每个元素范围变成0-19.假设每行对应
一个X,每列对应着一个Y,添加一个超源点和超汇点,每个X和Y之间有着容量为19的边,
求最大流,如果每条边满载,说明问题有解。i行j列的元素就是Xi->Yj的流量加一
note:
注意输入的是前i行所有元素之和,不是每行元素之和。列同
date:
2016/4/24
*/
#include <iostream>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxc = 25;
const int maxr = 25;
const int maxn = 400;
const int INF = 99999999;
int r, c, A[maxr], B[maxc], x[maxr], y[maxc], d[maxr][maxc];
struct Edge {
int from, to, cap, flow;
Edge(int u, int v, int c, int f):from(u),to(v),cap(c),flow(f) {}
};
struct EdmondsKarp {
int n, m;
vector<Edge> edges; // 边数的两倍
vector<int> G[maxn]; // 邻接表,G[i][j]表示结点i的第j条边在e数组中的序号
int a[maxn]; // 当起点到i的可改进量
int p[maxn]; // 最短路树上p的入弧编号
void init(int n) {
for(int i = 0; i < n; i++) G[i].clear();
edges.clear();
}
void addEdge(int from, int to, int cap) {
edges.push_back(Edge(from, to, cap, 0));
edges.push_back(Edge(to, from, 0, 0));
m = edges.size();
G[from].push_back(m-2);
G[to].push_back(m-1);
}
int maxflow(int s, int t) {
int flow = 0;
for(;;) {
memset(a, 0, sizeof(a));
queue<int> Q;
Q.push(s);
a[s] = INF;
while(!Q.empty()) {
int x = Q.front(); Q.pop();
for(int i = 0; i < G[x].size(); i++) {
Edge& e = edges[G[x][i]];
if(!a[e.to] && e.cap > e.flow) {
p[e.to] = G[x][i];
a[e.to] = min(a[x], e.cap-e.flow);
Q.push(e.to);
}
}
if(a[t]) break;
}
if(!a[t]) break;
for(int u = t; u != s; u = edges[p[u]].from) {
edges[p[u]].flow += a[t];
edges[p[u]^1].flow -= a[t];
}
flow += a[t];
}
return flow;
}
};
EdmondsKarp ek;
int main()
{
// freopen("input.txt", "r", stdin);
int kase; scanf("%d", &kase);
int T = 0;
while(kase--) {
memset(d, 0, sizeof(d));
scanf("%d%d", &r, &c);
ek.init(r + c + 2);
int val, tmp = 0;
for(int i = 1; i <= r; i++) {
scanf("%d", &val);
ek.addEdge(0, i, val - tmp - c);
tmp = val;
}
tmp = 0;
for(int i = 1; i <= c; i++) {
scanf("%d", &val);
ek.addEdge(r + i, r + c + 1, val - tmp - r);
tmp = val;
}
for(int i = 1; i <= r; i++)
for(int j = 1; j <= c; j++) {
ek.addEdge(i, r + j, 19);
d[i][j] = ek.edges.size() - 2;
}
ek.maxflow(0, r+c+1);
printf("Matrix %d\n", ++T);
for(int i = 1; i <= r; i++) {
for(int j = 1; j <= c; j++)
printf("%d ", ek.edges[d[i][j]].flow + 1);
printf("\n");
}
printf("\n");
}
return 0;
}