bzoj1520 [POI2006]Szk-Schools（费用流）

裸的一个费用流。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 410
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,h[N],num=1,dis[N],path[N],T=401,mxflow=0,ans=0;
bool inq[N];
struct edge{
    int to,next,c,w;
}data[801000];
inline void add(int x,int y,int w,int c){
    data[++num].to=y;data[num].next=h[x];h[x]=num;data[num].w=w;data[num].c=c;
    data[++num].to=x;data[num].next=h[y];h[y]=num;data[num].w=0;data[num].c=-c;
}
inline bool spfa(){
    deque<int>q;memset(path,0,sizeof(path));memset(dis,inf,sizeof(dis));
    q.push_back(0);dis[0]=0;inq[0]=1;
    while(!q.empty()){
        int x=q.front();q.pop_front();inq[x]=0;
        for(int i=h[x];i;i=data[i].next){
            int y=data[i].to;if(!data[i].w) continue;
            if(dis[x]+data[i].c<dis[y]){
                dis[y]=dis[x]+data[i].c;path[y]=i;
                if(!inq[y]){
                    if(!q.empty()&&dis[y]<dis[q.front()]) q.push_front(y);
                    else q.push_back(y);inq[y]=1;
                }
            }
        }
    }return path[T];
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();
    for(int i=1;i<=n;++i){
        int x=read(),l=read(),r=read(),val=read();add(0,i,1,0);add(i+n,T,1,0);
        for(int j=l;j<=r;++j) add(i,j+n,1,abs(x-j)*val);
    }
    while(spfa()){
        int now=T,low=inf;
        while(path[now]) low=min(low,data[path[now]].w),now=data[path[now]^1].to;
        mxflow+=low;ans+=low*dis[T];now=T;
        while(path[now]) data[path[now]].w-=low,data[path[now]^1].w+=low,now=data[path[now]^1].to;
    }if(mxflow!=n) puts("NIE");
    else printf("%d\n",ans);
    return 0;
}