ZKW費用流

標籤：

bool spfa(){    for(int i=0;i<=T;i++)dis[i]=inf;    int head=0,tail=1;    dis[0]=0;q[0]=0;inq[0]=1;    while(head!=tail)    {        int now=q[head++];if(head==1601)head=0;        for(int i=last[now];i;i=e[i].next)            if(e[i].v&&e[i].c+dis[now]<dis[e[i].to])            {                dis[e[i].to]=e[i].c+dis[now];                from[e[i].to]=i;                if(!inq[e[i].to])                {                    inq[e[i].to]=1;                    if(dis[e[i].to]<dis[q[head]])                    {                        head--;if(head==-1)head=1600;                        q[head]=e[i].to;                    }                    else                    {                        q[tail++]=e[i].to;                        if(tail==1601)tail=0;                    }                }            }        inq[now]=0;    }    if(dis[T]==inf)return 0;    return 1;}void mcf(){    int x=inf;    for(int i=from[T];i;i=from[e[i].from])        x=min(e[i].v,x);    for(int i=from[T];i;i=from[e[i].from])    {        ans+=x*e[i].c;        e[i].v-=x;e[i^1].v+=x;    }}zkw費用流C++bool spfa(){    memset(mark,0,sizeof(mark));    for(int i=0;i<=T;i++)d[i]=-1;    int head=0,tail=1;    q[0]=T;mark[T]=1;d[T]=0;    while(head!=tail)    {        int now=q[head];head++;if(head==605)head=0;        for(int i=last[now];i;i=e[i].next)            if(e[i^1].v&&d[now]+e[i^1].c>d[e[i].to])            {                d[e[i].to]=d[now]+e[i^1].c;                if(!mark[e[i].to])                {                    mark[e[i].to]=1;                    q[tail++]=e[i].to;                    if(tail==605)tail=0;                }            }        mark[now]=0;    }    return d[0]!=-1;}int dfs(int x,int f){    mark[x]=1;    if(x==T)return f;    int w,used=0;    for(int i=last[x];i;i=e[i].next)        if(d[e[i].to]==d[x]-e[i].c&&e[i].v&&!mark[e[i].to])        {            w=f-used;            w=dfs(e[i].to,min(w,e[i].v));            ans+=w*e[i].c;            e[i].v-=w;e[i^1].v+=w;            used+=w;if(used==f)return f;        }    return used;}void zkw(){    while(spfa())    {        mark[T]=1;        while(mark[T])        {            memset(mark,0,sizeof(mark));            dfs(0,inf);        }    }}12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152    bool spfa(){    memset(mark,0,sizeof(mark));    for(int i=0;i<=T;i++)d[i]=-1;    int head=0,tail=1;    q[0]=T;mark[T]=1;d[T]=0;    while(head!=tail)    {        int now=q[head];head++;if(head==605)head=0;        for(int i=last[now];i;i=e[i].next)            if(e[i^1].v&&d[now]+e[i^1].c>d[e[i].to])            {                d[e[i].to]=d[now]+e[i^1].c;                if(!mark[e[i].to])                {                    mark[e[i].to]=1;                    q[tail++]=e[i].to;                    if(tail==605)tail=0;                }            }        mark[now]=0;    }    return d[0]!=-1;}int dfs(int x,int f){    mark[x]=1;    if(x==T)return f;    int w,used=0;    for(int i=last[x];i;i=e[i].next)        if(d[e[i].to]==d[x]-e[i].c&&e[i].v&&!mark[e[i].to])        {            w=f-used;            w=dfs(e[i].to,min(w,e[i].v));            ans+=w*e[i].c;            e[i].v-=w;e[i^1].v+=w;            used+=w;if(used==f)return f;        }    return used;}void zkw(){    while(spfa())    {        mark[T]=1;        while(mark[T])        {            memset(mark,0,sizeof(mark));            dfs(0,inf);        }    }}

 

ZKW費用流