hdu - 3315 最大费用最大流 优先使用原匹配

题意：有两组人进行PK，编号都是1到N。并且每个人都有HP和ATK.。并且对应第i个人，如果赢了就的v[i]分，输了就丢失v[i]分。开始0分。可以改变参赛队员的顺序。让你求能够获得的最大分数和改变参赛队员顺序占一开始顺序的比例。

求最大分数可建图 （sp, i, 1, 0）(i + n, tp, 1, 0)

           s赢 (i, j + n, 1, -vi) s输(i, j + n, 1, vi)  求最小费用最大流取负

改变最少的顺序的方法和hdu 2853 一样  不过不同的是老边要减1

（s赢输时的建图要变为）s赢 (i, j + n, 1, -vi * 1000 -1) s输(i, j + n, 1, vi * 1000 - 1)

可以用KM算法 2853题解 差不多

链接：hdu 3315

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <sstream>
#define INF 0x3f3f3f3f
using namespace std;

//最小费用最大流模版.求最大费用最大流建图时把费用取负即可。
//无向边转换成有向边时需要拆分成两条有向边。即两次加边。
const int maxn = 20005;
const int maxm = 2000200;
const int inf = 0x3f3f3f3f;

struct Edge {
    int v, cap, cost, next;
}p[maxm << 1];

int e, sumFlow, n, m, sp, tp;
int head[maxn], dis[maxn], pre[maxn];
bool vis[maxn];

void init() {
    e = 0;
    memset(head, -1, sizeof(head));
}

void addEdge(int u, int v, int cap, int cost) {
    p[e].v = v; p[e].cap = cap; p[e].cost = cost;
    p[e].next = head[u]; head[u] = e++;
    p[e].v = u; p[e].cap = 0; p[e].cost = -cost;
    p[e].next = head[v]; head[v] = e++;
}

bool spfa(int s,int t) {
    int u, v;
    queue<int>q;
    memset(vis, false, sizeof(vis));
    memset(pre, -1, sizeof(pre));
    memset(dis, inf, sizeof(dis));
    vis[s] = true;
    dis[s] = 0;
    q.push(s);
    while(!q.empty()) {
        u = q.front();
        q.pop();
        vis[u] = false;
        for(int i = head[u]; i != -1; i = p[i].next) {
            v = p[i].v;
            if(p[i].cap && dis[v] > dis[u] + p[i].cost) {
                dis[v] = dis[u] + p[i].cost;
                pre[v] = i;
                if(!vis[v]) {
                    q.push(v);
                    vis[v] = true;
                }
            }
        }
     }
     if(dis[t] == inf)
         return false;
     return true;
}

int MCMF(int s, int t) {
    int flow = 0; // 总流量
    int minflow, mincost;
    mincost = 0;
    while(spfa(s, t)) {
        minflow = inf + 1;
        for(int i = pre[t]; i != -1; i = pre[p[i^1].v]) {
            if(p[i].cap < minflow) {
                minflow = p[i].cap;
            }
        }
        flow += minflow;
        for(int i = pre[t]; i != -1; i = pre[p[i^1].v]) {
            p[i].cap -= minflow;
            p[i^1].cap += minflow;
        }
        mincost += dis[t] * minflow;
    }
    sumFlow = flow; // 最大流
    return mincost;
}

int vi[100], hi[100], pi[100], ai[100], bi[100];

bool f(int x, int y) {
    int hp1 = hi[x], hp2 = pi[y];
    while(hp1 > 0 && hp2 > 0) {
        hp2 -= ai[x];
        if(hp2 <= 0) return 1;
        hp1 -= bi[y];
        if(hp1 <= 0) return 0;
    }
}

int main ()
{
    int t, kcase = 0;
    int k;
    while(~scanf("%d", &n) && n) {
        init();
        for(int i = 1; i <= n; i++) {
            scanf("%d", &vi[i]);
        }
        for(int i = 1; i <= n; i++) {
            scanf("%d", &hi[i]);
        }
        for(int i = 1; i <= n; i++) {
            scanf("%d", &pi[i]);
        }
        for(int i = 1; i <= n; i++) {
            scanf("%d", &ai[i]);
        }
        for(int i = 1; i <= n; i++) {
            scanf("%d", &bi[i]);
        }
        sp = 0, tp = 2 * n + 1;
        for(int i = 1; i <= n; i++) {
            addEdge(sp, i, 1, 0);
            addEdge(i + n, tp, 1, 0);
            for(int j = 1; j <= n; j++) {
                if(f(i, j)) {
                    if(i == j) {
                        addEdge(i, j + n, 1, -vi[i] * 1000 - 1);
                    }
                    else {
                        addEdge(i, j + n, 1, -vi[i] * 1000);
                    }
                }
                else {
                    if(i == j) {
                        addEdge(i, j + n, 1, vi[i] * 1000 - 1);
                    }
                    else {
                        addEdge(i, j + n, 1, vi[i] * 1000);
                    }
                }
            }
        }
        int ans = -MCMF(sp, tp);
        if(ans / 1000 <= 0) {
            puts("Oh, I lose my dear seaco!");
        }
        else {
            int x = ans / 1000, y = ans % 1000;
            printf("%d %.3f%%\n", x, y * 100.0 / n);
        }
    }
    return 0;
}