Submission #1260000

---

Source Code Expand

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mt make_tuple
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef tuple<int,int,int> tp;
typedef vector<tp> vt;
typedef vector<vd> vvd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-7;
const int inf=1e8;
const ll INF=2e18;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
int n,m;
int dp[510][510][2];
vs in;
int mi=inf;
void f(int a,int b,int c,int cost){
//	cout<<a<<" "<<b<<" "<<c<<" "<<cost<<endl;
	if(c&&in[a][b]=='G'){
		mi=min(mi,cost);
	}
	rep(i,4){
		int x=a+dx[i];
		int y=b+dy[i];
		if(in[x][y]=='#')continue;
		int q=c;
		if(in[x][y]=='C')q=1;
		if(dp[x][y][q]>cost+1){
			dp[x][y][q]=cost+1;
			f(x,y,q,cost+1);
		}
	}
}
int main(){
	rep(i,510)rep(j,510)rep(k,2)dp[i][j][k]=inf;
	cin>>n>>m;
	in=vs(n);
	rep(i,n)cin>>in[i];
	rep(i,n)rep(j,m)if(in[i][j]=='S'){
		dp[i][j][0]=0;
		f(i,j,0,0);
		if(mi==inf)cout<<-1<<endl;
		else cout<<mi<<endl;
		return 0;
	}
}

Submission Info

Judge Result