HDU 1533 Going Home
2013-07-26 23:23
274 查看
7月冒泡第三题。
#include <iostream> #include <cstdlib> #include <cstdio> #include <string> #include <cstring> #include <cmath> #include <vector> #include <queue> #include <algorithm> #include <map> using namespace std; const int maxn = 310; 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 <= n; 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 <= n; 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; if(T[i]) Ly[i] += a; } } void KM() { for(int i = 1; i <= n; i++) { Left[i] = Lx[i] = Ly[i] = 0; for(int j = 1; j <= n; j++) Lx[i] = max(Lx[i], W[i][j]); } for(int i = 1; i <= n; i++) { for(;;) { for(int j = 1; j <= n; 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'); } struct node { int x, y; node(int x=0, int y=0): x(x), y(y) {} }H[maxn], M[maxn]; int hh, mm; char s[110][110]; void read_case() { for(int i = 0; i < n; i++) scanf("%s", s[i]); } int Dist(node a, node b) { return abs(a.x-b.x) + abs(a.y-b.y); } void build() { hh = mm = 1; for(int i = 0; i < n; i++) for(int j = 0; j < m; j++) { if(s[i][j] == 'm') { M[mm++] = node(i, j); } if(s[i][j] == 'H') { H[hh++] = node(i, j); } } mm--, hh--; n = hh, m = mm; for(int i = 1; i <= n; i++) { for(int j = 1; j <= n; j++) { W[i][j] = -(Dist(H[i], M[j])); } } } void solve() { read_case(); build(); KM(); int ans = 0; for(int i = 1; i <= n; i++) ans += W[Left[i]][i]; writeint(-ans), puts(""); } int main() { readint(n), readint(m); for(; (n || m); readint(n), readint(m)) { solve(); } return 0; }
相关文章推荐
- HDU 1533 Going Home (二分图最小权匹配 KM模板)
- hdu 1533 Going Home (zkw + spfa和slf优化)
- hdu 1533 Going Home(二分图)
- hdu 1533 Going Home(KM 最小权值匹配)
- HDU 1533 Going Home(KM完美匹配)
- HDU-1533 Going Home
- 网络流 ( 最小费用最大流 )——Going Home ( HDU 1533 )
- [HDU] 1533 Going Home
- 【进阶——最小费用最大流】hdu 1533 Going Home (费用流)Pacific Northwest 2004
- hdu 1533 Going Home
- HDU_1533_Going Home(最小费用流模板)
- HDU 1533 Going Home 最小费用流
- HDU--1533--Going Home--KM算法
- hdu 1533 Going Home(最小费用最大流)
- HDU 1533 Going Home (KM)
- HDU1533-Going Home 简单KM
- hdu 1533 Going Home 最小费用最大流
- hdu 1533 || poj 2195 Going Home (最小费用最大流)
- hdu 1533 Going Home (最小费用最大流)
- hdu 1533 going home(费用流初探)