【网络流】hdu3315 My Brute

题意：一个纯的二分图最优匹配，但是要求在求得的最大匹配的基础上匹配率最大（在这里匹配率指的是Si和Xi匹配的个数占n对匹配的比例）。
难度：3
题解：KM算法。对于每对匹配V[i],我们将其乘以一个较大的数(比如100),然后如果是i对i的匹配，则匹配的边再加上1,因为是最有匹配。最后舍去100后即得到了最优匹配值，又使得匹配率最大。

#include <stdio.h>
#include <math.h>
#include <string.h>
#include <algorithm>
using namespace std;
#define N 100
#define INF ((1<<30)-10)

int V[N], H[N], P[N], A[N], B[N], mul[N], w[N][N];
int match[N], slash[N], lx[N], ly[N];
bool vx[N], vy[N];

bool Hungary(int u, int n) {
    vx[u] = true;
    for (int v = 0; v < n; v++) {
        if (vy[v] == false && lx[u] + ly[v] == w[u][v]) {
            vy[v] = true;
            if (match[v] == -1 || Hungary(match[v], n)) {
                match[v] = u;
                return true;
            }
        } else {
            slash[v] = min(slash[v], lx[u] + ly[v] - w[u][v]);
        }
    }
    return false;
}

int KM(int n) {
    for (int i = 0; i < n; i++) {
        lx[i] = -INF; ly[i] = 0; match[i] = -1;
        for (int j = 0; j < n; j++) {
            lx[i] = max(lx[i], w[i][j]);
        }
    }
    for (int k = 0; k < n; k++) {
        while (true) {
            memset(vx, false, sizeof (vx));
            memset(vy, false, sizeof (vy));
            for (int j = 0; j < n; j++) {
                slash[j] = INF;
            }
            if (Hungary(k, n)) {
                break;
            }
            int d = INF;
            for (int j = 0; j < n; j++) {
                if (vy[j] == false) {
                    d = min(d, slash[j]);
                }
            }
            for (int i = 0; i < n; i++) {
                if (vx[i]) { lx[i] -= d; }
                if (vy[i]) { ly[i] += d; }
            }
        }
    }
    int ret = 0;
    for (int i = 0; i < n; i++) {
        ret += w[match[i]][i];
    }
    return ret;
}

int getMul(int i, int j) {
    int x = (H[i] - 1) / B[j];
    int y = (P[j] - 1) / A[i];
    if (x < y) {
        return -1;
    } else {
        return +1;
    }
}

int main () {
    int n;
    while (scanf ("%d", &n) != EOF && n) {
        for (int i = 0; i < n; i++) {
            scanf ("%d", &V[i]);
        }
        for (int i = 0; i < n; i++) {
            scanf ("%d", &H[i]);
        }
        for (int i = 0; i < n; i++) {
            scanf ("%d", &P[i]);
        }
        for (int i = 0; i < n; i++) {
            scanf ("%d", &A[i]);
        }
        for (int i = 0; i < n; i++) {
            scanf ("%d", &B[i]);
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                w[i][j] = getMul(i, j) * V[i];
                w[i][j] = w[i][j] * 100 + (bool) (i == j);
            }
        }
        int ans = KM(n);
        if (ans > 0) {
            printf ("%d %.3lf%%\n", ans / 100, 100.0 * (ans % 100) / n);
        } else {
            puts("Oh, I lose my dear seaco!");
        }
    }
    return 0;
}