Submission #364844

---

Source Code Expand

#include<iostream>
#include<fstream>
#include<sstream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<utility>
#include<complex>

using namespace std;

#define reE(i,a,b) for(auto (i)=(a);(i)<=(b);(i)++)
#define rE(i,b) reE(i,0,b)
#define reT(i,a,b) for(auto (i)=(a);(i)<(b);(i)++)
#define rT(i,b) reT(i,0,b)
#define rep(i,a,b) reE(i,a,b);
#define rev(i,a,b) for(auto (i)=(b)-1;(i)>=(a);(i)--)
#define itr(i,b) for(auto (i)=(b).begin();(i)!=(b).end();++(i))
#define rti(i,b) for(auto (i)=(b).rbegin();(i)!=(b).rend();++(i))
#define LL long long
#define all(b) (b).begin(),(b).end()

#define input_init stringstream ss; string strtoken, token; istringstream is
#define input_line  getline(cin, strtoken);is.str(strtoken);is.clear(istringstream::goodbit)
#define input_token(num) ss.str(""); ss.clear(stringstream::goodbit); getline(is, token, ','); ss << token; ss >> num

#define dir(xx,yy,x,y,i) (xx)=(x)+dir[(i)],(yy)=(y)+dir[(i)+1]

typedef complex<double> P;
typedef vector<P> Poly;

const LL INF = 1 << 30;
const double eps = 1e-8;
const int dir[] = { 0, 1, 0, -1, 0 };

char area[20][20];
int H, W;
LL T;
int sx, sy;
struct M{
	int x, y;
	LL g;
	M(int xx, int yy,int cost){
		x = xx;
		y = yy;
		g = cost;
	}
	bool operator<(const M &another)const{
		return(g > another.g);
	}
};
bool min_cost(LL x){
	priority_queue<M> q;
	bool used[15][15];
	rT(i, 15)rT(j, 15)used[i][j] = true;
	M st(sx, sy, 0);
	used[sx][sy] = false;
	q.push(st);
	while (q.empty() == false){
		M v = q.top(); q.pop();
		//printf("(%d,%d,%lld)\n", v.x, v.y, v.g);
		if (v.g >= T)return false;
		rT(i, 4){
			int xx, yy;
			dir(xx, yy, v.x, v.y, i);
			if (xx >= 0 && xx < H&&yy >= 0 && yy < W&&used[xx][yy]==true){
				if (area[xx][yy] == 'G'&&v.g < T)return true;
				M u(xx, yy, v.g + (area[xx][yy] == '#' ? x : 1));
				q.push(u);
				used[xx][yy] = false;
			}
		}
	}
	return false;
}

int main(void){
	cin >> H >> W >> T;
	rT(i, H)rT(j, W){
		cin >> area[i][j];
		if (area[i][j] == 'S')sx = i, sy = j;
	}
	LL top = T;
	LL middle = T / 2;
	LL bottom = 0;
	while (top-bottom>1){
		//printf("%lld,%lld,%lld\n", top, middle, bottom);
		if (min_cost(middle))bottom = middle;
		else top = middle;
		middle = (bottom + top) / 2;
	}
	cout << bottom << endl;
	return(0);
}

Submission Info

Judge Result