We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent a595e8d commit c982204Copy full SHA for c982204
atcoder/mincostflow.hpp
@@ -122,7 +122,7 @@ template <class Cap, class Cost> struct mcf_graph {
122
return true;
123
};
124
Cap flow = 0;
125
- Cost cost = 0, prev_cost = -1;
+ Cost cost = 0, prev_cost_per_flow = -1;
126
std::vector<std::pair<Cap, Cost>> result;
127
result.push_back({flow, cost});
128
while (flow < flow_limit) {
@@ -139,11 +139,11 @@ template <class Cap, class Cost> struct mcf_graph {
139
Cost d = -dual[s];
140
flow += c;
141
cost += c * d;
142
- if (prev_cost == d) {
+ if (prev_cost_per_flow == d) {
143
result.pop_back();
144
}
145
146
- prev_cost = d;
+ prev_cost_per_flow = d;
147
148
return result;
149
0 commit comments