Submission #3039568
Source Code Expand
R, C = gets.split.map(&:to_i) $sy, $sx = gets.split.map(&:to_i).collect {|num| num-1} $gy, $gx = gets.split.map(&:to_i).collect {|num| num-1} $maze = [] R.times do $maze << gets.chomp end $list = [[$sy, $sx]] $next = [] $hist = [] $ans = 0 def check(y, x) if $hist.include?([y, x]) return else $hist << [y, x] end if y == $gy && x == $gx puts $ans exit end $next.push([y, x]) if $maze[y][x] == "." end loop do $ans += 1 while(! $list.empty?) do temp = $list.pop check(temp[0]-1, temp[1]) check(temp[0]+1, temp[1]) check(temp[0], temp[1]+1) check(temp[0], temp[1]-1) end $list = Marshal.load(Marshal.dump($next)) $next.clear end
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | mizo |
Language | Ruby (2.3.3) |
Score | 0 |
Code Size | 714 Byte |
Status | TLE |
Exec Time | 2108 ms |
Memory | 4092 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 8 ms | 1788 KB |
subtask0_sample02.txt | AC | 8 ms | 1788 KB |
subtask0_sample03.txt | TLE | 2108 ms | 2172 KB |
subtask1_01.txt | AC | 1724 ms | 2300 KB |
subtask1_02.txt | AC | 1743 ms | 2300 KB |
subtask1_03.txt | AC | 1236 ms | 4092 KB |
subtask1_04.txt | TLE | 2107 ms | 2172 KB |
subtask1_05.txt | AC | 757 ms | 1916 KB |
subtask1_06.txt | TLE | 2108 ms | 2172 KB |
subtask1_07.txt | AC | 12 ms | 1788 KB |
subtask1_08.txt | AC | 38 ms | 1788 KB |
subtask1_09.txt | AC | 1414 ms | 2044 KB |
subtask1_10.txt | AC | 155 ms | 1916 KB |
subtask1_11.txt | TLE | 2108 ms | 2172 KB |
subtask1_12.txt | AC | 1448 ms | 2044 KB |
subtask1_13.txt | AC | 1389 ms | 2044 KB |
subtask1_14.txt | AC | 11 ms | 1788 KB |
subtask1_15.txt | AC | 1687 ms | 2172 KB |
subtask1_16.txt | AC | 1778 ms | 2172 KB |
subtask1_17.txt | TLE | 2107 ms | 2044 KB |
subtask1_18.txt | TLE | 2107 ms | 2172 KB |
subtask1_19.txt | AC | 1560 ms | 2172 KB |
subtask1_20.txt | AC | 1825 ms | 2300 KB |
subtask1_21.txt | TLE | 2108 ms | 2172 KB |
subtask1_22.txt | AC | 1801 ms | 2172 KB |