bzoj4997 [Usaco2017 Feb]Why Did the Cow Cross the Road III（bfs）

枚举每一个起点，bfs能访问到几头牛即可。复杂度$O(n^3)$

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <utility>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 110
#define pa pair<int,int>
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return x*f;
}
int n,K,m,a[N][N],dx[]={0,0,1,-1},dy[]={1,-1,0,0},ans=0;
bool f[N][N][4],vis[N][N];
struct P{
    int x,y;
}st[N];
inline int bfs(int id){
    queue<pa>q;memset(vis,0,sizeof(vis));int res=0;
    q.push(make_pair(st[id].x,st[id].y));vis[st[id].x][st[id].y]=1;
    while(!q.empty()){
        int x=q.front().first,y=q.front().second;q.pop();res+=a[x][y];
        for(int k=0;k<4;++k){
            if(f[x][y][k]) continue;
            int xx=x+dx[k],yy=y+dy[k];
            if(xx<1||xx>n||yy<1||yy>n||vis[xx][yy]) continue;
            q.push(make_pair(xx,yy));vis[xx][yy]=1;
        }
    }return res;
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();K=read();m=read();
    while(m--){
        int x=read(),y=read(),x1=read(),y1=read();
        if(x>x1) swap(x,x1);if(y>y1) swap(y,y1);
        if(x==x1){f[x][y][0]=1;f[x][y1][1]=1;}
        else f[x][y][2]=1,f[x1][y][3]=1;
    }for(int i=1;i<=K;++i) st[i].x=read(),st[i].y=read(),a[st[i].x][st[i].y]=1;
    for(int i=1;i<=K;++i) ans+=K-bfs(i);
    printf("%d\n",ans>>1);
    return 0;
}