#! ruby # yukicoder My Practice # author: Leonardone @ NEETSDKASU ############################################################ def gs() gets.chomp end def gi() gets.to_i end def gf() gets.to_f end def gss() gs.split end def gis() gss.map(&:to_i) end def gfs() gss.map(&:to_f) end def nmapf(n,f) n.times.map{ __send__ f } end def ngs(n) nmapf n,:gs end def ngi(n) nmapf n,:gi end def ngss(n) nmapf n,:gss end def ngis(n) nmapf n,:gis end def arr2d(h,w,v=0) h.times.map{[v] * w} end def for2p(hr,wr,&pr) hr.each{|i|wr.each{|j| yield(i,j)}} end def nsum(n) n * (n + 1) / 2 end def vcount(d,r=Hash.new(0)) d.inject(r){|r,e| r[e]+=1;r} end ############################################################ =begin 最大でも20x20なんで うまくやればTLEなんて起こらないはずなのに 壁伝いだと以下に気をつけるべき ループに捕まると抜け出せない ########## #......... #..####..# #.v#..#..# #..####..# #........# ########## 行き止まりも恐い ########## #.#....... #.#.###### #.#......# #.#.###### #......v.# ########## 下手すると上下左右に単機ループがあるかもしれない ########## #......... #...#....# #.#.v.#..# #........# #...#....# #........# ########## 真面目に組むなら マッピング・不明マスへのルート検索・ナビ の繰り返しでゴールできるはずだがm めっちゃ面倒そう =end UNKNOWN_CELL = 0 WALL_CELL = 1 SPACE_CELL = 2 f = arr2d(60, 60) x = 30 y = 30 dx = 1 dy = 0 f[y][x] = SPACE_CELL def rotr(dx, dy) [-dy, dx] end def rotl(dx, dy) [dy, -dx] end def rcell(f, x, y, dx, dy) rx, ry = rotr(dx, dy) f[y + ry][x + rx] end def lcell(f, x, y, dx, dy) lx, ly = rotl(dx, dy) f[y + ly][x + lx] end def mapping(f, x, y, dx, dy, d) (1..d).each do |i| f[y + dy * i][x + dx * i] = SPACE_CELL end f[y + dy * d.succ][x + dx * d.succ] = WALL_CELL f end root = [] def seachRoot(f, x, y, dx, dy) m = arr2d(60, 60, false) w = [[x, y, dx, dy, []]] while !w.empty? v = [] w.each do |x, y, dx, dy, r| next if m[y][x] next if !(9..51).include?(x) next if !(9..51).include?(y) m[y][x] = true case f[y][x] when UNKNOWN_CELL return r[0..-2] when SPACE_CELL v << [x + dx, y + dy, dx, dy, r + ["F"]] nx, ny = rotr(dx, dy) v << [x + nx, y + ny, nx, ny, r + ["R", "F"]] nx, ny = rotl(dx, dy) v << [x + nx, y + ny, nx, ny, r + ["L", "F"]] nx, ny = rotl(nx, ny) v << [x + nx, y + ny, nx, ny, r + ["L", "L", "F"]] end end w = v end return [] end loop { s = STDIN.gets break if s[0] == "M" if s.size > 2 STDOUT.puts "F" else d = s.to_i f = mapping(f, x, y, dx, dy, d) while root.empty? root = seachRoot(f, x, y, dx, dy) end nxt = root.pop puts nxt case nxt when "F" x += dx y += dy when "R" dx, dy = rotr(dx, dy) when "L" dx, dy = rotl(dx, dy) when "B" x -= dx y -= dy end end STDOUT.flush }