UVA 1349 Optimal Bus Route Design 最小费用流+拆点

题意：给一个n个点的有向带权图 找若干个有向圈使得每个点敲好属于一个圈且权和尽量小

思路：要想使每个点恰好属于一个圈 那么这个点只有唯一的后继 然后就可以用匹配的思想来做了 这道题可以用KM算法 但我用的是费用流 具体建图是将每个点拆点 代表入点和出点 对于每条有向边 从出点到入点连边 容量1 费用为边的权值 然后从源点到每个点的入点连边 容量为1 费用为0 从每个点的出点到汇点连边 容量为1 费用为0 判断流量是否等于n 求出最小费用即可

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

#define REP( i, a, b ) for( int i = a; i < b; i++ )
#define FOR( i, a, b ) for( int i = a; i <= b; i++ )
#define CLR( a, x ) memset( a, x, sizeof a )
#define CPY( a, x ) memcpy( a, x, sizeof a )

const int maxn = 300;
const int maxe = 50000;
const int INF = 0x3f3f3f3f;

struct Edge{
          int v, c, f, w;
          int next;
          Edge() {}
          Edge(int v, int c, int f, int w, int next) : v(v), c(c), f(f), w(w), next(next) {}
};

struct MCMF{
          int n, s, t;
          int d[maxn], cur[maxn], f[maxn];
          int Head[maxn], cntE;
          int Q[maxn], head, tail, inq[maxn];
          int flow;
          long long cost;
          Edge edge[maxe];
          void Init(int n){
                    this -> n = n;
                    cntE = 0;
                    CLR(Head, -1);
          }
          void Add(int u, int v, int c, int w){
                    edge[cntE] = Edge(v, c, 0, w, Head[u]);
                    Head[u] = cntE++;
                    edge[cntE] = Edge(u, 0, 0, -w, Head[v]);
                    Head[v] = cntE++;
          }
          int Spfa(){
                    head = tail = 0;
                    CLR(d, INF);
                    CLR(inq, 0);
                    Q[tail++] = s;
                    f[s] = INF;
                    cur[s] = -1;
                    d[s] = 0;
                    while(head != tail){
                              int u = Q[head++];
                              if(head == maxn) head = 0;
                              inq[u] = 0;
                              for(int i = Head[u]; ~i; i = edge[i].next){
                                        int v = edge[i].v;
                                        if(edge[i].c > edge[i].f && d[v] > d[u] + edge[i].w){
                                                  f[v] = min(f[u], edge[i].c - edge[i].f);
                                                  d[v] = d[u] + edge[i].w;
                                                  cur[v] = i;
                                                  if(!inq[v]){
                                                            if(d[v] < d[Q[head]]){
                                                                      if(head == 0) head = maxn;
                                                                      Q[--head] = v;
                                                            }
                                                            else{
                                                                      Q[tail++] = v;
                                                                      if(tail == maxn) tail = 0;
                                                            }
                                                            inq[v] = 1;
                                                  }
                                        }
                              }
                    }
                    if(d[t] == INF) return 0;
                    flow += f[t];
                    cost += (long long)f[t] * (long long)d[t];
                    for(int i = cur[t]; ~i; i = cur[edge[i^1].v]){
                              edge[i].f += f[t];
                              edge[i^1].f -= f[t];
                    }
                    return 1;
          }
          long long Mcmf(int s, int t){
                    this -> s = s;
                    this -> t = t;
                    flow = 0;
                    cost = 0;
                    while(Spfa());
                    return cost;
          }
}solver;

int n;

void solve(){
          int to, d, S = 0, T = 2 * n + 1;
          solver.Init(T + 1);
          FOR(i, 1, n){
                    solver.Add(S, i, 1, 0);
                    while(scanf("%d", &to) && to){
                              scanf("%d", &d);
                              solver.Add(i, to + n, 1, d);
                    }
                    solver.Add(i + n, T, 1, 0);
          }
          long long cost = solver.Mcmf(S, T);
          if(solver.flow == n) printf("%lld\n", cost);
          else printf("N\n");
}

int main()
{
          //freopen("in.txt", "r", stdin);
          while(~scanf("%d", &n) && n) solve();
          return 0;
}