結果
問題 | No.340 雪の足跡 |
ユーザー | ckawatak |
提出日時 | 2017-10-26 11:15:59 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,089 bytes |
コンパイル時間 | 894 ms |
コンパイル使用メモリ | 81,432 KB |
実行使用メモリ | 26,928 KB |
最終ジャッジ日時 | 2024-05-01 15:09:50 |
合計ジャッジ時間 | 16,073 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 2 ms
6,940 KB |
testcase_10 | AC | 2 ms
6,944 KB |
testcase_11 | AC | 4 ms
6,944 KB |
testcase_12 | AC | 3 ms
6,940 KB |
testcase_13 | AC | 3 ms
6,940 KB |
testcase_14 | AC | 25 ms
6,944 KB |
testcase_15 | AC | 32 ms
6,940 KB |
testcase_16 | AC | 23 ms
6,940 KB |
testcase_17 | AC | 43 ms
6,944 KB |
testcase_18 | AC | 33 ms
6,940 KB |
testcase_19 | AC | 43 ms
6,940 KB |
testcase_20 | TLE | - |
testcase_21 | TLE | - |
testcase_22 | AC | 8 ms
22,740 KB |
testcase_23 | AC | 815 ms
26,848 KB |
testcase_24 | TLE | - |
testcase_25 | TLE | - |
testcase_26 | AC | 63 ms
6,940 KB |
testcase_27 | AC | 12 ms
6,940 KB |
testcase_28 | AC | 57 ms
6,940 KB |
testcase_29 | AC | 711 ms
18,412 KB |
testcase_30 | AC | 413 ms
15,592 KB |
testcase_31 | AC | 824 ms
24,564 KB |
testcase_32 | TLE | - |
testcase_33 | AC | 836 ms
26,744 KB |
testcase_34 | TLE | - |
testcase_35 | TLE | - |
testcase_36 | TLE | - |
ソースコード
#include <iostream> #include <vector> #include <queue> using namespace std; struct Block { Block() : top(-1), bottom(-1),left(-1),right(-1) {} int top; int bottom; int left; int right; }; int hop[(1<<10) * (1<<10)]; int INF = 1<<10; int main(int argc, char* argv[]) { // Retrieve data int W,H,N; cin >> W >> H >> N; vector<vector<int> > paths(N); for (int i = 0; i < N; i++) { int m; cin >> m; for (int j = 0; j < m+1; j++) { int b; cin >> b; paths[i].push_back(b); } } // Initialize the path for each block int nblocks = W * H; vector<Block> blocks(nblocks); for (int i = 0; i < N; i++) { vector<int> path = paths[i]; int size = path.size(); for (int j = 0; j < size-1; j++) { int start = path[j]; int end = path[j+1]; if (end < start) { int temp = start; start = end; end = temp; } // the starting point and the ending point are in the same row if (start/W == end/W) { for (int k = start; k <= end; k++) { if (k == start) { blocks[k].right = k+1; } else if (k == end) { blocks[k].left = k-1; } else { blocks[k].left = k-1; blocks[k].right = k+1; } } } // the starting point and the ending point are NOT in the same row else { for (int k = start; k <= end; k+=W) { if (k == start) { blocks[k].top = k+W; } else if (k == end) { blocks[k].bottom = k-W; } else { blocks[k].bottom = k-W; blocks[k].top = k+W; } } } } } // Initialize the number of hops for (int i = 0; i < H; i++) { for (int j = 0; j < W; j++) { hop[i * W + j] = INF; } } hop[0] = 0; // Do BFS to search for a path queue<int> que; que.push(0); int solution = -1; while (!que.empty()) { int current = que.front(); que.pop(); if (current == nblocks-1) { break; } Block block = blocks[current]; int directions[] = {block.top, block.bottom, block.left, block.right}; for (int i = 0; i < sizeof(directions)/sizeof(int); i++) { if (directions[i] != -1 && hop[directions[i]] == INF) { que.push(directions[i]); hop[directions[i]] = hop[current] + 1; } } } solution = hop[nblocks-1]; if (solution == INF) { cout << "Odekakedekinai.." << endl; } else { cout << solution << endl; } }