Submission #2235701


Source Code Expand

#include<iostream>
#include<unordered_map>
using namespace std;


int main(){
    int H,W;
    int c[10][10];
    int A;
    long long int cost=0;

    cin >> H >> W;
    for(int i=0;i<10;i++){
        for(int j=0;j<10;j++){
            cin >> 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];
            }
        }
    }

    for(int i=0;i<H;i++){
        for(int j=0;j<W;j++){
            cin >> A;
            if(A!=-1){
                cost += c[A][1];
            }
        }
    }

    cout << cost << "\n";

    return 0;
}

Submission Info

Submission Time
Task D - Wall
User cross32768
Language C++14 (GCC 5.4.1)
Score 400
Code Size 714 Byte
Status AC
Exec Time 9 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 19
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
01.txt AC 8 ms 256 KB
02.txt AC 8 ms 256 KB
03.txt AC 7 ms 256 KB
04.txt AC 8 ms 256 KB
05.txt AC 5 ms 256 KB
06.txt AC 8 ms 256 KB
07.txt AC 8 ms 256 KB
08.txt AC 2 ms 256 KB
09.txt AC 2 ms 256 KB
10.txt AC 8 ms 256 KB
11.txt AC 8 ms 256 KB
12.txt AC 8 ms 256 KB
13.txt AC 9 ms 256 KB
14.txt AC 9 ms 256 KB
15.txt AC 1 ms 256 KB
16.txt AC 8 ms 256 KB
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB