Submission #3416772
Source Code Expand
#include <stdio.h> #include <string> #include <iostream> #include <iomanip> #include <map> #include <algorithm> #include <vector> using namespace std; int main(void) { int h,w; cin >> h >> w; int majic[10][10]; for(int i=0; i<10; i++){ for(int j=0; j<10; j++){ cin >> majic[i][j]; } } for(int i=0; i<10; i++){ for(int j=0; j<10; j++){ for(int k=0; k<10; k++){ if(majic[i][j]+majic[j][k]<majic[i][k])majic[i][k]=majic[i][j]+majic[j][k]; } } } long long ans=0,temp; for(int i=0; i<h; i++){ for(int j=0; j<w; j++){ cin >> temp; if(temp!=-1)ans+=majic[temp][1]; } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Wall |
User | Autumn_A |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 677 Byte |
Status | WA |
Exec Time | 8 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||
Status |
|
|
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 | 7 ms | 256 KB |
02.txt | AC | 8 ms | 256 KB |
03.txt | WA | 6 ms | 256 KB |
04.txt | AC | 7 ms | 256 KB |
05.txt | AC | 5 ms | 256 KB |
06.txt | AC | 7 ms | 256 KB |
07.txt | WA | 7 ms | 256 KB |
08.txt | AC | 2 ms | 256 KB |
09.txt | WA | 2 ms | 256 KB |
10.txt | WA | 7 ms | 256 KB |
11.txt | WA | 7 ms | 256 KB |
12.txt | WA | 7 ms | 256 KB |
13.txt | AC | 8 ms | 256 KB |
14.txt | AC | 8 ms | 256 KB |
15.txt | WA | 1 ms | 256 KB |
16.txt | WA | 7 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 |