2879: [Noi2012]美食节

实际上这题是SCOI2008修车的强化版.
这题只用注意一个 地方： spfa一定要入出队优化…不然稳t…
C++代码如下：

#include<bits/stdc++.h>
#define rep(i,x,y) for(register int i = x; i <= y; ++ i )
#define repd(i,x,y) for(register int i = x; i >= y; -- i )
using namespace std;
typedef long long ll;
template<typename T>inline bool chkmin(T&x,T y) { return x > y ? x = y,1 : 0; }
template<typename T>inline void read(T&x)
{
    char c;int sign = 1;x = 0;
    do { c = getchar(); if(c == '-') sign = -1; }while(!isdigit(c));
    do { x = x * 10 + c - '0'; c = getchar(); }while(isdigit(c));
    x *= sign;
}

const int N = 1e5+50,P = 101,M = 5e6 + 200;
int head[N],nxt[M],to[M],w[M],f[M],tot;
int s,t,n,m,sum,cnt,ans,p[P],val[P][P];

inline void add(int x,int y,int flow,int val = 0)
{
    nxt[tot] = head[x];
    to[tot] = y;
    f[tot] = flow;
    w[tot] = val;
    head[x] = tot++;
}

int from[N],d[N];
int q[M],st,en;
bool inq[N];

inline bool bfs()
{
    memset(d,0x3f,sizeof d);
    d[s] = 0;
    q[st = en = 0] = s;
    while(st <= en)
    {
        int x = q[st++]; inq[x] = 0;
        for(register int i = head[x];~i;i=nxt[i])
            if(f[i] && chkmin(d[to[i]],d[x] + w[i]))
            {
                from[to[i]] = i;
                if(!inq[to[i]]) inq[to[i]] = 1,
                    q[++en] = to[i];
            }
    }
    return d[t] < 0x3f3f3f3f;
}

inline int get()
{
    int ans = 0,flow = 0x3f3f3f3f;
    for(int i = from[t];~i;i = from[to[i^1]])
        flow = min(flow,f[i]);
    for(int i = from[t];~i;i = from[to[i^1]])
        f[i] -= flow,f[i^1] += flow,ans += flow * w[i];
    return ans;
}

int main()
{
    memset(head,-1,sizeof head);
    read(n); read(m);
    rep(i,1,n)
    {
        read(p[i]);
        sum += p[i];
    }

    rep(i,1,n) rep(j,1,m) read(val[i][j]);

    rep(i,1,n) add(s,i,p[i]),add(i,s,0);    

    t = (m + 1) * sum + 1 + n;

    rep(i,1,m) add(i + n,t,1),add(t,i + n,0);
    rep(i,1,n) rep(j,1,m)
        add(i,j + n,1,val[i][j]),
        add(j + n,i,0,-val[i][j]),

    from[s] = -1;
    while(bfs())
    {
        ans += get();
        int x = (to[from[t]^1] - n) % m,y = to[from[t]^1]+m,num = ((y-n - 1)/m)+1;
        if(!x) x = m;
        add(y,t,1); add(t,y,0);
        rep(i,1,n) add(i,y,1,val[i][x]*num),add(y,i,0,-val[i][x]*num);

    } 
    cout << ans << endl;
    return 0;
}