Submission #18757

---

Source Code Expand

// compile with "g++ XXX.cc -mno-cygwin -O2" in Cygwin

#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>
#include<bitset>
#include<cassert>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define FOR3(i,a,b) for(int i=a,i##_end=b;i<i##_end;i++)
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define CLS(x,val) memset((x) , val , sizeof(x)) 
typedef long long ll_t;
typedef long double ld_t;
typedef vector<int> VI; 
typedef vector<VI> VVI;
typedef complex<int> xy_t;

template<typename T> void debug(T v , string delimiter = "\n")
{ for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++) cout << *it << delimiter; cout << flush ;}

int dx[]  = {0,1,0,-1};
int dy[]  = {1,0,-1,0};
string ds = "SENW";

const double PI = 4.0*atan(1.0);

struct data{
  int row,col;
  int step;
};

bool visited[555][555];

int main() {
  int N,M;
  cin>>N>>M;
  vector<string> dat(N);
  FOR(i,N) cin>>dat[i];
  long double lower = 0 , upper = 100;
  int srow , scol , grow , gcol;
  FOR(i,N) FOR(j,M){
    if(dat[i][j]=='s') { srow = i ; scol = j; }
    if(dat[i][j]=='g') { grow = i ; gcol = j; }
  }
  bool kaiari = false;
  FOR(_,120){
    long double p = (lower + upper) / 2.0;
    queue<data> qu;
    qu.push((data){srow , scol , 0});
    memset(visited , 0 , sizeof(visited));
    bool ok = false;
    while(!qu.empty()){
      data now = qu.front() ;qu.pop();
      char c = dat[now.row][now.col];
      if(c != 's' && c != 'g'){
        assert(isdigit(c));
        long double hiatari = (c - '0') * pow(0.99L , now.step);
        if(hiatari < p) continue;
      }
      if(c == 'g'){
        kaiari = true;
        ok = true; break;
      }
      if(visited[now.row][now.col]) continue;
      visited[now.row][now.col] = true;
      FOR(k,4){
        int nrow = now.row + dy[k];
        int ncol = now.col + dx[k];
        if(BET(0,nrow,N) && BET(0,ncol,M) && dat[nrow][ncol] != '#'){
          qu.push((data){nrow , ncol, now.step+1});
        }
      }
    }
    if(ok) lower = p ;
    else upper = p;
  }
  if(kaiari){
    printf("%.20f\n", (double)lower);
  }else{
    puts("-1");
  }
  return 0 ;
}

Submission Info

Judge Result