Submission #1780780

---

Source Code Expand

#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
#define ALL(X) X.begin(), X.end()
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef std::pair<LL,LL> PLL;//
typedef std::pair<int,int> PII;//
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)4e18+20;
const LD PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

void solve(){
	int R,C;
	cin >> R >> C;
	vector<int> dist(R*C,INF);
	vector< vector<int> > gra(R*C);
	vector< vector<int> > fld(R,vector<int>(C) );
	int start,goal;
	for(int r=0;r<R;++r){
		string str;
		cin >> str;
		for(int c=0;c<C;++c){
			if( str[c] == 's' ){
				start = r*C + c;
				fld[r][c] = 0;
			}else if( str[c] == 't' ){
				goal = r*C + c;
				fld[r][c] = 0;
			}else{
				fld[r][c] = str[c]-'0';
			}
			int id = C*r + c;
			if( c > 0 ){//左
				gra[id].push_back( id - 1 );
			}
			if( c+1 < C ){//右
				gra[id].push_back( id + 1 );
			}
			if( r > 0 ){//上
				if( r&1 ){//0-index 奇数段
					gra[id].push_back( id - C );
					if( c+1 <  C ){
						gra[id].push_back( id - C + 1 );
					}
				}else{//0-index 偶数段
					if( c > 0 ){
						gra[id].push_back( id - C -1 );
					}
					gra[id].push_back( id - C );
				}
			}
			if( r+1 < R ){//下
				if( r&1 ){
					gra[id].push_back( id+C );
					if( c+1 < C ){
						gra[id].push_back( id+C + 1 );
					}
				}else{
					if( c > 0 ){
						gra[id].push_back( id+C-1 );
					}
					gra[id].push_back( id+C );
				}
			}
		}
	}
	queue<int> que,next;
	next.push( start );
	dist[start] = 0;

	while( next.size() ){
		que = next;
		{
			queue<int> zero;
			next = zero;
		}
		while( que.size() ){
			int now = que.front();que.pop();
			int size = gra[now].size();
			for(int i=0;i<size;++i){
				int to = gra[now][i];
				int to_val = dist[now] + fld[to/C][to%C];
				if( dist[to] > to_val ){
					dist[to] = to_val;
					next.push( to );
				}
			}
		}
	}
	cout << dist[goal] << endl;
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()

Submission Info

Judge Result