結果
問題 | No.424 立体迷路 |
ユーザー | ichibanshibori |
提出日時 | 2016-09-23 22:48:39 |
言語 | F# (F# 4.0) |
結果 |
AC
|
実行時間 | 1,595 ms / 2,000 ms |
コード長 | 2,179 bytes |
コンパイル時間 | 4,990 ms |
コンパイル使用メモリ | 165,128 KB |
実行使用メモリ | 29,512 KB |
最終ジャッジ日時 | 2023-09-18 16:54:24 |
合計ジャッジ時間 | 9,593 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 92 ms
23,096 KB |
testcase_01 | AC | 92 ms
23,224 KB |
testcase_02 | AC | 89 ms
22,988 KB |
testcase_03 | AC | 96 ms
23,120 KB |
testcase_04 | AC | 93 ms
23,212 KB |
testcase_05 | AC | 88 ms
22,976 KB |
testcase_06 | AC | 85 ms
22,944 KB |
testcase_07 | AC | 88 ms
23,016 KB |
testcase_08 | AC | 85 ms
22,896 KB |
testcase_09 | AC | 88 ms
23,144 KB |
testcase_10 | AC | 88 ms
21,076 KB |
testcase_11 | AC | 93 ms
21,160 KB |
testcase_12 | AC | 93 ms
21,124 KB |
testcase_13 | AC | 95 ms
23,236 KB |
testcase_14 | AC | 93 ms
23,076 KB |
testcase_15 | AC | 96 ms
23,168 KB |
testcase_16 | AC | 95 ms
23,280 KB |
testcase_17 | AC | 94 ms
21,212 KB |
testcase_18 | AC | 89 ms
23,144 KB |
testcase_19 | AC | 93 ms
23,140 KB |
testcase_20 | AC | 88 ms
23,080 KB |
testcase_21 | AC | 93 ms
23,212 KB |
testcase_22 | AC | 93 ms
25,244 KB |
testcase_23 | AC | 93 ms
23,280 KB |
testcase_24 | AC | 592 ms
27,332 KB |
testcase_25 | AC | 1,595 ms
29,512 KB |
コンパイルメッセージ
Microsoft (R) F# Compiler version 11.0.0.0 for F# 5.0 Copyright (c) Microsoft Corporation. All Rights Reserved.
ソースコード
open System let () = let h, w = stdin.ReadLine () |> (fun l -> l.Split ()) |> (fun arr -> (int arr.[0], int arr.[1])) let sx, sy, gx, gy = stdin.ReadLine () |> (fun l -> l.Split ()) |> (fun arr -> (int arr.[0], int arr.[1], int arr.[2], int arr.[3])) let mapArr = Array2D.zeroCreateBased<int> 1 1 w h let readB (x, line:string) = seq {1..w} |> Seq.iter (fun y -> mapArr.[y, x] <- int line.[y - 1] - int '0') seq { for y in 1..h -> (y, stdin.ReadLine ()) } |> Seq.iter readB let searchPath startY startX = let dxy = [(1, 0); (-1, 0); (0, 1); (0, -1)] let canMove1 (cy, cx) (dy, dx) = let y, x = cy + dy, cx + dx y >= 1 && y <= w && x >= 1 && x <= h && abs(mapArr.[y, x] - mapArr.[cy, cx]) <= 1 let canMove2 (cy, cx) (dy, dx) = let y1, y2 = cy + dy, cy + dy * 2 let x1, x2 = cx + dx, cx + dx * 2 y2 >= 1 && y2 <= w && x2 >= 1 && x2 <= h && mapArr.[cy, cx] = mapArr.[y2, x2] && mapArr.[cy, cx] > mapArr.[y1, x1] let rec searchPath' lst chkedLst = match lst with | [] -> false | x::xs -> let cy, cx = x if cy = gy && cx = gx then true else let cand1 = List.filter (canMove1 (cy, cx)) dxy let cand2 = List.filter (canMove2 (cy, cx)) dxy |> List.map (fun (dy, dx) -> (dy * 2, dx * 2)) let cand = List.append cand1 cand2 let candLst = List.map (fun (dy, dx) -> (cy + dy, cx + dx)) cand |> List.filter (fun pos -> not (List.contains pos chkedLst)) let nextLst = List.append candLst xs let nextChkedLst = (cy, cx) :: chkedLst searchPath' nextLst nextChkedLst searchPath' [(startY, startX)] [] searchPath sy sx |> (function | true -> "YES" | false -> "NO") |> printfn "%s"