题目大意:
给你n个点,并且给你这n个点的网络邻接矩阵,你可以对任意边进行增加流量的操作,但是最多不能超过k,问1到n的最大流。
思路:有费用限制的最大流,得进到里面去改模板。
#include <bits/stdc++.h>
using namespace std;
typedef int lint;
typedef long long LL;
int k;
struct EDGE {
int from, to, next, cost, cap; // 如果需要修改 cost为LL
};
namespace MFMC {
const static int maxn = 5011;
const static int maxm = 5000005;
EDGE edge[maxm];
int tot, he[maxn], n;
void init(int _n) {
tot = 0;
n = _n + 1;
memset(he, -1, n * sizeof(int));
}
void Add(int u, int v, int cap,int cost) { // 如果需要修改 cost为LL
edge[tot] = EDGE{u, v, he[u], cost, cap};
he[u] = tot++;
}
void add(int u, int v, int cap,int cost) { // 如果需要修改 cost为LL
Add(u, v, cap,cost);
Add(v, u, 0,-cost);
}
//O(VE)
//record_e[i]是fa[i]->i的边的编号
template<typename DT>
void spfa(int s, DT dist[], int rec[]) {
queue<int> q;
static bool inq[maxn];
memset(dist, 0x3f, n * sizeof(DT));
memset(inq, 0, n * sizeof(bool));
memset(rec, -1, n * sizeof(int));
q.push(s);
dist[s] = 0;
while (!q.empty()) {
int u = q.front();
q.pop();
inq[u] = 0;
for (int e = he[u]; ~e; e = edge[e].next) {
if (0 == edge[e].cap)
continue;
int v = edge[e].to;
if (dist[v] > dist[u] + edge[e].cost) {
dist[v] = dist[u] + edge[e].cost;
rec[v] = e;
if (!inq[v]) {
q.push(v);
inq[v] = 1;
}
}
}
}
}
template<typename DT>
void dijkstra(int s, DT dist[], int rec[]) {
priority_queue<pair<DT, int> > q;//-dist, vertex
memset(dist, 0x3f, n * sizeof(DT));
memset(rec, -1, n * sizeof(int));
dist[s] = 0;
q.push(make_pair(0, s));
while (!q.empty()) {
s = q.top().second;
DT c = -q.top().first;
q.pop();
if (c != dist[s]) continue;
for (int e = he[s]; ~e; e = edge[e].next) {
if (0 == edge[e].cap) continue;
int v = edge[e].to;
if (dist[v] > c + edge[e].cost) {
dist[v] = c + edge[e].cost;
rec[v] = e;
q.push(make_pair(-dist[v], v));
}
}
}
}
//Need dijkstra_GRAPH_EDGES_PQ
//O(FE log(E)),F is the maximum flow
template<typename FT, typename CT>
void mfmc(int s, int t, FT &maxflow, CT &mincost) {
CT inf;
memset(&inf, 0x3f, sizeof(CT));
static CT dist[maxn];
static int rec_e[maxn];
maxflow = mincost = 0;
CT realdist = 0; //real distance from s to t
bool first = true;
while (1) {
if (first) {
spfa( s, dist, rec_e);
first = false;
} else {
dijkstra( s, dist, rec_e);
}
if (inf == dist[t])
break;
FT minF = numeric_limits<FT>::max();
for (int e = rec_e[t]; ~e; e = rec_e[edge[e].from])
minF = min(minF, (FT) edge[e].cap);
realdist += dist[t];
if( k == 0 ) {
maxflow += minF;
mincost += minF * realdist;
}else{
if( mincost + minF*realdist >= k ){
maxflow += (k-mincost) / realdist;
break;
}else{
maxflow += minF;
mincost += minF * realdist;
}
}
for (int e = rec_e[t]; ~e; e = rec_e[edge[e].from]) {edge[e].cap -= minF;edge[e ^ 1].cap += minF;}
for (int e = 0; e < tot; ++e) {EDGE &ed = edge[e];ed.cost += dist[ed.from] - dist[ed.to];}
}
}
};
int main(){
int n,c;
scanf("%d%d",&n,&k);
int S = 1,T = n;
MFMC::init( T );
for( int i = 1;i <= n;i++ ){
for( int j = 1;j <= n;j++ ){
scanf("%d",&c);
if(c)MFMC::add( i,j,c,0 ),MFMC::add( i,j,k,1 );
}
}
int maxflow,mincost;
MFMC::mfmc(S,T,maxflow,mincost);
printf("%d\n",maxflow);
return 0;
}