USACO算法系列三十九——milk6（续）

    别人提供了一个解决方案，http://dementrock.blog.com/2009/06/usaco-442-pollutant-control/

    很明显地，这是一个最小割的模型，设每边的权值为原始权值，则最大流的值就是最小割的容量，即最小损失。现在有两个问题：停止的线路数，使开始输入顺序最小。
     为解决这两个问题，可将每边的权值修改为500000+i+500000*1001*c，这个式子有什么用呢？首先，每边的权值都加上500000，那么最大流(maxflow%(500000*1001))/500000就是停止的线路的数量，取500000的原因是500000>(0+999)*1000/2，即最大情况下0~999的i的和，否则可能由于i的值而使结果偏大。i项的含义就很明显了，为使输入顺序最小。最后一项中的1001则是因为最多有1000条边，所以500000*1001*c > 500000*1000，这三项分别独立，从而得出结果。

    没有想明白。

    而我想的深度遍历的情况，也超时了。

#include <iostream> #include <fstream> #include <string.h> #define SIZE 1001 #define LENGTH 33 #define LARGER 0X7FFFFFFF #define min(a,b) (a)>(b)?(b):(a) using namespace std; //卡车 struct Truck { int s; int e; int c; }; ifstream fin("milk6.in"); ofstream fout("milk6.out"); //卡车 Truck truck[SIZE]; int tl =0; //地图 int map[LENGTH][LENGTH] = {0}; int n, m; int path[SIZE][2] = {0}; int flow[SIZE]; int pl =0; bool isuse[SIZE]; int cutresult[SIZE] = {0}; int maxflow = 0; bool BFSMap() { for (int i=0; i < m; i ++) { if (cutresult[i] == 1) { map[truck[i].s][truck[i].e] -= truck[i].c; } } memset(isuse, false, sizeof(bool) * SIZE); path[0][0] = 1; isuse[1] = true; pl = 1; for (int i=0; i < pl ;i ++) { int index = path[i][0]; for (int j=1; j <= n; j ++) { if (map[index][j] > 0 && isuse[j] == false) { isuse[j] = true; path[pl][0] = j; pl ++; if (j == n) { return true; } }//end if }//end for j }//end for i for (int i=0; i < m; i ++) { if (cutresult[i] == 1) { map[truck[i].s][truck[i].e] += truck[i].c; } } return false; } //深度遍历整个图 bool DFSTruck(int start, int remain, int sum) { if (sum > maxflow) { return false; } if(remain == 0) { if (sum == maxflow) { return !BFSMap(); } else { return false; } } else { for (int i=start; i < m; i ++) { if (sum + truck[i].c <= maxflow) { cutresult[i] = 1; if (DFSTruck(i+1, remain-1, sum+ truck [i].c)) { return true; } cutresult[i] = 0; }//end if }//end for i=start }//end else return false; } //广度求最大流 int BFSStream() { memset(isuse, false, sizeof(bool) * SIZE); path[0][0] = 1; path[0][1] = -1; flow[0] = LARGER; isuse[1] = true; pl = 1; for (int i=0; i < pl; i ++) { int s = path[i][0]; for (int j=1; j <= n; j ++) { if (map[s][j] > 0 && isuse[j] == false) { path[pl][0] = j; path[pl][1] = i; isuse[j] = true; flow[pl] = min(flow[i], map[s][j]); if (j == n) //结束 { int temp = path[pl][1]; int end = pl; while (temp != -1) { int s1 = path[temp][0]; int e1 = path[end][0]; map[s1][e1] -= flow[pl]; map[e1][s1] += flow[pl]; end = temp; temp = path[temp][1]; } return flow[pl]; }//end j == n; pl ++; }//end if }//end for j }//end for i return -1; } int main() { //输入数据 fin >> n >> m; for (int i=0; i < m; i ++) { fin >> truck[tl].s >> truck[tl].e >> truck[tl].c; map[truck[tl].s][truck[tl].e] += truck[tl].c; tl ++; } //寻找最大流 int temp = BFSStream(); while (temp != -1) { maxflow += temp; temp = BFSStream(); } //初始化 memset(map, 0, sizeof(int) * LENGTH * LENGTH); for (int i=0; i <m; i ++ ) { map[truck[i].s][truck[i].e] += truck[i].c; } int edge =1; while (!DFSTruck(0,edge,0)) { edge ++; if (edge > m) { edge = 0; break; } } fout << maxflow << " " << edge << endl; for (int i=0; i < m; i ++) { if (cutresult[i] == 1) { fout << i + 1<< endl; } } return 0; }

    运行结果如下：

Test 1: TEST OK [0.011 secs, 3048 KB] Test 2: TEST OK [0.032 secs, 3048 KB] Test 3: TEST OK [0.000 secs, 3048 KB] > Run 4: Execution error: Your program (`milk6') used more than the allotted runtime of 1 seconds (it ended or was stopped at 1.674 seconds) when presented with test case 4. It used 3048 KB of memory.

     有空再回头想想这道题吧。啃了三天都没啃动。悲剧！！