Submission #3045773

---

Source Code Expand

#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<deque>
#include<map>
#include<queue>
using namespace std;
#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
static const ll maxLL = (ll)1 << 62;
const int mod=1000000007;
int dy[]={-1,0,1,0};
int dx[]={0,1,0,-1};

//#define int ll

int h,w;
int d[10][10];

void warshall_floyd(int n) { // nは頂点数
  for (int i = 0; i < n; i++)      // 経由する頂点
    for (int j = 0; j < n; j++)    // 開始頂点
      for (int k = 0; k < n; k++)  // 終端
        d[j][k] = min(d[j][k], d[j][i] + d[i][k]);
}

signed main(){
    cin>>h>>w;
    rep(i,0,10)rep(j,0,10){
        cin>>d[i][j];
    }
    warshall_floyd(10);
    
    int res=0;
    rep(i,0,h)rep(i,0,w){
        int a;
        cin>>a;
        if(a!=-1)res+=d[a][1];
    }
    
    cout<<res<<endl;
    return 0;
}

Submission Info

Judge Result