BZOJ 3550 Vacation 单纯形 费用流

单纯形 744ms AC

#include <cstdio>
#include <cmath>
const double eps = 1e-7;
const double inf = 1e30;
#define FOR(i,j,k) for(i=j;i<=k;i++)
int read() {
	int s=0,f=1;char ch=getchar();
	for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')f=-1;
	for(;'0'<=ch&&ch<='9';ch=getchar())s=s*10+ch-'0';
	return s*f;
}
template<int M, int N>
void pivot(double (&a)[M][N], double (&b)[M], double (&c)[N], int m, int n, int l, int e, int &v) {
	int i, j, k;
	b[l] /= a[l][e];
	FOR(i,1,n) if (i!=e) a[l][i]/=a[l][e];
	a[l][e]=1/a[l][e];
	FOR(i,1,m)if(i!=l&&fabs(a[i][e])>eps) {
		b[i]-=a[i][e]*b[l];
		FOR(j,1,n)if(j!=e)
			a[i][j]-=a[i][e]*a[l][j];
		a[i][e]=-a[i][e]*a[l][e];
	}
	v+=c[e]*b[l];
	FOR(i,1,n)if(i!=e)c[i]-=c[e]*a[l][i];
	c[e]=-c[e]*a[l][e];
}
template<int M, int N>
double simplex(double (&a)[M][N], double (&b)[M], double (&c)[N], int m, int n, int v) {
	int i,e;
	while (1) {
		FOR(i,1,n) if (c[i]>eps) break;
		if (i==n+1) return v;
		double t=inf,l;e=i;
		FOR(i,1,m)
			if(a[i][e]>eps&&t>b[i]/a[i][e])
				t=b[i]/a[i][e],l=i;
		if(t==inf) return inf;
		pivot(a, b, c, m, n, l, e, v);
	}
	return inf;
}
int main() {
	int i,j,x,y,z;
	const int M = 1201, N = 601;
	static double c[N], a[M][N], b[M];
	int n=read(),k=read(),m=0;
	FOR(i,1,3*n) c[i]=read();
	for(i=1;i+n-1<=3*n;i++) {
		b[++m]=k;
		FOR(j,i,i+n-1) a[m][j]=1;
	}
	FOR(i,1,3*n) b[++m]=a[m][i]=1;
	printf("%d",(int)(simplex(a,b,c,m,n*3,0)+0.5));
	return 0;
}

最大费用流 16ms AC

#include <cstdio>
#include <cstring>
#define FOR(i,j,k) for(i=j;i<=k;i++)
#define min(i,j) ((i)>(j)?(j):(i))
const int inf = 2147483647;
int read() {
    int s=0,f=1;char ch=getchar();
    for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')f=-1;
    for(;'0'<=ch&&ch<='9';ch=getchar())s=s*10+ch-'0';
    return s*f;
}
template<int N, int M>
class EdmondsKarp {
private:
    int h[N], v[M], w[M], p[M], c[M], cnt;
    int n, m, ans, s, t;
    int q[N*64], pre[N], dis[N];
    bool vis[M];
    bool spfa() {
        int i, f = 0, r = 0;
        for(i = 0; i <= n; i ++) {
            dis[i] = inf;
            vis[i] = 0;
        }
        dis[s] = 0, q[r++] = s, vis[s] = 1;
        pre[s] = pre[t] = -1;
        while (f < r) {
            int u = q[f++];
            for(i = h[u]; i != -1; i = p[i]) {
                if(w[i] && dis[v[i]] > dis[u] + c[i]){
                    dis[v[i]] = dis[u] + c[i];
                    pre[v[i]] = i^1;
                    if(!vis[v[i]]) {
                        vis[v[i]] = 1;
                        q[r++] = v[i];
                    }
                }
            }
            vis[u] = 0;
        }
        if(dis[t] == inf) return 0;
        return 1;
    }

    void end() {
        int u, sum = inf;
        for(u = pre[t]; u >= 0; u = pre[v[u]]) {
            sum = min(sum, w[u^1]);
        }
        for(u = pre[t]; u >= 0; u = pre[v[u]]) {
            w[u] += sum;
            w[u^1] -= sum;
            ans += sum * c[u^1];
        }
    }
public:
    void init(int o, int a, int b) {
        n = o, s = a, t = b, cnt = 0;
        memset(h,-1,sizeof(h));
    }

    void add(int x, int y, int ca, int co) {
        v[cnt] = y, w[cnt] = ca, c[cnt] = co, p[cnt] = h[x], h[x] = cnt++;
        v[cnt] = x, w[cnt] = 0, c[cnt] = -co, p[cnt] = h[y], h[y] = cnt++;
    }

    int run() {
        ans = 0;
        while(spfa()) end();
        return ans;
    }
};

int main() {
    const int N = 1201;
    static EdmondsKarp<N,40001> g;
    static int c[N];
    int n=read(),k=read(),ss=0,s=1,t=2*n+2,tt=t+1,i;
    FOR(i,1,3*n)c[i]=read();
    g.init(tt,ss,tt);
    g.add(ss,s,k,0); g.add(t,tt,k,0);
    FOR(i,1,n) g.add(s,i+1,1,-c[i]);
    FOR(i,n+1,2*n) g.add(i-n+1,i+1,1,-c[i]);
    FOR(i,n+1,2*n) g.add(i+1,t,1,-c[n+i]);
    FOR(i,s,t) g.add(i-1,i,k,0);
    printf("%d",-g.run());
    return 0;
}