Description
一个餐厅在相继的N天里,第i天需要Ri块餐巾(i=l,2,…,N)。餐厅可以从三种途径获得餐巾。
(1)购买新的餐巾,每块需p分;
(2)把用过的餐巾送到快洗部,洗一块需m天,费用需f分(f
Solution
天数建图不好搞,那么考虑在餐巾纸上做文章
把餐巾纸分成用过的n天和没用过的n天,那么买新的相当于从源点连到新餐巾,留到下一天相当于连到下一天的点,快洗和慢洗分别同理,源点汇点分别连容量为r费用为0的,那么就是裸的费用流了
实测发现spfa的费用流卡不过去,slf优化仍然T两个点,反向弧随用随加T一个。请教了一波学会了新的姿势
zkw费用流适用于二分图匹配这样的稠密图。与sap类似的,我们每次通过修改距离使得至少多出一条通往终点的增广路,然后就莫名其妙快了20倍左右
Code
#include <stdio.h>
#include <string.h>
#define rep(i, st, ed) for (int i = st; i <= ed; i += 1)
#define erg(i, st) for (int i = ls[st]; i; i = e[i].next)
#define fill(x, t) memset(x, t, sizeof(x))
#define min(x, y) (x)<(y)?(x):(y)
#define ll long long
#define INF 0x3f3f3f3f
#define N 4001
#define E N * 21 + 1
struct edge{int x, y, w, c, next;}e[E];
inline int read(){
char ch = getchar(); int x = 0;
while (ch > '9' || ch < '0'){
ch = getchar();
}
while (ch <= '9' && ch >= '0'){
x = (x << 1) + (x << 3) + ch - '0';
ch = getchar();
}
return x;
}
int ls[N];
inline void addEdge(int &cnt, int x, int y, int w, int c){
cnt += 1; e[cnt] = (edge){x, y, w, c, ls[x]}; ls[x] = cnt;
cnt += 1; e[cnt] = (edge){y, x, 0, -c, ls[y]}; ls[y] = cnt;
}
int vis[N], dis[N];
ll ans;
inline int find(int now, int ed, int mn){
if (now == ed || !mn){
return mn;
}
int ret = 0;
vis[now] = 1;
erg(i, now){
if (e[i].w > 0 && dis[e[i].y] + e[i].c == dis[now] && !vis[e[i].y]){
int d = find(e[i].y, ed, min(mn - ret, e[i].w));
ans += d * e[i].c;
e[i].w -= d;
e[i ^ 1].w += d;
ret += d;
if (ret == mn){
break;
}
}
}
return ret;
}
inline int modify(int st, int ed){
int mn = INF, inf = INF;
rep(now, st, ed){
if (vis[now]){
erg(i, now){
if (!vis[e[i].y] && e[i].w > 0){
mn = min(mn, -dis[now] + e[i].c + dis[e[i].y]);
}
}
}
}
if (mn == inf){
return 0;
}
rep(i, st, ed){
if (vis[i]){
dis[i] += mn;
}
}
return 1;
}
inline void zkw(int st, int ed){
do{
rep(i, st, ed){
vis[i] = 0;
}
while (find(st, ed, INF)){
rep(i, st, ed){
vis[i] = 0;
}
}
} while (modify(st, ed));
}
int main(void){
int n = read();
int st = 0, ed = n * 2 + 1;
int edgeCnt = 1;
rep(i, 1, n){
int r = read();
addEdge(edgeCnt, st, i, r, 0);
addEdge(edgeCnt, i + n, ed, r, 0);
}
int ap = read(), am = read(), af = read(), an = read(), as = read();
rep(i, 1, n){
addEdge(edgeCnt, st, i + n, INF, ap);
if (i < n){
addEdge(edgeCnt, i, i + 1, INF, 0);
}
if (i + am <= n){
addEdge(edgeCnt, i, i + n + am, INF, af);
}
if (i + an <= n){
addEdge(edgeCnt, i, i + n + an, INF, as);
}
}
ans = 0;
zkw(st, ed);
printf("%lld\n", ans);
return 0;
}