結果

問題 No.424 立体迷路
ユーザー ccppjsrbccppjsrb
提出日時 2020-08-21 16:28:27
言語 Go
(1.23.4)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 2,828 bytes
コンパイル時間 14,427 ms
コンパイル使用メモリ 240,804 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-15 02:51:41
合計ジャッジ時間 15,459 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 5
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
func configure(scanner *bufio.Scanner) {
scanner.Split(bufio.ScanWords)
scanner.Buffer(make([]byte, 1000005), 1000005)
}
func getNextString(scanner *bufio.Scanner) string {
scanned := scanner.Scan()
if !scanned {
panic("scan failed")
}
return scanner.Text()
}
func getNextInt(scanner *bufio.Scanner) int {
i, _ := strconv.Atoi(getNextString(scanner))
return i
}
func getNextInt64(scanner *bufio.Scanner) int64 {
i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
return i
}
func getNextFloat64(scanner *bufio.Scanner) float64 {
i, _ := strconv.ParseFloat(getNextString(scanner), 64)
return i
}
func main() {
fp := os.Stdin
wfp := os.Stdout
extra := 0
if os.Getenv("I") == "IronMan" {
fp, _ = os.Open(os.Getenv("END_GAME"))
extra = 100
}
scanner := bufio.NewScanner(fp)
configure(scanner)
writer := bufio.NewWriter(wfp)
defer func() {
r := recover()
if r != nil {
fmt.Fprintln(writer, r)
}
writer.Flush()
}()
solve(scanner, writer)
for i := 0; i < extra; i++ {
fmt.Fprintln(writer, "-----------------------------------")
solve(scanner, writer)
}
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
h := getNextInt(scanner)
w := getNextInt(scanner)
sx := getNextInt(scanner) - 1
sy := getNextInt(scanner) - 1
gx := getNextInt(scanner) - 1
gy := getNextInt(scanner) - 1
ss := make([]string, h)
for i := 0; i < h; i++ {
ss[i] = getNextString(scanner)
}
rng := makeGrid(h, w)
rng[sx][sy] = true
q := make([]pair, 0)
q = append(q, pair{sx, sy})
dy := [4]int{-1, 0, 0, 1}
dx := [4]int{0, -1, 1, 0}
for len(q) > 0 {
p := q[0]
q = q[1:]
rng[p[0]][p[1]] = true
for i := 0; i < 4; i++ {
xx := p[0] + dx[i]
yy := p[1] + dy[i]
if xx < 0 || xx >= h {
continue
}
if yy < 0 || yy >= w {
continue
}
if rng[xx][yy] {
continue
}
if abs(int(ss[xx][yy]-'0')-int(ss[p[0]][p[1]]-'0')) > 1 {
continue
}
rng[xx][yy] = true
q = append(q, pair{xx, yy})
}
for i := 0; i < 4; i++ {
x := p[0] + dx[i]
y := p[1] + dy[i]
xx := p[0] + dx[i]*2
yy := p[1] + dy[i]*2
if xx < 0 || xx >= h {
continue
}
if yy < 0 || yy >= w {
continue
}
if rng[xx][yy] {
continue
}
if abs(int(ss[xx][yy]-'0')-int(ss[p[0]][p[1]]-'0')) > 0 {
continue
}
if int(ss[p[0]][p[1]]-'0') <= int(ss[x][y]-'0') {
continue
}
rng[xx][yy] = true
q = append(q, pair{xx, yy})
}
}
if rng[gx][gy] {
fmt.Fprintln(writer, "YES")
return
}
fmt.Fprintln(writer, "NO")
}
func abs(a int) int {
if a < 0 {
return -a
}
return a
}
type pair [2]int
func makeGrid(h, w int) [][]bool {
index := make([][]bool, h, h)
data := make([]bool, h*w, h*w)
for i := 0; i < h; i++ {
index[i] = data[i*w : (i+1)*w]
}
return index
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0