結果
問題 | No.340 雪の足跡 |
ユーザー | mayoko_ |
提出日時 | 2016-01-29 23:17:30 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 205 ms / 1,000 ms |
コード長 | 3,406 bytes |
コンパイル時間 | 751 ms |
コンパイル使用メモリ | 92,224 KB |
実行使用メモリ | 27,472 KB |
最終ジャッジ日時 | 2023-10-21 17:24:15 |
合計ジャッジ時間 | 5,091 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
12,036 KB |
testcase_01 | AC | 3 ms
12,040 KB |
testcase_02 | AC | 3 ms
11,872 KB |
testcase_03 | AC | 3 ms
12,036 KB |
testcase_04 | AC | 3 ms
12,036 KB |
testcase_05 | AC | 3 ms
11,860 KB |
testcase_06 | AC | 3 ms
12,036 KB |
testcase_07 | AC | 4 ms
12,056 KB |
testcase_08 | AC | 3 ms
12,044 KB |
testcase_09 | AC | 3 ms
12,028 KB |
testcase_10 | AC | 4 ms
12,048 KB |
testcase_11 | AC | 5 ms
12,184 KB |
testcase_12 | AC | 4 ms
12,188 KB |
testcase_13 | AC | 4 ms
12,328 KB |
testcase_14 | AC | 13 ms
16,792 KB |
testcase_15 | AC | 16 ms
18,840 KB |
testcase_16 | AC | 12 ms
16,792 KB |
testcase_17 | AC | 19 ms
18,840 KB |
testcase_18 | AC | 16 ms
18,840 KB |
testcase_19 | AC | 18 ms
18,840 KB |
testcase_20 | AC | 153 ms
27,464 KB |
testcase_21 | AC | 98 ms
12,032 KB |
testcase_22 | AC | 25 ms
27,300 KB |
testcase_23 | AC | 158 ms
27,464 KB |
testcase_24 | AC | 141 ms
27,464 KB |
testcase_25 | AC | 149 ms
27,464 KB |
testcase_26 | AC | 27 ms
16,772 KB |
testcase_27 | AC | 8 ms
12,044 KB |
testcase_28 | AC | 24 ms
16,792 KB |
testcase_29 | AC | 165 ms
27,228 KB |
testcase_30 | AC | 114 ms
22,940 KB |
testcase_31 | AC | 176 ms
27,144 KB |
testcase_32 | AC | 204 ms
27,472 KB |
testcase_33 | AC | 203 ms
27,472 KB |
testcase_34 | AC | 205 ms
27,472 KB |
testcase_35 | AC | 173 ms
27,472 KB |
testcase_36 | AC | 170 ms
27,472 KB |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:48:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 48 | scanf("%d", &M); | ~~~~~^~~~~~~~~~ main.cpp:49:44: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 49 | for (int j = 0; j < M+1; j++) scanf("%d", B+j); | ~~~~~^~~~~~~~~~~
ソースコード
#include<cstdio> #include<cstdlib> #include<cstring> #include<cmath> //#include<cctype> #include<climits> #include<iostream> #include<string> #include<vector> #include<map> //#include<list> #include<queue> #include<deque> #include<algorithm> //#include<numeric> #include<utility> #include<complex> //#include<memory> #include<functional> #include<cassert> #include<set> #include<stack> const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, 1, 0, -1}; using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<ll> vll; typedef pair<int, int> pii; const int MAX = 1111; const int INF = 1e9; int migi[MAX][MAX], hidari[MAX][MAX], up[MAX][MAX], down[MAX][MAX]; int B[MAX], dist[MAX][MAX]; int main() { int W, H, N; cin >> W >> H >> N; for (int y = 0; y < H; y++) { for (int x = 0; x < W; x++) migi[y][x] = hidari[y][x] = x; } for (int x = 0; x < W; x++) { for (int y = 0; y < H; y++) up[y][x] = down[y][x] = y; } for (int i = 0; i < N; i++) { int M; scanf("%d", &M); for (int j = 0; j < M+1; j++) scanf("%d", B+j); for (int j = 0; j < M; j++) { int y = B[j]/W, x = B[j]%W; int ny = B[j+1]/W, nx = B[j+1]%W; if (y == ny) { if (x < nx) { migi[y][x] = max(migi[y][x], nx); hidari[ny][nx] = min(hidari[ny][nx], x); } else { migi[ny][nx] = max(migi[ny][nx], x); hidari[y][x] = min(hidari[y][x], nx); } } else { if (y < ny) { up[y][x] = max(up[y][x], ny); down[ny][nx] = min(down[ny][nx], y); } else { up[ny][nx] = max(up[ny][nx], y); down[y][x] = min(down[y][x], ny); } } } } for (int y = 0; y < H; y++) { int maxi = 0; for (int x = 0; x < W; x++) { maxi = max(maxi, migi[y][x]); migi[y][x] = maxi; } int mini = W; for (int x = W-1; x >= 0; x--) { mini = min(mini, hidari[y][x]); hidari[y][x] = mini; } } for (int x = 0; x < W; x++) { int maxi = 0; for (int y = 0; y < H; y++) { maxi = max(maxi, up[y][x]); up[y][x] = maxi; } int mini = H; for (int y = H-1; y >= 0; y--) { mini = min(mini, down[y][x]); down[y][x] = mini; } } for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) dist[i][j] = INF; dist[0][0] = 0; queue<pii> que; que.push(pii(0, 0)); while (!que.empty()) { pii p = que.front(); que.pop(); int y = p.first, x = p.second; if (migi[y][x] > x && dist[y][x+1] > dist[y][x]+1) dist[y][x+1] = dist[y][x]+1, que.push(pii(y, x+1)); if (hidari[y][x] < x && dist[y][x-1] > dist[y][x]+1) dist[y][x-1] = dist[y][x]+1, que.push(pii(y, x-1)); if (up[y][x] > y && dist[y+1][x] > dist[y][x]+1) dist[y+1][x] = dist[y][x]+1, que.push(pii(y+1, x)); if (down[y][x] < y && dist[y-1][x] > dist[y][x]+1) dist[y-1][x] = dist[y][x]+1, que.push(pii(y-1, x)); } if (dist[H-1][W-1] >= INF) { cout << "Odekakedekinai.." << endl; } else { cout << dist[H-1][W-1] << endl; } return 0; }