H. Safe Path

http://codeforces.com/gym/101755/problem/H

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=2e5+9;
const int mod=1e9+7;

int n,m,d;
char mp[maxn];
bool disable[maxn],vis[maxn];

int ID(int x,int y)
{
    return (x-1)*m+y;
}

struct node
{
    int x,y;
    int step;
    node(int _x,int _y,int _step)
    {
        x=_x;
        y=_y;
        step=_step;
    }
};

int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};

bool ch(int x,int y)
{
    if(disable[ID(x,y)]) return 0;
    if(x<1||x>n||y<1||y>m) return 0;
    return 1;
}
bool ch2(int x,int y)
{
    if(disable[ID(x,y)]||vis[ID(x,y)]) return 0;
    if(x<1||x>n||y<1||y>m) return 0;
    return 1;
}
void bfs()
{
    queue<node>q;

    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(mp[ID(i,j)]=='M')
            {
                q.push(node(i,j,0));
                disable[ID(i,j)]=1;
            }
        }
    }

    while(!q.empty())
    {
        node tmp=q.front();
        q.pop();

        int x=tmp.x;
        int y=tmp.y;
        int step=tmp.step;

        for(int i=0;i<4;i++)
        {
            int tx=x+dx[i];
            int ty=y+dy[i];

            if(ch(tx,ty)&&step<d)
            {
                disable[ID(tx,ty)]=1;
                q.push(node(tx,ty,step+1));
            }
        }
    }

    while(!q.empty()) q.pop();

//    for(int i=1;i<=n;i++)
//    {
//        for(int j=1;j<=m;j++)
//        {
//            cout<<disable[ID(i,j)];
//        }
//        cout<<endl;
//    }
}
void bfs2()
{
    queue<node>q;

    int ed=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(disable[ID(i,j)]) continue;
            if(mp[ID(i,j)]=='S')
            {
                vis[ID(i,j)]=1;
                q.push(node(i,j,0));
            }
            else if(mp[ID(i,j)]=='F')
            {
                ed=ID(i,j);
            }
        }
    }

    int ans=-1;
    while(!q.empty())
    {
        node tmp=q.front();
        q.pop();

        int x=tmp.x;
        int y=tmp.y;
        int step=tmp.step;

        //cout<<x<<" "<<y<<endl;

        if(ID(x,y)==ed)
        {
            ans=step;
            break;
        }

        for(int i=0;i<4;i++)
        {
            int tx=x+dx[i];
            int ty=y+dy[i];

            if(ch2(tx,ty))
            {
                vis[ID(tx,ty)]=1;
                q.push(node(tx,ty,step+1));
            }
        }
    }

    while(!q.empty()) q.pop();

    printf("%d\n",ans);
}
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);


    while(~scanf("%d%d%d",&n,&m,&d))
    {
        mem(disable,0);
        mem(vis,0);
        for(int i=1;i<=n;i++)
        {
            scanf("%s",mp+(i-1)*m+1);
        }

//        for(int i=1;i<=n;i++)
//        {
//            for(int j=1;j<=m;j++)
//            {
//                printf("%c",mp[ID(i,j)]);
//            }
//            printf("\n");
//        }

        bfs();
        bfs2();

    }

    return 0;
}