UVA 1324 Bring Them There 拆点+打印解

参考的大神的题解  http://blog.csdn.net/auto_ac/article/details/11579687 上面说的很详细

#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 )
#define BUG puts( "**** BUG ****" )

const int maxn = 5000 + 10;
const int N = 200 + 10;
const int maxe = 100000 + 10;
const int INF = 1e9;

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

struct ISAP{
          int n, s, t;
          int num[maxn], cur[maxn], d[maxn], p[maxn];
          int Head[maxn], cntE;
          int Q[maxn], head, tail;
          Edge edge[maxe];
          void Init(){
                    cntE = 0;
                    CLR(Head, -1);
          }
          void Add(int u, int v, int c){
                    edge[cntE] = Edge(v, c, 0, Head[u]);
                    Head[u] = cntE++;
                    edge[cntE] = Edge(u, 0, 0, Head[v]);
                    Head[v] = cntE++;
          }
          void Bfs(){
                    CLR(d, -1);
                    CLR(num, 0);
                    d[t] = 0;
                    head = tail = 0;
                    Q[tail++] = t;
                    num[0] = 1;
                    while(head != tail){
                              int u = Q[head++];
                              for(int i = Head[u]; ~i; i = edge[i].next){
                                        Edge &e = edge[i];
                                        if(~d[e.v]) continue;
                                        d[e.v] = d[u] + 1;
                                        Q[tail++] = e.v;
                                        num[d[e.v]] ++;
                              }
                    }
          }
          int Maxflow(int s, int t, int n, int limflow){
                    this -> s = s;
                    this -> t = t;
                    this -> n = n;
                    CPY(cur, Head);
                    Bfs();
                    int flow = 0, u = p[s] = s;
                    while(d[s] < n){
                              if(u == t){
                                        int f = limflow, neck;
                                        for(int i = s; i != t; i = edge[cur[i]].v){
                                                  if(f > edge[cur[i]].c - edge[cur[i]].f){
                                                            f = edge[cur[i]].c - edge[cur[i]].f;
                                                            neck = i;
                                                  }
                                        }
                                        for(int i = s; i != t; i = edge[cur[i]].v){
                                                  edge[cur[i]].f += f;
                                                  edge[cur[i]^1].f -= f;
                                        }
                                        flow += f;
                                        limflow -= f;
                                        if(!limflow) return flow;
                                        u = neck;
                              }
                              int ok = 0;
                              for(int i = cur[u]; ~i; i = edge[i].next){
                                        Edge &e = edge[i];
                                        if(e.c > e.f && d[e.v] + 1 == d[u]){
                                                  ok = 1;
                                                  cur[u] = i;
                                                  p[e.v] = u;
                                                  u = e.v;
                                                  break;
                                        }
                              }
                              if(!ok){
                                        int m = n - 1;
                                        if(--num[d[u]] == 0) break;
                                        for(int i = Head[u]; ~i; i = edge[i].next){
                                                  Edge &e = edge[i];
                                                  if(e.c - e.f > 0 && m > d[e.v]){
                                                            cur[u] = i;
                                                            m = d[e.v];
                                                  }
                                        }
                                        ++num[d[u] = m + 1];
                                        u = p[u];
                              }
                    }
                    return flow;
          }

}solver;

int n, m, k, S, T, day, flow, e;
int u[N], v[N], to[N], s[N], t[N], vis[N], cnt;

void input(){ FOR(i, 1, m) scanf("%d%d", &u[i], &v[i]); }

void solve(){
          solver.Init();
          day = 0, flow = 0;
          while(flow != k){
                    day++;
                    FOR(i, 1, n) solver.Add((day - 1) * n + i, day * n + i, INF);
                    FOR(i, 1, m){
                              solver.Add((day - 1) * n + u[i], day * n + v[i], 1);
                              solver.Add((day - 1) * n + v[i], day * n + u[i], 1);
                    }
                    flow += solver.Maxflow(S, day * n + T, (day + 1) * n + 1, k - flow);
          }
}

void output(){
          printf("%d\n", day);
          FOR(i, 1, k) to[i] = S;
          e = 0;
          FOR(d, 1, day){
                    e += n * 2; //跳过计算机停留在某个星球上一天的边
                    cnt = 0;
                    FOR(i, 1, m){
                              int flow1 = solver.edge[e].f; e += 2;
                              int flow2 = solver.edge[e].f; e += 2;
                              if(flow1 && !flow2) s[cnt] = u[i], t[cnt++] = v[i];
                              if(flow2 && !flow1) s[cnt] = v[i], t[cnt++] = u[i];
                    }
                    CLR(vis, 0);
                    printf("%d", cnt);
                    REP(i, 0, cnt) FOR(j, 1, k)
                              if(s[i] == to[j] && !vis[j]){
                                        printf(" %d %d", j, t[i]);
                                        to[j] = t[i];
                                        vis[j] = 1;
                                        break;
                              }
                    printf("\n");
          }
}

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