bzoj2574 [Poi1999]Store-Keeper（bfs+点双）

和bzoj5138基本一样qaq

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 110
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,m,Q,id[N][N],h[N*N],num=0,f[N][N][4],owo=0,sx,sy,bx,by,tx,ty;
int dx[]={0,-1,1,0},dy[]={-1,0,0,1};//0--往左推,1--上,2--下,3--右
char s[N];bool vis[N][N];
int dfn[N*N],low[N*N],dfnum=0,bel[N*N],ofo=0,fa[N*N];
struct edge{
    int to,next;
}data[N*N*4];
struct Icefox{
    int x,y,op;
    Icefox(int _x,int _y,int _op=0){x=_x;y=_y;op=_op;}
};
inline void add(int x,int y){
    data[++num].to=y;data[num].next=h[x];h[x]=num;
    data[++num].to=x;data[num].next=h[y];h[y]=num;
}stack<int>qq;
inline void tarjan(int x,int Fa){
    dfn[x]=low[x]=++dfnum;qq.push(x);
    for(int i=h[x];i;i=data[i].next){
        int y=data[i].to;if(y==Fa) continue;
        if(!dfn[y]){
            tarjan(y,x);low[x]=min(low[x],low[y]);
            if(low[y]<dfn[x]) continue;++ofo;fa[ofo]=x;
            while(1){
                int z=qq.top();qq.pop();bel[z]=ofo;
                if(z==y) break;
            }continue;
        }low[x]=min(low[x],dfn[y]);
    }
}
inline bool jud(int x,int y){
    return bel[x]==bel[y]||fa[bel[x]]==y||fa[bel[y]]==x;
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();m=read();
    for(int i=1;i<=n;++i){
        scanf("%s",s+1);
        for(int j=1;j<=m;++j){
            if(s[j]=='S') continue;id[i][j]=++owo;
            if(s[j]=='M') sx=i,sy=j;
            if(s[j]=='P') bx=i,by=j;
            if(s[j]=='K') tx=i,ty=j;
            for(int k=0;k<2;++k){
                int x=i+dx[k],y=j+dy[k];
                if(x<1||x>n||y<1||y>m||!id[x][y]) continue;
                add(id[i][j],id[x][y]);
            }
        }
    }for(int i=1;i<=owo;++i) if(!dfn[i]) tarjan(i,0);
    memset(f,-1,sizeof(f));
    queue<Icefox>q;q.push(Icefox(sx,sy));vis[sx][sy]=1;
    while(!q.empty()){
        int x=q.front().x,y=q.front().y;q.pop();
        for(int i=0;i<4;++i){
            int xx=x+dx[i],yy=y+dy[i];
            if(xx<1||xx>n||yy<1||yy>m||!id[xx][yy]) continue;
            if(vis[xx][yy]||xx==bx&&yy==by) continue;
            vis[xx][yy]=1;q.push(Icefox(xx,yy));
        }
    }for(int i=0;i<4;++i){
        int x=bx+dx[i],y=by+dy[i];
        if(x<1||x>n||y<1||y>m||!vis[x][y]) continue;
        f[bx][by][i]=0;q.push(Icefox(bx,by,i));
    }
    while(!q.empty()){
        int x=q.front().x,y=q.front().y,op=q.front().op;q.pop();
        if(x==tx&&y==ty){printf("%d\n",f[x][y][op]);return 0;}
        int xx=x+dx[3-op],yy=y+dy[3-op];
        if(xx>=1&&xx<=n&&yy>=1&&yy<=m&&id[xx][yy]&&f[xx][yy][op]==-1)
            f[xx][yy][op]=f[x][y][op]+1,q.push(Icefox(xx,yy,op));
        for(int i=0;i<4;++i){
            if(f[x][y][i]!=-1) continue;
            xx=x+dx[i];yy=y+dy[i];if(!id[xx][yy]) continue;
            if(!jud(id[xx][yy],id[x+dx[op]][y+dy[op]])) continue;
            f[x][y][i]=f[x][y][op];q.push(Icefox(x,y,i));
        }
    }puts("NO");
    return 0;
}