2道KM。HDU 3523题目长了点,POJ 2516 需要拆点来做KM。
/*HDU 3523*/
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <cctype>
using namespace std;
const int maxn = 110;
const int INF = 0x3f3f3f3f;
int n, m;
int W[maxn][maxn];
int Lx[maxn], Ly[maxn];
int Left[maxn];
bool S[maxn], T[maxn];
bool match(int i)
{
S[i] = 1;
for(int j = 1; j <= m; j++) if(Lx[i]+Ly[j] == W[i][j] && !T[j])
{
T[j] = 1;
if(!Left[j] || match(Left[j]))
{
Left[j] = i;
return 1;
}
}
return 0;
}
void update()
{
int a = INF;
for(int i = 1; i <= n; i++) if(S[i])
for(int j = 1; j <= m; j++) if(!T[j])
a = min(a, Lx[i]+Ly[j]-W[i][j]);
for(int i = 1; i <= n; i++)
{
if(S[i]) Lx[i] -= a;
}
for(int j = 1; j <= m; j++)
{
if(T[j]) Ly[j] += a;
}
}
void KM()
{
memset(Left, 0, sizeof(Left));
memset(Lx, 0, sizeof(Lx));
memset(Ly, 0, sizeof(Ly));
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= m; j++)
Lx[i] = max(Lx[i], W[i][j]);
}
for(int i = 1; i <= n; i++)
{
for(;;)
{
for(int j = 1; j <= m; j++) S[j] = T[j] = 0;
if(match(i)) break; else update();
}
}
}
inline void readint(int &x)
{
char c;
c = getchar();
while(!isdigit(c)) c = getchar();
x = 0;
while(isdigit(c)) x = x*10+c-'0', c = getchar();
}
inline void writeint(int x)
{
if(x > 9) writeint(x/10);
putchar(x%10+'0');
}
int N, M;
int Q[maxn][maxn];
void read_case()
{
readint(N), readint(M);
n = m = N;
for(int i = 1; i <= M; i++)
for(int j = 1; j <= N; j++) readint(Q[i][j]);
for(int i = 1; i <= N; i++)
{
for(int j = 1; j <= N; j++)
{
W[i][j] = 0;
for(int k = 1; k <= M; k++)
{
W[i][j] += -abs(Q[k][i]-j);
}
}
}
}
int times;
void solve()
{
read_case();
KM();
int ans = 0;
for(int i = 1; i <= m; i++) if(Left[i]) ans -= W[Left[i]][i];
printf("Case #%d: ", ++times);
writeint(ans), puts("");
}
int main()
{
int T;
times = 0;
for(readint(T); T > 0; T--)
{
solve();
}
return 0;
}
/*POJ 2516*/
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <cctype>
using namespace std;
const int maxn = 210;
const int INF = 0x3f3f3f3f;
int n, m;
int W[maxn][maxn];
int Lx[maxn], Ly[maxn];
int Left[maxn];
bool S[maxn], T[maxn];
bool match(int i)
{
S[i] = 1;
for(int j = 1; j <= m; j++) if(Lx[i]+Ly[j] == W[i][j] && !T[j])
{
T[j] = 1;
if(!Left[j] || match(Left[j]))
{
Left[j] = i;
return 1;
}
}
return 0;
}
void update()
{
int a = INF;
for(int i = 1; i <= n; i++) if(S[i])
for(int j = 1; j <= m; j++) if(!T[j])
a = min(a, Lx[i]+Ly[j]-W[i][j]);
for(int i = 1; i <= n; i++)
{
if(S[i]) Lx[i] -= a;
}
for(int j = 1; j <= m; j++)
{
if(T[j]) Ly[j] += a;
}
}
void KM()
{
memset(Left, 0, sizeof(Left));
memset(Lx, 0, sizeof(Lx));
memset(Ly, 0, sizeof(Ly));
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= m; j++)
Lx[i] = max(Lx[i], W[i][j]);
}
for(int i = 1; i <= n; i++)
{
for(;;)
{
for(int j = 1; j <= m; j++) S[j] = T[j] = 0;
if(match(i)) break; else update();
}
}
}
inline void readint(int &x)
{
char c;
c = getchar();
while(!isdigit(c)) c = getchar();
x = 0;
while(isdigit(c)) x = x*10+c-'0', c = getchar();
}
inline void writeint(int x)
{
if(x > 9) writeint(x/10);
putchar(x%10+'0');
}
int buy[maxn][maxn];
int sale[maxn][maxn];
int cost[maxn][maxn][maxn];
int N, M, K;
void read_case()
{
for(int i = 1; i <= N; i++)
for(int j = 1; j <= K; j++) readint(buy[i][j]);
for(int i = 1; i <= M; i++)
for(int j = 1; j <= K; j++) readint(sale[i][j]);
for(int k = 1; k <= K; k++)
for(int i = 1; i <= N; i++)
for(int j = 1; j <= M; j++) readint(cost[k][i][j]);
}
int check()
{
for(int k = 1; k <= K; k++)
{
int t1 = 0, t2 = 0;
for(int i = 1; i <= M; i++) t1 += sale[i][k];
for(int i = 1; i <= N; i++) t2 += buy[i][k];
if(t1 < t2) return -1;
}
return 1;
}
int A[maxn], B[maxn];
void solve()
{
read_case();
if(check() < 0) { printf("-1\n"); return ; }
int ans = 0;
for(int k = 1; k <= K; k++)
{
n = m = 1;
for(int i = 1; i <= N; i++)
for(int j = 1; j <= buy[i][k]; j++) A[n++] = i;
for(int i = 1; i <= M; i++)
for(int j = 1; j <= sale[i][k]; j++) B[m++] = i;
n--, m--;
memset(W, -INF, sizeof(W));
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++) W[i][j] = -cost[k][A[i]][B[j]];
KM();
for(int i = 1; i <= m; i++) if(Left[i]) ans -= W[Left[i]][i];
}
printf("%d\n", ans);
}
int main()
{
while(~scanf("%d%d%d", &N, &M, &K) && (N || M || K))
{
solve();
}
return 0;
}