LightOJ 1404 Sending Secret Messages 费用流

题目：http://www.lightoj.com/volume_showproblem.php?problem=1404

题意：给定一个图，有n个顶点m条无向边，每条边都有容量和费用，求从1到n穿输p的数据量时的费用。此题中流量和费用貌似给反了-_-||

思路：最小费用流模板题了，不过是无向图，记得费用流无向图和最大流无向图的处理方式不一样，最大流在连边时改变反向边容量，而费用流一定要两次连边

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;

const int N = 60;
const int INF = 0x3f3f3f3f;
struct edge
{
    int st, to, cost, cap, next;
}g[N*N];
int head[N], dis[N], pre[N];
bool vis[N];
int cnt, cas = 0;
void add_edge(int v, int u, int cost, int cap)
{
    g[cnt].st = v, g[cnt].to = u, g[cnt].cost = cost, g[cnt].cap = cap, g[cnt].next = head[v], head[v] = cnt++;
    g[cnt].st = u, g[cnt].to = v, g[cnt].cost = -cost, g[cnt].cap = 0, g[cnt].next = head[u], head[u] = cnt++;
}
int cost_flow(int s, int t, int f)
{
    int res = 0;
    while(f > 0)
    {
        memset(dis, 0x3f, sizeof dis);
        memset(vis, 0, sizeof vis);
        memset(pre, -1, sizeof pre);
        queue<int> que;
        dis[s] = 0;
        vis[s] = true;
        que.push(s);
        while(! que.empty())
        {
            int v = que.front(); que.pop();
            for(int i = head[v]; i != -1; i = g[i].next)
            {
                int u = g[i].to;
                if(g[i].cap > 0 && dis[u] > dis[v] + g[i].cost)
                {
                    dis[u] = dis[v] + g[i].cost;
                    pre[u] = i;
                    if(! vis[u])
                        que.push(u), vis[u] = true;
                }
            }
            vis[v] = false;
        }
        if(dis[t] == INF) return -1;
        int d = f;
        for(int i = pre[t]; i != -1; i = pre[g[i].st])
            d = min(d, g[i].cap);
        f -= d;
        res += d * dis[t];
        for(int i = pre[t]; i != -1; i = pre[g[i].st])
            g[i].cap -= d, g[i^1].cap += d;
    }
    return res;
}
int main()
{
    int t, n, m, f;
    int a, b, c, d;
    scanf("%d", &t);
    while(t--)
    {
        cnt = 0;
        memset(head, -1, sizeof head);
        scanf("%d%d%d", &n, &m, &f);
        for(int i = 1; i <= m; i++)
        {
            scanf("%d%d%d%d", &a, &b, &c, &d);
            add_edge(a, b, d, c);
            add_edge(b, a, d, c);
        }
        int res = cost_flow(1, n, f);
        if(res != -1) printf("Case %d: %d\n", ++cas, res);
        else printf("Case %d: impossible\n", ++cas);
    }
    return 0;
}