Go: package main

import (
	"bufio"
	"container/list"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()
	for {
		w, h := io.NextInt(), io.NextInt()
		if w == 0 {
			break
		}
		xWall := make([][]int, h)
		yWall := make([][]int, h)
		for i := 0; i < h; i++ {
			xWall[i], yWall[i] = make([]int, w), make([]int, w)
			for j := 0; j < w; j++ {
				xWall[i][j], yWall[i][j] = -1, -1
			}
		}
		for i := 0; i < h*2-1; i++ {
			if i%2 == 0 {
				for j := 0; j < w-1; j++ {
					xWall[i/2][j] = io.NextInt()
				}
			} else {
				for j := 0; j < w; j++ {
					yWall[i/2][j] = io.NextInt()
				}
			}
		}
		//io.Println(bfs(w, h, xWall, yWall))
		fmt.Println(bfs(w, h, xWall, yWall))
	}
}

type P struct {
	x, y int
}

func bfs(w, h int, x, y [][]int) int {
	d := make([][]int, h)
	for i := 0; i < h; i++ {
		d[i] = make([]int, w)
	}
	q := list.New()
	q.PushBack(P{0, 0})
	d[0][0] = 1

	for q.Len() != 0 {
		pos := q.Remove(q.Front()).(P)
		if pos.x == w-1 && pos.y == h-1 {
			break
		}
		if pos.x > 0 && x[pos.y][pos.x-1] == 0 && d[pos.y][pos.x-1] == 0 {
			d[pos.y][pos.x-1] = d[pos.y][pos.x] + 1
			q.PushBack(P{pos.x - 1, pos.y})
		}
		if pos.x < w-1 && x[pos.y][pos.x] == 0 && d[pos.y][pos.x+1] == 0 {
			d[pos.y][pos.x+1] = d[pos.y][pos.x] + 1
			q.PushBack(P{pos.x + 1, pos.y})
		}
		if pos.y > 0 && y[pos.y-1][pos.x] == 0 && d[pos.y-1][pos.x] == 0 {
			d[pos.y-1][pos.x] = d[pos.y][pos.x] + 1
			q.PushBack(P{pos.x, pos.y - 1})
		}
		if pos.y < h-1 && y[pos.y][pos.x] == 0 && d[pos.y+1][pos.x] == 0 {
			d[pos.y+1][pos.x] = d[pos.y][pos.x] + 1
			q.PushBack(P{pos.x, pos.y + 1})
		}
	}
	return d[h-1][w-1]
}

// I/O template
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

func (io *Io) NextLine() string {
	var buff []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buff = append(buff, line...)
		if !isPrefix {
			break
		}
	}
	return string(buff)
}

func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	s := io.tokens[io.nextToken]
	io.nextToken++
	return s
}

func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) Println(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

func (io *Io) PrintIntSlice(a []int) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func (io *Io) PrintStringSlice(a []string) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

func ExampleIo() {
	io := NewIo()
	defer io.Flush()
	a := make([]int, 0, 3)
	a[0], a[1], a[2] = io.NextInt(), io.NextInt(), io.NextInt()
	io.Println(a)
	io.PrintIntSlice(a)
	Log("io", a)
}

C++: #include<iostream>
#include<algorithm>
#include<queue>
#include<map>
using namespace std;
#define INF ( 1 << 30 )
#define fr first
#define sc second
typedef pair< int , int > Pt;
const int dx[] = { 0, 1, -1, 0}, dy[] = { 1, 0, 0, -1};
int w, h, cost[30][30];
bool mas[30][30][30][30];
int bfs(){
  fill_n(cost[0],900,0);
  queue<Pt> que;
  cost[0][0] = 1;
  que.push(Pt(0,0));
  while(!que.empty()){
    Pt p = que.front();
    que.pop();
    if(p.fr == h - 1 && p.sc == w - 1) break;
    for(int i = 0 ; i < 4 ; i++ ){
      int ny = p.fr + dy[i], nx = p.sc + dx[i];
      if(ny >= 0 && ny < h && nx >= 0 && nx < w && !cost[ny][nx] && !mas[p.fr][p.sc][ny][nx]  && !mas[ny][nx][p.fr][p.sc]){
        cost[ny][nx] = cost[p.fr][p.sc] + 1;
        que.push(Pt(ny,nx));
      }
    }
  }
  return cost[h-1][w-1];
}
int main(){
  while(cin >> w >> h , w){
    for(int i = 0 ; i < 2 * h - 1 ; i++ ){
      if(i % 2)
        for(int j = 0 ; j < w ; j++ ) cin >> mas[i/2][j][i/2+1][j];
      else
        for(int j = 0 ; j < w - 1 ; j++ ) cin >> mas[i/2][j][i/2][j+1];
    }
    cout << bfs() << endl;
  }
}

C++: #include<iomanip>
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<queue>
#include<sstream>
using namespace std;
#define DEBUG 0
int w,h;
bool start(){
  string s;
  getline(cin,s);
  stringstream ss(s);
  ss>>w>>h;
  return w!=0&&h!=0;
}
typedef pair<int,int> pii;
#define X first
#define Y second
vector<string> f;
struct S{
  int c;
  pii p;
};
bool operator<(S a,S b){
  return a.c>b.c;
}
const int vx[]= {0,0,1,-1};
const int vy[]= {1,-1,0,0};
const bool check(int x,int y){
  return (0<=x)&&(x<f.size())&&(0<=y)&&(y<f[x].size());
}
int find(pii start,pii end){
  priority_queue<S> q;
  q.push(S{1,start});
  vector<vector<int>> dp(f.size(),vector<int>(f[0].size(),-1));
  while(!q.empty()){
    S now = q.top();q.pop();
    if(dp[now.p.X][now.p.Y]!=-1)continue;
    dp[now.p.X][now.p.Y]=now.c;
    for(int i=0;i<4;i++){
      const int x = now.p.X+vx[i];
      const int y = now.p.Y+vy[i];
      if(check(x,y)&&f[x][y]!='1'){
        q.push(S{now.c+(f[x][y]=='*'),pii(x,y)});
      }
    }
  }
  if(DEBUG){for(auto i:dp){for(auto j:i)cerr<<setw(4)<<(j)<<" ";cerr<<endl;}cerr<<endl;}
  return dp[end.X][end.Y];
}



int solve(){
  f.clear();f.resize(2*h-1);
  for(int i=0;i<f.size();i++){
    getline(cin,f[i]);
    if(i%2==0)f[i]=f[i]+=' ';
  }
  for(int i=0;i<f.size();i+=2){
    for(int j=0;j<f[i].size();j+=2){
      f[i][j]='*';
    }
  }
  for(int i=0;i<f.size();i++){
    for(int j=0;j<f[i].size();j++){
      if(f[i][j]==' '){
        f[i][j]='1';
      }
    }
  }
  if(DEBUG){for(auto i:f)cerr<<i<<endl;cerr<<endl;}
  return find(pii(0,0),pii(f.size()-1,f[f.size()-1].size()-1));
}

int main(){
  while(start()){
    cout<<solve()<<endl;
  }
}

C++: #include <bits/stdc++.h>
using namespace std;

vector<int> mw={1,-1,0,0};
vector<int> mh={0,0,1,-1};

int main()
{
int w,h,W,H;scanf("%d %d",&w,&h);
vector<vector<int>> board(30,vector<int>(30,0));board[0][0]=1;
vector<vector<int>> hwall(30,vector<int>(29));
vector<vector<int>> vwall(29,vector<int>(30));
queue<pair<int,int>> que;
while(w!=0&&h!=0)
{
que.push(make_pair(0,0));
for(int i=0;i<h;i++)
{
for(int j=0;j<w-1;j++)scanf("%d",&hwall[i][j]);
if(i==h-1)continue;
for(int j=0;j<w;j++)scanf("%d",&vwall[i][j]);
}
while(!que.empty())
{
H=que.front().first;W=que.front().second;que.pop();
if(H==h-1&&W==w-1){while(!que.empty()){que.pop();}break;}
for(int i=0;i<4;i++)
{
if(W+mw[i]<0||W+mw[i]>w-1||H+mh[i]<0||H+mh[i]>h-1)continue;
if(i==0&&hwall[H][W]==1)continue;
else if(i==1&&hwall[H][W-1]==1)continue;
else if(i==2&&vwall[H][W]==1)continue;
else if(i==3&&vwall[H-1][W])continue;
if(board[H+mh[i]][W+mw[i]]!=0)continue;
board[H+mh[i]][W+mw[i]]=board[H][W]+1;
que.push(make_pair(H+mh[i],W+mw[i]));
}
}
printf("%d\n",board[h-1][w-1]);
for(int i=0;i<h;i++)for(int j=0;j<w;j++)board[i][j]=0;
board[0][0]=1;
scanf("%d %d",&w,&h);
}
}