Submission #1260019

---

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,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 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];
	int sx,sy,gx,gy;
	rep(i,n)rep(j,m)if(in[i][j]=='S')sx=i,sy=j;
	else if(in[i][j]=='G')gx=i,gy=j;

	dp[sx][sy][0]=0;
	queue<tp>que;
	que.push(tp(sx,sy,0,0));
	while(!que.empty()){
		int a,b,c,d;
		tie(a,b,c,d)=que.front();
		que.pop();
		rep(k,4){
			int x=a+dx[k];
			int y=b+dy[k];
			if(in[x][y]=='#')continue;
			int nc=c||(in[x][y]=='C');
			int nd=d+1;
			if(dp[x][y][nc]>nd){
				dp[x][y][nc]=nd;
				que.push(tp(x,y,nc,nd));
			}
		}
	}
	if(dp[gx][gy][1]==inf)cout<<-1<<endl;
	else cout<<dp[gx][gy][1]<<endl;
	return 0;
}

Submission Info

Judge Result