UVALive 2957 Bring Them There

Bring Them There

Time Limit: 3000ms

Memory Limit: 131072KB

This problem will be judged on UVALive. Original ID: 2957
64-bit integer IO format: %lld Java class name: Main

By the year 3141, the human civilization has spread all over the galaxy. The special hypertunnels are used to travel from one star system to another. To use the hypertunnel, you fly to a special location near the source star using your spaceship, activate the hyperjumper, fly through the hypertunnel, get out near your destination star and fly to the planet you need. The whole process takes exactly one day. A small drawback of the system is that for each tunnel every day only one spaceship can travel using this tunnel.

You are working in the transportation department of the ``Intergalaxy Business Machines" company. This morning your boss has assigned a new task to you. To run the programming contest IBM needs to deliver K supercomputers from Earth where the company headquarters are located to the planet Eisiem. Since supercomputers are very large, one needs the whole spaceship to carry each supercomputer. You are asked to find a plan to deliver the supercomputers that takes as few days as possible. Since IBM is a very powerful corporation, you may assume that any time you need some tunnel for hyperjump, it is at your service. However, you still can use each tunnel only once a day.

Input

Input consists of several datasets. The first line of each dataset contains N - the number of star systems in the galaxy, M - the number of tunnels, K - the number of supercomputers to be delivered, S - the number of the solar system (the system where planet Earth is) and T - the number of the star system where planet Eisiem is (2N50, 1M200, 1K50, 1S, TN, S T).

Next M lines contain two different integer numbers each and describe tunnels. For each tunnel the numbers of star systems that it connects are given. The tunnel can be traveled in both directions, but remember that each day only one ship can travel through it, in particular, two ships cannot simultaneously travel through the same tunnel in opposite directions. No tunnel connects a star to itself and any two stars are connected by at most one tunnel.

Output

On the first line of the output for each dataset print L - the fewest number of days needed to deliver K supercomputers from star system S to star system T using hypertunnels. Next Llines must describe the process. Each line must start with Ci - the number of ships that travel from one system to another this day. Ci pairs of integer numbers must follow, pair A, Bmeans that the ship number A travels from its current star system to star system B.

It is guaranteed that there is a way to travel from star system S to star system T.

Sample Input

Sample Output

4

2 1 2 2 4

3 1 3 2 6 3 4

3 1 5 3 6 4 4

2 1 6 4 6

Source

Regionals 2003, Europe - Northeastern

解题：大白上面的题目，网络流拆点，有些难度，坑爹的地方在于使用dinic算法，不能继续多路增广了，一旦达到那个阈值，必须停止增广，否则，WA

输出确实巧妙狗血

 #include <bits/stdc++.h>

 using namespace std;

 const int INF = ~0U>>;

 const int maxn = ;

 struct arc {

     int to,flow,next;

     arc(int x = ,int y = ,int z = -) {

         to = x;

         flow = y;

         next = z;

     }

 } e[maxn*];

 int head[maxn],d[maxn],cur[maxn],tot,S,T;

 void add(int u,int v,int flow) {

     e[tot] = arc(v,flow,head[u]);

     head[u] = tot++;

     e[tot] = arc(u,,head[v]);

     head[v] = tot++;

 }

 bool bfs() {

     queue<int>q;

     memset(d,-,sizeof d);

     q.push(S);

     d[S] = ;

     while(!q.empty()) {

         int u = q.front();

         q.pop();

         for(int i = head[u]; ~i; i = e[i].next) {

             if(e[i].flow && d[e[i].to] == -) {

                 d[e[i].to] = d[u] + ;

                 q.push(e[i].to);

             }

         }

     }

     return d[T] > -;

 }

 int dfs(int u,int low) {

     if(u == T) return low;

     int a,tmp = ;

     for(int &i = cur[u]; ~i; i = e[i].next) {

         if(e[i].flow &&d[e[i].to] == d[u]+&&(a=dfs(e[i].to,min(low,e[i].flow)))) {

             e[i].flow -= a;

             e[i^].flow += a;

             low -= a;

             tmp += a;

             break;

         }

     }

     if(!tmp) d[u] = -;

     return tmp;

 }

 int dinic(int bound,int ret = ) {

     while(ret < bound && bfs()) {

         memcpy(cur,head,sizeof head);

         ret += dfs(S,INF);

     }

     return ret;

 }

 int n,m,k,s,t;

 int x[maxn],y[maxn];

 void output(int day) {

     int to[],vis[],s[],t[];

     for(int i = ; i <= k; ++i) to[i] = S;

     int id = ;

     for(int d = ; d <= day; ++d) {

         id += (n<<); //跳过计算机停留在某个星球上一天的边

         int cnt = ;

         for(int i = ; i < m; ++i) {

             int flow1 = e[id].flow;

             id += ;

             int flow2 = e[id].flow;

             id += ;

             if(flow1 && !flow2) s[cnt] = y[i], t[cnt++] = x[i];

             if(flow2 && !flow1) s[cnt] = x[i], t[cnt++] = y[i];

         }

         memset(vis,,sizeof vis);

         printf("%d", cnt);

         for(int i = ; i < cnt; ++i)

             for(int j = ; j <= k; ++j)

                 if(s[i] == to[j] && !vis[j]) {

                     printf(" %d %d", j, t[i]);

                     to[j] = t[i];

                     vis[j] = ;

                     break;

                 }

         printf("\n");

     }

 }

 void solve() {

     int ret = ,day = ;

     while(ret < k) {

         ++day;

         for(int i = ; i <= n; ++i)

             add((day - )*n + i,day*n + i,INF);

         for(int i = ; i < m; ++i) {

             add(x[i] + (day - )*n,y[i] + day*n,);

             add(y[i] + (day - )*n,x[i] + day*n,);

         }

         S = s;

         T = t + day*n;

         ret += dinic(k - ret);

     }

     printf("%d\n",day);

     output(day);

 }

 int main() {

     while(~scanf("%d%d%d%d%d",&n,&m,&k,&s,&t)) {

         memset(head,-,sizeof head);

         for(int i = tot = ; i < m; ++i)

             scanf("%d%d",x + i,y + i);

         solve();

     }

     return ;

 }