Submission #3726297


Source Code Expand

<?php
    fscanf(STDIN, "%d %d",$r, $c);
    fscanf(STDIN, "%d %d",$sy, $sx);
    fscanf(STDIN, "%d %d",$gy, $gx);
    $maze = [];
    for ($i=0; $i < $r; $i++) { 
        $maze[$i] = str_split(trim(fgets(STDIN)));
    }

    $maze[$sy-1][$sx-1] = 0; //スタート地点(0手で行ける場所)の設定
    
    $turn = 0; //今何手目かカウント(初期値0)
    while ($maze[$gy-1][$gx-1] == ".") { //ゴールが上書きされるまで処理を実行
        for ($y=0; $y < $r-1; $y++) { 
            for ($x=0; $x < $c-1; $x++) {
                if ($maze[$y][$x] === $turn) {
                    if ($maze[$y+1][$x] == ".") {
                        $maze[$y+1][$x] = $turn + 1;
                    }
                    if ($maze[$y][$x+1] == ".") {
                        $maze[$y][$x+1] = $turn + 1;
                    }
                    if ($y >= 1) {
                        if ($maze[$y-1][$x] == ".") {
                            $maze[$y-1][$x] = $turn + 1;
                        }
                    }
                    if ($x >= 1) {
                        if ($maze[$y][$x-1] == ".") {
                            $maze[$y][$x-1] = $turn + 1;
                        }
                    }
                }
            }
        }
        $turn++;
    }

    echo $maze[$gy-1][$gx-1]."\n";

Submission Info

Submission Time
Task C - 幅優先探索
User pslw
Language PHP7 (7.0.15)
Score 100
Code Size 1374 Byte
Status AC
Exec Time 162 ms
Memory 4604 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 25
Set Name Test Cases
Sample subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt
All subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt
Case Name Status Exec Time Memory
subtask0_sample01.txt AC 10 ms 4604 KB
subtask0_sample02.txt AC 10 ms 4604 KB
subtask0_sample03.txt AC 20 ms 4604 KB
subtask1_01.txt AC 133 ms 4604 KB
subtask1_02.txt AC 162 ms 4604 KB
subtask1_03.txt AC 22 ms 4604 KB
subtask1_04.txt AC 20 ms 4604 KB
subtask1_05.txt AC 15 ms 4604 KB
subtask1_06.txt AC 44 ms 4604 KB
subtask1_07.txt AC 10 ms 4604 KB
subtask1_08.txt AC 28 ms 4604 KB
subtask1_09.txt AC 21 ms 4604 KB
subtask1_10.txt AC 27 ms 4604 KB
subtask1_11.txt AC 20 ms 4604 KB
subtask1_12.txt AC 13 ms 4604 KB
subtask1_13.txt AC 17 ms 4604 KB
subtask1_14.txt AC 16 ms 4604 KB
subtask1_15.txt AC 24 ms 4604 KB
subtask1_16.txt AC 22 ms 4604 KB
subtask1_17.txt AC 20 ms 4604 KB
subtask1_18.txt AC 21 ms 4604 KB
subtask1_19.txt AC 64 ms 4604 KB
subtask1_20.txt AC 104 ms 4604 KB
subtask1_21.txt AC 99 ms 4604 KB
subtask1_22.txt AC 97 ms 4604 KB