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 <string> 
#include <vector> 
#include <cmath> 
#include <algorithm> 
#include <cstdlib> 
#include <ctime> 
#include <cstdio> 
#include <functional> 
#include <set> 
#include <sstream> 
#include <queue>

using namespace std; 

typedef pair<int,int> P;

int W,H;

bool pass[900][900];

//スタートからの距離
int d[50][50];

//上下左右
const int dw[4]={0,0,-1,1};
const int dh[4]={-1,1,0,0};

const int INF=10000;


void bfs(){
	queue<P> que;
	for(int i=0;i<50;i++){
		for(int j=0;j<50;j++){
			d[i][j]=INF;
		}
	}
	que.push(P(0,0));
	d[0][0]=1;

	while(!que.empty()){
		int h,w;
		h=que.front().first;
		w=que.front().second;
		que.pop();
		if(h==H-1 && w==W-1) break;


		for(int i=0;i<4;i++){
			//隣の座標
			int nh=h+dh[i];
			int nw=w+dw[i];

			//現在，次の頂点番号
			int n=W*h+w;
			int m=W*nh+nw;

			if(0<=nh && nh<H && 0<=nw && nw<W && pass[n][m] && d[nh][nw]==INF){
				que.push(P(nh,nw));
				d[nh][nw]=d[h][w]+1;
			}

		}

	}

}


int main(){



	while(cin>>W>>H,W){

		for(int i=0;i<900;i++)
			for(int j=0;j<900;j++) pass[i][j]=false;



		//マップ読み込み
		for(int i=0;i<2*H-1;i++){
			//右に移動が可能か
			if(i%2==0){
				for(int j=0;j<W-1;j++){
					int c;
					cin>>c;

					int h=i/2,w=j;
					if(c==0){
						 pass[W*h+w][W*h+(w+1)]=pass[W*h+(w+1)][W*h+w]=true;
					}
				}
			}//下に移動が可能か
			else{
				for(int j=0;j<W;j++){
					int c;
					cin>>c;

					int h=i/2,w=j;
					if(c==0){
						 pass[W*h+w][W*(h+1)+w]=pass[W*(h+1)+w][W*h+w]=true;
					}
				}
			}
		}


		bfs();
		if(d[H-1][W-1]==INF) d[H-1][W-1]=0;
		cout<<d[H-1][W-1]<<endl;

	}

	return 0;
}

C++: #include <iostream>
#include <queue>
using namespace std;
int maze[60][60];
int w,h;

struct node{
  int x,y,z;
  node(int x,int y,int z):x(x),y(y),z(z){}
  node(){}
};
/*void dfs(int x,int y,int ans){
  //if(x==w*2-2 && y==h*2-2)return;
  if(x>=w*2-1 || x<0 || y>=h*2-1 ||y<0)return;
  else{
    if(maze[y][x]!=-1 || maze[y][x]<ans)return;
    maze[y][x] = ans;
    if(x!=w*2-2 && maze[y][x+1]==0)dfs(x+2,y,ans+1);
    if(x!=0 && maze[y][x-1]==0)dfs(x-2,y,ans+1);
    if(y!=h*2-2 && maze[y+1][x]==0)dfs(x,y+2,ans+1);
    if(y!=0 && maze[y-1][x]==0)dfs(x,y-2,ans+1);
  }
  return;
}*/

int main(){
  int i,j,k,ans;
  while(1){
    queue<node> que;
    node now;
    ans = 0;
    cin >> w >> h;
    if(w == 0)break;
    for(i=0;i<60;i++)for(j=0;j<60;j++)maze[i][j]=-1;
    for(i=0;i<h*2-1;i++){
      for(j=0;j<w*2-1;j++){
        if((i+j)%2!=0)cin>>maze[i][j];
      }
    }
    que.push(node(0,0,1));
    while(!que.empty()){
      now = que.front();
      que.pop();
      if(maze[now.y][now.x]!=-1)continue;
      maze[now.y][now.x] = now.z;
      if(now.x+2<w*2-1 && maze[now.y][now.x+1]==0)que.push(node(now.x+2,now.y,now.z+1));
      if(now.x!=0 && maze[now.y][now.x-1]==0)que.push(node(now.x-2,now.y,now.z+1));
      if(now.y!=h*2-2 && maze[now.y+1][now.x]==0)que.push(node(now.x,now.y+2,now.z+1));
      if(now.y!=0 && maze[now.y-1][now.x]==0)que.push(node(now.x,now.y-2,now.z+1));
    }
    /*for(i=0;i<h*2-1;i++){
      for(j=0;j<w*2-1;j++){
        cout << maze[i][j];
      }
      cout << endl;
    }*/
    if(maze[i-1][j-1]==-1)maze[i-1][j-1]=0;
    cout << maze[i-1][j-1] << endl;
  }
  return 0;
}

C++: 
#include<iostream>
#include<queue>
using namespace std;

int main(){
  int w,h;
  int map[30][30];		//?£???????,???,???,??????????????????????????????1,2,4,8????????????
  while(cin >> w >> h && w>0 && h>0){
    for(int i=0;i<h;i++)
      for(int j=0;j<w;j++)
        map[i][j]=0;

    for(int i=0;i<h;i++){
      for(int j=0;j<w;j++){
        if(i==0) map[i][j]|=1;
        else{
          int wall;
          cin >> wall;
          if(wall==1){
            map[i-1][j]|=8;
            map[i][j]|=1;
          }
        }
        if(i==h-1) map[i][j]|=8;
      }

      map[i][0]|=2;
      for(int j=1;j<w;j++){
        int wall;
        cin >> wall;
        if(wall==1){
          map[i][j-1]|=4;
          map[i][j]|=2;
        }
      }
      map[i][w-1]|=4;
    }

    int d[30][30];
    for(int i=0;i<h;i++)
      for(int j=0;j<w;j++)
        d[i][j]=0;

    d[0][0]=1;
    queue<int> cur;
    cur.push(0*w+0);
    int sh[4]={-w,-1,1,w};

    while(!cur.empty()){
      for(int i=0;i<4;i++){
        if((map[cur.front()/w][cur.front()%w] & (1<<i))==0 && d[(cur.front()+sh[i])/w][(cur.front()+sh[i])%w]==0){
          d[(cur.front()+sh[i])/w][(cur.front()+sh[i])%w]=d[cur.front()/w][cur.front()%w]+1;
          cur.push(cur.front()+sh[i]);
        }
      }
      cur.pop();
    }

    cout << d[h-1][w-1] << endl;
  }

  return 0;
}