【bzoj 3630】: [JLOI2014]镜面通道

来源：互联网发布：微信聊天数据迁移编辑：程序博客网时间：2024/05/17 05:50
http://www.lydsy.com/JudgeOnline/problem.php?id=3630
通风则通光，于是最小割
打死我也没想到一直wa的原因是S和T的编号设错了。。。。。！！！！！
//#define _TEST _TEST#include <cstdio>#include <cstring>#include <cstdlib>#include <iostream>#include <cmath>#include <algorithm>using namespace std;/************************************************Code By willinglive    Blog:http://willinglive.cf************************************************/#define rep(i,l,r) for(int i=(l),___t=(r);i<=___t;i++)#define per(i,r,l) for(int i=(r),___t=(l);i>=___t;i--)#define MS(arr,x) memset(arr,x,sizeof(arr))#define LL long long#define INE(i,u,e) for(int i=head[u];~i;i=e[i].next)inline const int read(){int r=0,k=1;char c=getchar();for(;c<'0'||c>'9';c=getchar())if(c=='-')k=-1;for(;c>='0'&&c<='9';c=getchar())r=r*10+c-'0';return k*r;}/////////////////////////////////////////////////const int inf=0x3f3f3f3f;int x,y,n;struct object{int type,x1,y1,x2,y2,r;}a[333];int S,T;struct edge{int v,flow,cap,next;}e[200000];int head[666],k;int q[666],d[666],cur[666];/////////////////////////////////////////////////int sqr(int x){return x*x;}double dis(int x1,int y1,int x2,int y2){return sqrt(sqr(x1-x2)+sqr(y1-y2));}bool cross(int p,int q){if(a[p].type==2&&a[q].type==1){int x1=a[p].x1,y1=a[p].y1,x2=a[p].x2,y2=a[p].y2;int x=a[q].x1,y=a[q].y1,r=a[q].r;if(dis(x1,y1,x,y)<=r || dis(x2,y1,x,y)<=r || dis(x1,y2,x,y)<=r || dis(x2,y2,x,y)<=r) return 1;if(x1<=x && x2>=x && (abs(y1-y)<=r || abs(y2-y)<=r)) return 1;if(y1<=y && y2>=y && (abs(x1-x)<=r || abs(x2-x)<=r)) return 1;return 0;}else if(a[p].type==1&&a[q].type==1){return dis(a[p].x1,a[p].y1,a[q].x1,a[q].y1)<=a[p].r+a[q].r;}else if(a[p].type==2&&a[q].type==2){return max(a[p].x1,a[q].x1)<=min(a[p].x2,a[q].x2) && max(a[p].y1,a[q].y1)<=min(a[p].y2,a[q].y2);}else return cross(q,p);}inline void adde(int u,int v,int f){e[k].v=v;e[k].cap=f;e[k].flow=0;e[k].next=head[u];head[u]=k++;}inline void ins(int u,int v,int f1,int f2){adde(u,v,f1);adde(v,u,f2);}int F(int i){return e[i].cap-e[i].flow;}bool bfs(){MS(d,-1); d[q[0]=S]=0; memcpy(cur,head,sizeof(cur));for(int l=0,r=1,u,v;l<r;){u=q[l++];INE(i,u,e) if(F(i)&&d[v=e[i].v]<0){q[r++]=v; d[v]=d[u]+1;if(v==T) return 1;}}return 0;}int dfs(int u,int a){if(u==T) return a;for(int &i=cur[u];~i;i=e[i].next) if(F(i)&&d[e[i].v]==d[u]+1)    if(int t=dfs(e[i].v,min(a,F(i))))        return e[i].flow+=t,e[i^1].flow-=t,t;return 0;}int dinic(){int f=0;while(bfs()) while(int t=dfs(S,inf)) f+=t;return f;}/////////////////////////////////////////////////void input(){MS(head,-1);    x=read(); y=read(); n=read();    S=0; T=1;    rep(i,1,n)    {    if(read()==1)    {    a[i].type=1; a[i].x1=read(); a[i].y1=read(); a[i].r=read();    }    else    {    a[i].type=2; a[i].x1=read(); a[i].y1=read(); a[i].x2=read(); a[i].y2=read();    }    rep(j,1,i-1)    {    if(cross(i,j)) ins(i<<1|1,j<<1,inf,0), ins(j<<1|1,i<<1,inf,0);    }    if(a[i].type==1)    {    if(a[i].y1-a[i].r<=0) ins(S,i<<1,inf,0);    if(a[i].y1+a[i].r>=y) ins(i<<1|1,T,inf,0);    }    else    {    if(a[i].y1<=0) ins(S,i<<1,inf,0);    if(a[i].y2>=y) ins(i<<1|1,T,inf,0);    }    ins(i<<1,i<<1|1,1,inf);    }}void solve(){printf("%d\n",dinic());}/////////////////////////////////////////////////int main(){    #ifndef _TEST    freopen("std.in","r",stdin); freopen("std.out","w",stdout);    #endif    input(),solve();    return 0;}
0 0