AtCoder Beginner Contest 079 D

AtCoder Beginner Contest 079 D - Wall

 Warshall Floyd 最短路。。。。先枚举 k

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int c[10][10];
int H, W, A, ans;

int main()
{
    scanf("%d%d", &H, &W);
    for (int i = 0; i < 10; i++)
        for (int j = 0; j < 10; j++)
            scanf("%d", &c[i][j]);
    for(int k=0;k<10;k++)
        for(int i=0;i<10;i++)
            for (int j = 0; j < 10; j++) {
                if (c[i][j] > c[i][k] + c[k][j])
                    c[i][j] = c[i][k] + c[k][j];
            }
    ans = 0;
    for(int i=0;i<H;i++)
        for (int j = 0; j < W; j++) {
            scanf("%d", &A);
            if (A >= 0)
                ans += c[A][1];
        }
    printf("%d
", ans);
    return 0;
}