P3440 [POI2006]SZK-Schools

裸的费用流
QWQ

#include <cstdio>
#include <iostream>
#include <cstring>
#include <queue>
#define il inline
using namespace std;
const int inf=0x7fffffff;
const int maxm=110000;
int head[maxm],to[maxm*2],cap[maxm*2],net[maxm*2],cost[maxm*2];
int sum[maxm];
int cnt=1;
il void add(int x,int y,int c,int z){cnt++,to[cnt]=y,cost[cnt]=z,cap[cnt]=c,net[cnt]=head[x],head[x]=cnt;}
int flow[maxm],pre[maxm],id[maxm],dis[maxm],max_flow,min_cost;
bool vis[maxm];
queue <int> dl;
struct node{
    int x,y,cap,w;
}a[maxm];
il bool BFS(int s,int t)
{
    while(!dl.empty()) dl.pop();
    memset(pre,-1,sizeof(pre));
    memset(dis,127/3,sizeof(dis));
    dis[s]=0,flow[s]=inf,pre[s]=0,vis[s]=1;
    dl.push(s);
    while(!dl.empty())
    {
        int x=dl.front();
        dl.pop();
        vis[x]=0;
        for(int i=head[x];i;i=net[i])
        {
           int tmp=to[i];
           if(cap[i]>0&&dis[tmp]>dis[x]+cost[i])
           {
              dis[tmp]=dis[x]+cost[i];
              pre[tmp]=x;
              id[tmp]=i;
              flow[tmp]=min(flow[x],cap[i]);
              if(!vis[tmp]) vis[tmp]=1,dl.push(tmp);
           }
        }
    }
    return pre[t]==-1?0:1;
}
il void change_cap(int s,int t,int x)
{
    int now=t;
    while(now!=s)
    {
        cap[id[now]]-=x,cap[id[now]^1]+=x;
        now=pre[now];
    }
}
void il get_ans(int s,int t)
{
    max_flow=0,min_cost=0;
    while(BFS(s,t))
    {
        //printf("%d\n",flow[t]);
        max_flow+=flow[t],min_cost+=dis[t]*flow[t];
        change_cap(s,t,flow[t]);
    }
}
il void adx(int x,int y,int cax,int c)
{
    add(x,y,cax,c),add(y,x,0,-c);
}
il int abs(int x)
{
    if(x<0) x=-x;
    return x;
}
int main()
{
   int n;
   scanf("%d",&n);
   int s=0,t=1000;
   for(int i=1;i<=n;i++)
   {
      int past,l,r,mc;
      scanf("%d%d%d%d",&past,&l,&r,&mc);
      //sum[past]++;
      for(int j=l;j<=r;j++)
       //if(j!=past)
       adx(i,j+n,1,mc*abs(past-j));     
      //adx(past,past+n,1,0);
      adx(s,i,1,0);
      adx(i+n,t,1,0);
   }
   /*for(int i=1;i<=n;i++)
    if(sum[i]) adx(s,i,sum[i],0);*/
   get_ans(s,t);
   max_flow==n?printf("%d\n",min_cost):printf("NIE\n");
   return 0;
}