58 { 58 { 59 const int N=idgen.size(), S=idgen.v2id(s_), T=idgen.v2id(t_); 59 const int N=idgen.size(), S=idgen.v2id(s_), T=idgen.v2id(t_); 60 static const Cost COST_INF = 1e+300; // !!EDIT HERE!! 60 static const Cost COST_INF = 1e+300; // !!EDIT HERE!! 61 static const Flow FLOW_INF = 0x7fffffff; 61 static const Flow FLOW_INF = 0x7fffffff; 62 62 63 Cost total_cost = 0; 63 Cost total_cost = 0; 64 Flow total_flow = 0; 64 Flow total_flow = 0; 65 vector<Cost> h(N, 0); // potential | 65 vector<Cost> dist(N, 0); // Distance from S : initially unknown. 66 for(Flow RF=FLOW_INF; RF>0; ) // residual flow | 66 for(;;) 67 { 67 { 68 // Dijkstra -- find the min-cost path | 68 // Dijkstra : find the "shortest path" from S to T wrt C > 69 // C[][] can be <0 so we must be careful. Instead of c > 70 // we compute the increase ("delta") from the shortest > 71 // Since shortest path cannot decrease, delta is alway > 72 // Smallest delta implies smallest dist[T]+delta[T]. 69 vector<Cost> d(N, COST_INF); d[S] = 0; | 73 vector<Cost> delta(N, COST_INF); delta[S] = 0; 70 vector<int> prev(N, -1); 74 vector<int> prev(N, -1); 71 75 72 typedef pair< Cost, pair<int,int> > cedge; | 76 typedef pair< Cost, pair<int, int> > cedge; 73 priority_queue< cedge, vector<cedge>, greater<cedge> > Q 77 priority_queue< cedge, vector<cedge>, greater<cedge> > Q 74 Q.push( cedge(0, make_pair(S,S)) ); | 78 Q.push( cedge(0, make_pair(S, S)) ); 75 while( !Q.empty() ) { 79 while( !Q.empty() ) { 76 cedge e = Q.top(); Q.pop(); | 80 const cedge e = Q.top(); Q.pop(); > 81 const int u_prev = e.second.first; 77 if( prev[e.second.second] >= 0 ) | 82 const int u = e.second.second; > 83 if( prev[u] >= 0 ) // visited 78 continue; 84 continue; 79 prev[e.second.second] = e.second.first; | 85 prev[u] = u_prev; 80 86 81 int u = e.second.second; < 82 for(int i=0; i<G[u].size(); ++i) { 87 for(int i=0; i<G[u].size(); ++i) { 83 int v = G[u][i]; | 88 const int v = G[u][i]; 84 Cost r_cost = C[u][v] + h[u] - h[v]; | 89 const Cost v_delta = dist[u]+delta[u]+C[ 85 if( F[u][v] > 0 && d[v] > d[u]+r_cost ) | 90 if( F[u][v]>0 && delta[v]>v_delta ) 86 Q.push( cedge(d[v]=d[u]+r_cost, | 91 Q.push( cedge(delta[v]=v_delta, 87 } 92 } 88 } 93 } 89 94 > 95 // If T is unreachable, finished. 90 if( prev[T] < 0 ) 96 if( prev[T] < 0 ) 91 break; // Finished | 97 break; > 98 > 99 // Update the distance table. > 100 for(int u=0; u<N; ++u) > 101 if( delta[u] != COST_INF ) > 102 dist[u] += delta[u]; 92 103 93 // Run the flow as much as possible | 104 // How much water can flow on the min-cost path? 94 Flow f = RF; | 105 Flow f = FLOW_INF; 95 for(int u=T; u!=S; u=prev[u]) 106 for(int u=T; u!=S; u=prev[u]) 96 f = min(f, F[prev[u]][u]); 107 f = min(f, F[prev[u]][u]); 97 RF -= f; < 98 total_flow += f; < 99 108 > 109 // Run the flow as much as possible > 110 total_flow += f; 100 for(int u=T; u!=S; u=prev[u]) | 111 for(int u=T; u!=S; u=prev[u]) { 101 { < 102 total_cost += f * C[prev[u]][u]; 112 total_cost += f * C[prev[u]][u]; 103 F[prev[u]][u] -= f; 113 F[prev[u]][u] -= f; 104 F[u][prev[u]] += f; 114 F[u][prev[u]] += f; 105 } 115 } 106 < 107 // Update the potential < 108 for(int u=0; u<N; ++u) < 109 h[u] += d[u]; < 110 } 116 } 111 return make_pair(total_cost, total_flow); 117 return make_pair(total_cost, total_flow); 112 } 118 } 113 }; 119 }; 114 120 115 class FoxCardGame { public: 121 class FoxCardGame { public: 116 double theMaxProportion(vector <double> pileA, vector <double> pileB, in 122 double theMaxProportion(vector <double> pileA, vector <double> pileB, in ................................................................................................................................................................................ 195 double pileA_[] = {1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11 201 double pileA_[] = {1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11 196 vector <double> pileA(pileA_, pileA_+sizeof(pileA_)/sizeof(*pileA_)); 202 vector <double> pileA(pileA_, pileA_+sizeof(pileA_)/sizeof(*pileA_)); 197 double pileB_[] = {1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11 203 double pileB_[] = {1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11 198 vector <double> pileB(pileB_, pileB_+sizeof(pileB_)/sizeof(*pileB_)); 204 vector <double> pileB(pileB_, pileB_+sizeof(pileB_)/sizeof(*pileB_)); 199 int k = 50; 205 int k = 50; 200 double _ = 16.846938775510203; 206 double _ = 16.846938775510203; 201 END 207 END 202 /* < 203 CASE(5) 208 CASE(5) 204 double pileA_[] = ; | 209 double pileA_[] = {1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11 205 vector <double> pileA(pileA_, pileA_+sizeof(pileA_)/sizeof(*pileA_)); 210 vector <double> pileA(pileA_, pileA_+sizeof(pileA_)/sizeof(*pileA_)); 206 double pileB_[] = ; | 211 double pileB_[] = {51.0, 52.0, 53.0, 54.0, 55.0, 56.0, 57.0, 58.0, 59.0, 207 vector <double> pileB(pileB_, pileB_+sizeof(pileB_)/sizeof(*pileB_)); 212 vector <double> pileB(pileB_, pileB_+sizeof(pileB_)/sizeof(*pileB_)); 208 int k = ; | 213 int k = 50; 209 double _ = ; | 214 double _ = 21.128144186967717; 210 END 215 END 211 */ < 212 } 216 } 213 // END CUT HERE 217 // END CUT HERE > 218