Submission #691658
Source Code Expand
r , c = gets.split.map { |e| e.to_i } sy, sx = gets.split.map { |e| e.to_i - 1 } gy, gx = gets.split.map { |e| e.to_i - 1 } map = readlines.map { |e| e.split(/\s*/).map { |elm| elm == '#' ? '#' : 0 } } queue = [[sy, sx]] dests = [[-1, 0], [0, -1], [1, 0], [0, 1]] while queue.empty? == false point = queue.shift break if point[0] == gy and point[1] == gx for dest in dests do next_point = [point[0] + dest[0], point[1] + dest[1]] next if map[next_point[0]][next_point[1]].to_s == '#' or map[next_point[0]][next_point[1]] != 0 queue.push next_point map[next_point[0]][next_point[1]] = map[point[0]][point[1]] + 1 end end puts map[gy][gx]
Submission Info
Submission Time | |
---|---|
Task | A - 幅優先探索 |
User | te2ka |
Language | Ruby (2.3.3) |
Score | 100 |
Code Size | 684 Byte |
Status | AC |
Exec Time | 54 ms |
Memory | 2172 KB |
Compile Error
./Main.rb:1: warning: assigned but unused variable - r ./Main.rb:1: warning: assigned but unused variable - c
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
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 | 21 ms | 1916 KB |
subtask0_sample02.txt | AC | 20 ms | 1788 KB |
subtask0_sample03.txt | AC | 34 ms | 1788 KB |
subtask1_01.txt | AC | 27 ms | 2172 KB |
subtask1_02.txt | AC | 54 ms | 2044 KB |
subtask1_03.txt | AC | 29 ms | 2172 KB |
subtask1_04.txt | AC | 32 ms | 1788 KB |
subtask1_05.txt | AC | 27 ms | 1788 KB |
subtask1_06.txt | AC | 31 ms | 2172 KB |
subtask1_07.txt | AC | 19 ms | 1788 KB |
subtask1_08.txt | AC | 25 ms | 1916 KB |
subtask1_09.txt | AC | 30 ms | 2172 KB |
subtask1_10.txt | AC | 25 ms | 1916 KB |
subtask1_11.txt | AC | 34 ms | 1788 KB |
subtask1_12.txt | AC | 31 ms | 1788 KB |
subtask1_13.txt | AC | 27 ms | 2172 KB |
subtask1_14.txt | AC | 24 ms | 1916 KB |
subtask1_15.txt | AC | 33 ms | 2172 KB |
subtask1_16.txt | AC | 30 ms | 2172 KB |
subtask1_17.txt | AC | 29 ms | 2172 KB |
subtask1_18.txt | AC | 33 ms | 2172 KB |
subtask1_19.txt | AC | 27 ms | 2172 KB |
subtask1_20.txt | AC | 28 ms | 2172 KB |
subtask1_21.txt | AC | 37 ms | 2172 KB |
subtask1_22.txt | AC | 27 ms | 2044 KB |