Submission #2543811

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG_MODE
	#define DBG(n) n;
#else
	#define DBG(n) ;
#endif
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define rep(i,s,g) for(ll (i) = (s);(i) < (g);++i)
#define rrep(i,s,g) for(ll (i) = (s);i >= (g);--(i))
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {for(int W = 0;W < (n);W++)cerr << v[W] << ' ';cerr << endl << endl;}
#define SHOW2d(v,i,j) {for(int aaa = 0;aaa < i;aaa++){for(int bbb = 0;bbb < j;bbb++)cerr << v[aaa][bbb] << ' ';cerr << endl;}cerr << endl;}
#define ALL(v) v.begin(),v.end()
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define MOD 1000000007


typedef long long ll;
typedef pair<ll,ll> P;

int dist[301][301];
void WF(int num){
	for(int k = 0;k < num;k++){
		for(int i = 0;i < num;i++){
			for(int j = 0;j < num;j++){
				dist[i][j] = min(dist[i][j],dist[i][k] + dist[k][j]);
			}
		}
	}
}

int main(){
	
	int h,w;cin >> h >> w;
	REP(i,10)REP(j,10)cin >> dist[i][j];
	WF(10);
	int ans = 0;
	REP(i,h)REP(j,w){
		int tmp;cin >> tmp;
		if(tmp != -1){
			ans += dist[tmp][1];
		}
	}
	cout << ans << endl;
	
	return 0;
}

Submission Info

Judge Result