poj 2135 #最小费用流

Samaritan_infi

于 2017-09-10 13:59:54 发布

阅读量247

点赞数

分类专栏：网络流

本文链接：https://blog.csdn.net/Samaritan_infi/article/details/77921908

版权

网络流专栏收录该内容

9 篇文章 0 订阅

订阅专栏

can you hear me ?

#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include <queue>
using namespace std;
#define mod 1000000007
#define pi 3.1415926535897932
#define low_bit(x) (x&(-x))
#define type int
typedef long long ll ;
const int maxn = 2200 ;
const int maxm = 200200 ;
const int INF = 0x3f3f3f3f ;
int s, t;
struct node {
    int u, v, next;
    type cap, flow, cost;
}edge[maxm];
int head[maxn], cnt;
int pre[maxn];
type dis[maxn];
bool vis[maxn];
int N;

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

void add_edge (int u, int v, type cap, type cost) {
    edge[cnt].u = u, edge[cnt].v = v, edge[cnt].cap = cap, edge[cnt].flow = 0;
    edge[cnt].cost = cost, edge[cnt].next = head[u], head[u] = cnt++;
    edge[cnt].u = v, edge[cnt].v = u, edge[cnt].cap = 0, edge[cnt].flow = 0;
    edge[cnt].cost = -cost, edge[cnt].next = head[v], head[v] = cnt++;
}

bool spfa (int s, int t) {
    queue <int> q;
    for (int i = 0; i < N; i++) {
        dis[i] = INF;
        vis[i] = 0;
        pre[i] = -1;
    }
    dis[s] = 0;
    vis[s] = 1;
    q.push (s);
    while (!q.empty ()) {
        int u = q.front (); q.pop ();
        vis[u] = 0;
        for (int i = head[u]; i != -1; i = edge[i].next) {
            int v = edge[i].v;
            if (edge[i].cap > edge[i].flow && dis[v] > dis[u]+edge[i].cost) {
                dis[v] = dis[u]+edge[i].cost;
                pre[v] = i;
                if (!vis[v]) {
                    vis[v] = 1;
                    q.push (v);
                }
            }
        }
    }
    if (pre[t] == -1)
        return 0;
    else
        return 1;
}

int MCMF (int s, int t, type &cost) {
    type flow = 0;
    cost = 0;
    while (spfa (s, t)) {
        type Min = INF;
        for (int i = pre[t]; i != -1; i = pre[edge[i^1].v]) {
            if (Min > edge[i].cap-edge[i].flow) {
                Min = edge[i].cap-edge[i].flow;
            }
        }
        for (int i = pre[t]; i != -1; i = pre[edge[i^1].v]) {
            edge[i].flow += Min;
            edge[i^1].flow -= Min;
            cost += edge[i].cost*Min;
        }
        flow += Min;
    }
    return flow;
}
/*
10 15
7 1 13784
6 1 31692
4 9 16318
5 10 521
10 3 16420
5 2 11817
6 4 29070
8 5 13614
2 9 17168
8 1 19260
1 2 6076
2 3 1038
3 6 12917
2 6 17815
10 4 26493
144184
*/
int main(){
    int m ;
    while( ~ scanf("%d %d" , &N , & m) ){
        N += 2 ;
        init() ;
        memset( edge , 0 , sizeof( edge )) ;
        int a, b , c ;
        for( int i = 0 ; i < m ; i ++ ){
            scanf("%d %d %d" , &a , &b , &c ) ;
            add_edge(a , b , 1 , c) ;
            add_edge(b , a , 1 , c ) ;
        }
        int ans = 0 ;

        add_edge( 0 , 1 , 2 , 0 ) ;
        add_edge( N-2 , N-1 , 2 , 0 ) ;
        MCMF( 0 , N-1 , ans) ;
        //MCMF(0 , N-3 , ans) ;
        printf("%d\n" , ans) ;
    }
    return 0 ;
}