Submission #3402039

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define int long long

#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define rrep(i,s,n) for(int i = (n)-1;i>=(s);i--)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
typedef pair<pint,int> P1;
typedef pair<int,pint> P2;
static const ll maxLL = (ll)1 << 62;
const ll MOD=1000000007;
const ll INF=1e18;
int dy[]={-1,0,1,0};
int dx[]={0,1,0,-1};

int sx,sy,gx,gy,h,w,t;
char m[10][10];
int d[10][10];

int bfs(int x){
    rep(i,0,h)rep(j,0,w)d[i][j]=INF;
    
    queue<pint> que;
    que.push(pint(sy,sx));
    d[sy][sx]=0;
    while(!que.empty()){
        pint p=que.front();que.pop();
        rep(i,0,4){
            int ny=p.fi+dy[i];
            int nx=p.se+dx[i];
            int ss;
            if(m[ny][nx]=='#')ss=x;
            else ss=1;
            if(d[ny][nx]>ss+d[p.fi][p.se]&&0<=nx&&nx<w&&0<=ny&&ny<h){
                d[ny][nx]=ss+d[p.fi][p.se];
                que.push(pint(ny,nx));
            }
        }
    }
    return t>=d[gy][gx];
}


signed main(){
    cin.tie(0);
	ios::sync_with_stdio(false);
    cin>>h>>w>>t;
    string s;
    rep(i,0,h){
        rep(j,0,w){
            cin>>m[i][j];
        }
    }
    rep(i,0,h){
        rep(j,0,w){
            if(m[i][j]=='S'){
                sy=i;
                sx=j;
            }
            else if(m[i][j]=='G'){
                gy=i;
                gx=j;
            }
        }
    }
    int lo=1,hi=t,m;
    while(hi-lo>1){
        int m=(lo+hi)/2;
        if(bfs(m))lo=m;
        else hi=m;
    }
    cout<<lo<<endl;
    
    
    
    
    return 0;
}

Submission Info

Judge Result