View Code int dist[N<<1],mx[N],my[N],m,n;vector<int> map[N];int que[N<<1],head,tail;int bfs(){ int i; head=0;tail=-1; for(i=1;i<=n;i++) if(mx[i]==-1) que[++tail]=i; for(i=0;i<=m+n;i++) dist[i]=0; int flag=0; while(head<=tail) { int u=que[head++]... Read More
