Submission #3046591
Source Code Expand
//include //------------------------------------------ #include <bits/stdc++.h> using namespace std; //typedef //------------------------------------------ typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<string> VS; typedef pair<int, int> PII; typedef long long LL; //container util //------------------------------------------ #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define MP make_pair #define SZ(a) int((a).size()) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) //constant //-------------------------------------------- const double EPS = 1e-10; const double PI = acos(-1.0); const int MOD = 1000000007; //debug #define dump(x) cerr << #x << " = " << (x) << endl; #define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl; //main code int main(int argc, char const* argv[]) { int H,W; cin >> H >> W; VVI dp(10,VI(10,0)); for (int i = 0; i < 10; i++) { for (int j = 0; j < 10; j++) { cin >> dp[i][j]; } } for (int k = 0; k < 10; k++) { for (int i = 0; i < 10; i++) { for (int j = 0; j < 10; j++) { dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]); } } } LL ans = 0; for (int i = 0; i < H; i++) { for (int j = 0; j < W; j++) { int a; cin >> a; if (a != -1) { ans += dp[a][1]; } } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Wall |
User | baku1101 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1737 Byte |
Status | AC |
Exec Time | 9 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 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 | 7 ms | 256 KB |
03.txt | AC | 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 | AC | 7 ms | 256 KB |
08.txt | AC | 2 ms | 256 KB |
09.txt | AC | 2 ms | 256 KB |
10.txt | AC | 7 ms | 256 KB |
11.txt | AC | 7 ms | 256 KB |
12.txt | AC | 7 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 | 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 |