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++: /*************************************************************************
	> File Name: amazingmazes.cpp
	> Author: 
	> Mail: 
	> Created Time: Mon 14 May 2018 09:53:23 PM CST
 ************************************************************************/

#include<iostream>
#include<cstring>
#include<queue>
using namespace std;

int distance1[100][100];
char mg[100][100];
int judge[100][100];
int w,h;

struct Point{
int x,y;
};

queue<Point> line;
int gox[4] = {0,0,2,-2};
int goy[4] = {-2,2,0,0};
int jgox[4] = {0,0,1,-1};
int jgoy[4] = {-1,1,0,0};

bool bfs(){
    if(h==1&&w==1)return true;
    while(1){
if(line.empty())return false;
        int x = line.front().x;
        int y = line.front().y;
        line.pop();
      //  cout<<x<<" "<<y<<endl;
        for(int i=0;i<4;i++){
            int nowx = x + gox[i];
            int nowy = y + goy[i];
            if(nowx>=1&&nowx<=(2*h-1)&&nowy>=1&&nowy<=(2*w-1)&&judge[nowx][nowy]==0&&mg[x+jgox[i]][y+jgoy[i]]!='1'){
                if(nowx==(2*h-1)&&nowy==(2*w-1)) {distance1[nowx][nowy] = distance1[x][y] + 1;return true;}
                judge[nowx][nowy] = 1;
                distance1[nowx][nowy] = distance1[x][y]+1;
                Point p;
                p.x = nowx;
                p.y = nowy;
                line.push(p);
            }
        }
    }
}

int main(){
    while(cin>>w>>h&&w&&h){
        memset(judge,0,sizeof(judge));
        memset(mg,0,sizeof(mg));
        memset(distance1,0,sizeof(distance1));
        for(int i=1;i<=2*h-1;i++){
            cin.get();
            for(int j=1;j<=2*w-2+(i+1)%2;j++){
              cin.get(mg[i][j]);
            }
        }
        /*for(int i=1;i<=2*h-1;i++){
            for(int j=1;j<=2*w-1;j++){
              cout<<mg[i][j];
            }
            cout<<endl;
    }*/
        Point first;
        first.x = 1;
        first.y = 1;
        line.push(first);
        judge[1][1] = 1;
        distance1[1][1] = 1;
    bool result = bfs();
        if(result==true)
        cout<<distance1[2*h-1][2*w-1]<<endl;
        else cout<<"0"<<endl;
    }
        return 0;
}

C++: #include <iostream>
#include <queue>
#include <map>
#define MAX_H 30
#define MAX_W 30
#define INF 10000000
using namespace std;

typedef pair<int , int> P;
int w,h,path[MAX_W][MAX_H+1],sx,sy,gx,gy,maze[MAX_W][MAX_H+1];
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};

int bfs(){
  queue<P> que;

  for( int i = 0; i < MAX_W ; i++ )
    for( int j = 0; j < MAX_H ; j++ ) path[i][j] = INF;

  que.push(P(sx,sy));
  path[sx][sy] = 0;

  while( que.size() ){
    P p = que.front(); que.pop();

    if( p.first == gx && p.second == gy ) break;

    for( int i = 0 ; i < 4 ; i++ ){
      int nx = p.first + dx[i] , ny = p.second + dy[i];

      if( 0 <= nx && nx < w && 0 <= ny && ny < h && maze[nx][ny] !=1 && path[nx][ny] == INF ){
	que.push(P(nx,ny));
	path[nx][ny] = path[p.first][p.second] + 1;
      }
    }
  }
  return path[gx][gy];
}

int main(void){

  while(1){

  cin >> w >> h;

  if( w == 0 && h == 0 ) break;

  for( int i = 0 ; i <= 2 * h - 1 ; i++ )
    for( int j = 0; j <= (i%2)?1:0 ; j++ )   
      cin >> maze[i][j];

  cout << bfs() << endl;

  }
  return 0;
}