洛谷$P$2472 蜥蜴 $[SCOI2007]$ 网络流

最新推荐文章于 2022-09-01 16:33:37 发布

「已注销」

最新推荐文章于 2022-09-01 16:33:37 发布

阅读量109

点赞数

本文链接：https://blog.csdn.net/qq_42692055/article/details/108634383

版权

正解:网络流

解题报告:

传送门!

$umm$一看就是个最大流呗,,,就直接考虑怎么建图趴$QwQ$

首先看到这个高度减小其实就相当于对这个点的次数有约束,就显然拆点呗,流量为高度

然后$S$连向左侧所有有蜥蜴的点,流量为1.右侧所有边界点连向$T$,流量为$inf$.

然后就做完了?$QwQ$.

#include<bits/stdc++.h>
using namespace std;
#define il inline
#define gc getchar()
#define t(i) edge[i].to
#define n(i) edge[i].nxt
#define w(i) edge[i].wei
#define ri register int
#define rb register bool
#define rc register char
#define rp(i,x,y) for(ri i=x;i<=y;++i)
#define e(i,x) for(ri i=head[x];~i;i=n(i))

const int N=10000+10,inf=1e9,M=50;
int n,m,d,S,T,ed_cnt=-1,head[N],as,cur[N],dep[N],sz,cnt,hei[M][M];
char s[N];
struct ed{int to,nxt,wei;}edge[N<<2];

il int read()
{
    rc ch=gc;ri x=0;rb y=1;
    while(ch!='-' && (ch>'9' || ch<'0'))ch=gc;
    if(ch=='-')ch=gc,y=0;
    while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^'0'),ch=gc;
    return y?x:-x;
}
il int nam(ri x,ri y){return (x-1)*m+y;}
il void ad(ri x,ri y,ri z){/*printf("%d -> %d : %d\n",y,x,z);*/edge[++ed_cnt]=(ed){x,head[y],z};head[y]=ed_cnt;edge[++ed_cnt]=(ed){y,head[x],0};head[x]=ed_cnt;}
il bool bfs()
{
    queue<int>Q;Q.push(S);memset(dep,0,sizeof(dep));dep[S]=1;
    while(!Q.empty()){ri nw=Q.front();Q.pop();e(i,nw)if(w(i) && !dep[t(i)])dep[t(i)]=dep[nw]+1,Q.push(t(i));}
    return dep[T];
}
il int dfs(ri nw,ri flow)
{
    if(nw==T || !flow)return flow;ri ret=0;
    for(ri &i=cur[nw];~i;i=n(i))
        if(w(i) && dep[t(i)]==dep[nw]+1){ri tmp=dfs(t(i),min(flow,w(i)));ret+=tmp,w(i)-=tmp;w(i^1)+=tmp,flow-=tmp;}
    return ret;
}
il int dinic(){ri ret=0;while(bfs()){rp(i,S,T)cur[i]=head[i];while(int d=dfs(S,inf))ret+=d;}return ret;}

int main()
{
//    freopen("2472.in","r",stdin);freopen("2472.out","w",stdout);
    memset(head,-1,sizeof(head));n=read();m=read();d=read();sz=n*m;S=0;T=2*sz+1;
    rp(i,1,n){scanf("%s",s+1);rp(j,1,m){hei[i][j]=s[j]^'0';if(!hei[i][j])continue;ri pos=nam(i,j);ad(n*m+pos,pos,hei[i][j]);}}
    rp(i,1,n){scanf("%s",s+1);rp(j,1,m)if(s[j]=='L')ad(nam(i,j),S,1),++cnt;}
    rp(i,1,n)
    {
        rp(j,1,m)
        {
            if(!hei[i][j])continue;
            bool gdgs=0;
            rp(p,-d,d)
            {
                rp(q,abs(p)-d,d-abs(p))
                {
                    ri to_x=i+p,to_y=j+q;
                    if(to_x>0 && to_y>0 && to_x<=n && to_y<=m)ad(nam(to_x,to_y),sz+nam(i,j),inf);
                    else gdgs=1;
                }
            }
            if(gdgs)ad(T,sz+nam(i,j),inf);
        }
    }
    printf("%d\n",cnt-dinic());
    return 0;
}

View Code