結果
問題 | No.340 雪の足跡 |
ユーザー | ckawatak |
提出日時 | 2017-10-28 16:12:39 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 632 ms / 1,000 ms |
コード長 | 2,352 bytes |
コンパイル時間 | 931 ms |
コンパイル使用メモリ | 80,368 KB |
実行使用メモリ | 82,704 KB |
最終ジャッジ日時 | 2023-08-14 08:26:10 |
合計ジャッジ時間 | 10,653 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 10 ms
30,072 KB |
testcase_01 | AC | 10 ms
29,976 KB |
testcase_02 | AC | 10 ms
30,072 KB |
testcase_03 | AC | 10 ms
30,164 KB |
testcase_04 | AC | 10 ms
30,064 KB |
testcase_05 | AC | 10 ms
30,008 KB |
testcase_06 | AC | 10 ms
30,132 KB |
testcase_07 | AC | 10 ms
30,004 KB |
testcase_08 | AC | 10 ms
30,068 KB |
testcase_09 | AC | 10 ms
30,280 KB |
testcase_10 | AC | 10 ms
30,076 KB |
testcase_11 | AC | 12 ms
30,276 KB |
testcase_12 | AC | 11 ms
30,200 KB |
testcase_13 | AC | 12 ms
30,232 KB |
testcase_14 | AC | 42 ms
33,328 KB |
testcase_15 | AC | 46 ms
33,720 KB |
testcase_16 | AC | 32 ms
31,516 KB |
testcase_17 | AC | 56 ms
34,292 KB |
testcase_18 | AC | 51 ms
34,444 KB |
testcase_19 | AC | 57 ms
34,396 KB |
testcase_20 | AC | 334 ms
57,348 KB |
testcase_21 | AC | 179 ms
30,332 KB |
testcase_22 | AC | 22 ms
47,376 KB |
testcase_23 | AC | 441 ms
82,608 KB |
testcase_24 | AC | 277 ms
51,740 KB |
testcase_25 | AC | 356 ms
63,060 KB |
testcase_26 | AC | 56 ms
30,688 KB |
testcase_27 | AC | 18 ms
30,096 KB |
testcase_28 | AC | 56 ms
32,052 KB |
testcase_29 | AC | 460 ms
61,360 KB |
testcase_30 | AC | 331 ms
52,376 KB |
testcase_31 | AC | 559 ms
78,208 KB |
testcase_32 | AC | 627 ms
82,576 KB |
testcase_33 | AC | 557 ms
82,676 KB |
testcase_34 | AC | 632 ms
82,444 KB |
testcase_35 | AC | 564 ms
82,704 KB |
testcase_36 | AC | 577 ms
82,488 KB |
ソースコード
#include <iostream> #include <vector> #include <queue> using namespace std; struct Block { Block() : up(0), down(0),left(0),right(0) {} int up; int down; int left; int right; }; vector<int> paths[(1<<10) * (1<<10)]; int hops[(1<<10) * (1<<10)]; int visit[(1<<10) * (1<<10)]; int main(int argc, char* argv[]) { // Retrieve data int W,H,N; cin >> W >> H >> N; // Initialize the path for each block int nblocks = W * H; vector<Block> blocks(nblocks); for (int i = 0; i < N; i++) { int m; cin >> m; int prev = -1; for (int j = 0; j < m+1; j++) { int n; cin >> n; if (prev != -1) { int b = min(n, prev); int d = abs(n - prev); if (d < W) { blocks[b].right = max(blocks[b].right, d); } else { blocks[b].up = max(blocks[b].up, d/W); } } prev = n; } } for (int i = 0; i < H; i++) { for (int j = 0; j < W; j++) { int b = i * W + j; if (i) { blocks[b].up = max(blocks[b].up, blocks[b-W].up-1); } if (j) { blocks[b].right = max(blocks[b].right, blocks[b-1].right-1); } if (blocks[b].up && i < H-1) { paths[b].push_back(b+W); paths[b+W].push_back(b); } if (blocks[b].right && j < W-1) { paths[b].push_back(b+1); paths[b+1].push_back(b); } } } // Do BFS to search for a path for (int i = 0; i < nblocks; i++) { hops[i] = 1<<20; } hops[0] = 0; visit[0] = 1; queue<int> que; que.push(0); while (!que.empty()) { int current = que.front(); que.pop(); vector<int> path = paths[current]; for (int i = 0; i < path.size(); i++) { int p = path[i]; if (visit[p] == 0) { visit[p] = 1; hops[p] = hops[current] + 1; que.push(p); } } } if (visit[nblocks-1]) { cout << hops[nblocks-1] << endl; } else { cout << "Odekakedekinai.." << endl; } }