网络流 24 题, 餐巾计划问题 (最小费用流 )

网络流24题

与以往不同的 是 我们需要让一条至少留够多少 而不是求大流
换句话说就是 求最小费用流
1 我们 可以将要满足条件的那条边的反向边连上 -inf
这样只要dis t <0 我们就还能流 停止的条件就是 dis t>=0
2 我们可以建立超级源点和汇点 转化为下界可行流求解

#include <bits/stdc++.h>
using namespace  std;
#define  int long long
//typedef long long ll;
typedef pair<int,int> pii;
#define x first
#define y second
#define pb  push_back
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--)
const int maxn=1e5+10;
const int mod=1e9+7;
int qmi(int a,int b) {
	int res=1;
	while(b) {
		if(b&1) res=res*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return res;
}
const int N=2e5+10;
int dr[4][2]= {{-1,0},{1,0},{0,-1},{0,1}};
int n,k;
const int V = 20100;
const int E = 201000;
template<typename T>
struct MinCostGraph {
	int s, t, vtot;
	int h[V], idx;
	T d[V], flow, cost;
	int pre[V];
	bool vis[V];
	int f[E*2];
	int w[E*2];
	int e[E*2];
	int ne[E*2];
	/*	struct edge {
			int v, nxt;
			T f, c;
		} e[E * 2];
		/*void addedge(int u,int v, T f, T c, T f2 = 0) {
			e[etot]= {v, head[u], f, c};
			head[u] = etot++;
			e[etot]= {u, head[v], f2, -c};
			head[v] = etot++;
		}*/
	void add(int a, int b, int c, int d) {
		e[idx] = b, f[idx] = c, w[idx] = d, ne[idx] = h[a], h[a] = idx ++ ;
		e[idx] = a, f[idx] = 0, w[idx] = -d, ne[idx] = h[b], h[b] = idx ++ ;
	}

	bool spfa() {
		T inf = numeric_limits<T>::max() / 2;
		for (int i = 1; i <= vtot; i++) {
			d[i] = inf;
			vis[i] = false;
			pre[i] = -1;
		}
		d[s] = 0;
		vis[s] = true;
		queue<int> q;
		q.push(s);
		while (!q.empty()) {
			int u = q.front();
			q.pop();
			vis[u] = false;
			for(int i=h[u]; ~i; i=ne[i]) {
				int v = e[i];
				if (f[i] && d[v] > d[u] + w[i]) {
					d[v] = d[u] + w[i];
					pre[v] = i;
					if (!vis[v]) {
						vis[v] = 1;
						q.push(v);
					}
				}
			}
		}
		return d[t] != inf;
	}

	void augment() {
		int u = t;
		T q = numeric_limits<T>::max();
		while (~pre[u]) {
			q = min(q, f[pre[u]]);
			u = e[pre[u] ^ 1];
		}
		flow += q;
		cost += q * d[t];
		u = t;
		while (~pre[u]) {
			f[pre[u]] -= q;
			f[pre[u] ^ 1] += q;
			u = e[pre[u] ^ 1];
		}
	}

	pair<T, T> solve() {
		flow = 0;
		cost = 0;
		while (spfa()) augment();
		return {flow, cost};
	}
	void init(int s_, int t_, int vtot_) {
		s = s_;
		t = t_;
		vtot = vtot_;
		idx = 0;
		for (int i = 1; i <= vtot; i++) h[i] = -1;
	}
};

MinCostGraph<int> g;
int c0,d1,c1,d2,c2;
int s,t,ss;
int inf=1ll*1<<31;
void solve() {
	cin>>n>>c0>>d1>>c1>>d2>>c2;
//	cout<<1ll*(1<<31);
	s=n+n+1,t=n+n+2,ss=n+n+3;
	g.init(s,t,ss);
	for(int i=1; i<=n; i++) {
		int x;
		cin>>x;
		g.add(s,2*i,x,0);
		g.add(2*i-1,t,x,0);
		g.add(ss,2*i-1,inf,c0);
		if(i+1<=n) {
			g.add(2*i,2*(i+1),inf,0);
		} else g.add(2*i,ss,inf,0);
		if (i+d1<= n) {
			g.add(2*i,2*(i+d1)-1,inf,c1);
		}
		if (i+d2<= n) {
			g.add(2*i,2*(i+d2)-1,inf,c2);
		}
	}
	int tt=g.solve().second;
	cout<<tt;

}

signed main() {
	IOS;
	int _=1;
	//cin>>_;
	while(_--) solve();
	return 0;
}

#include <bits/stdc++.h>
using namespace  std;
#define  int long long
//typedef long long ll;
typedef pair<int,int> pii;
#define x first
#define y second
#define pb  push_back
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--)
const int maxn=1e5+10;
const int mod=1e9+7;
int qmi(int a,int b) {
	int res=1;
	while(b) {
		if(b&1) res=res*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return res;
}
const int N=2e5+10;
int dr[4][2]= {{-1,0},{1,0},{0,-1},{0,1}};
int n,k;
const int V = 20100;
const int E = 201000;
template<typename T>
struct MinCostGraph {
	int s, t, vtot;
	int h[V], idx;
	T d[V], flow, cost;
	int pre[V];
	bool vis[V];
	int f[E*2];
	int w[E*2];
	int e[E*2];
	int ne[E*2];
	/*	struct edge {
			int v, nxt;
			T f, c;
		} e[E * 2];
		/*void addedge(int u,int v, T f, T c, T f2 = 0) {
			e[etot]= {v, head[u], f, c};
			head[u] = etot++;
			e[etot]= {u, head[v], f2, -c};
			head[v] = etot++;
		}*/
	void add(int a, int b, int c, int d) {
		e[idx] = b, f[idx] = c, w[idx] = d, ne[idx] = h[a], h[a] = idx ++ ;
		e[idx] = a, f[idx] = 0, w[idx] = -d, ne[idx] = h[b], h[b] = idx ++ ;
	}

	bool spfa() {
		T inf = numeric_limits<T>::max() / 2;
		for (int i = 1; i <= vtot; i++) {
			d[i] = inf;
			vis[i] = false;
			pre[i] = -1;
		}
		d[s] = 0;
		vis[s] = true;
		queue<int> q;
		q.push(s);
		while (!q.empty()) {
			int u = q.front();
			q.pop();
			vis[u] = false;
			for(int i=h[u]; ~i; i=ne[i]) {
				int v = e[i];
				if (f[i] && d[v] > d[u] + w[i]) {
					d[v] = d[u] + w[i];
					pre[v] = i;
					if (!vis[v]) {
						vis[v] = 1;
						q.push(v);
					}
				}
			}
		}
		return d[t] < 0;
	}

	void augment() {
		int u = t;
		T q = numeric_limits<T>::max();
		while (~pre[u]) {
			q = min(q, f[pre[u]]);
			u = e[pre[u] ^ 1];
		}
		flow += q;
		cost += q * d[t];
		u = t;
		while (~pre[u]) {
			f[pre[u]] -= q;
			f[pre[u] ^ 1] += q;
			u = e[pre[u] ^ 1];
		}
	}

	pair<T, T> solve() {
		flow = 0;
		cost = 0;
		while (spfa()) augment();
		return {flow, cost};
	}
	void init(int s_, int t_, int vtot_) {
		s = s_;
		t = t_;
		vtot = vtot_;
		idx = 0;
		for (int i = 1; i <= vtot; i++) h[i] = -1;
	}
};

MinCostGraph<int> g;
int c0,d1,c1,d2,c2;
int s,t,ss;
int sum;
int inf=1ll*1<<30;
void solve() {
	cin>>n>>c0>>d1>>c1>>d2>>c2;
//	cout<<1ll*(1<<31);
	s=n*2+1,t=n*2+2;
	g.init(s,t,t);
	for(int i=1; i<=n; i++) {
		int x;
		cin>>x;
		sum+=x;
		g.add(s,2*i-1,inf,c0);
		g.add(2*i-1,2*i,x,-inf);
		if(i+1<=n) {
			g.add(2*i,2*(i+1),inf,0);
		} else g.add(2*i,t,inf,0);
		if (i+d1<= n) {
			g.add(2*i,2*(i+d1)-1,inf,c1);
		}
		if (i+d2<= n) {
			g.add(2*i,2*(i+d2)-1,inf,c2);
		}
	}
	int tt=g.solve().second;
	cout<<tt+sum*inf;

}

signed main() {
	IOS;
	int _=1;
	//cin>>_;
	while(_--) solve();
	return 0;
}