#212637 (C++14) No.340 雪の足跡

• 問題: No.340 雪の足跡
• ユーザー: ckawatak
• 提出日時: 2017-10-28 16:12:39
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 716 ms / 1,000 ms
• コード長: 2,352 bytes
• コンパイル時間: 1,356 ms
• コンパイル使用メモリ: 79,940 KB
• 実行使用メモリ: 82,560 KB
• 最終ジャッジ日時: 2024-11-22 03:27:11
• 合計ジャッジ時間: 11,484 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

ファイルパターン	結果
sample	AC * 5
other	AC * 32

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
#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;        
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX