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 <queue>
using namespace std;

int main() {

  long long int w, h;

  int walls[30][30];
  int wallv[30][30];

  while( true ) {

    cin >> w >> h;

    if ( w == 0 ) break;

    for ( long long int i = 0; i < h; i++ ) {

      for ( long long int j = 0; j < w - 1; j++ ) {
	cin >> walls[j][i];
      }
      if ( i == h - 1 ) break;
      for ( long long int j = 0; j < w; j++ ) {
	cin >> wallv[j][i];
      }

    }

    int map[30][30] = {};
    map[0][0] = 1;
    queue<int> qx, qy;
    qx.push(0);
    qy.push(0);

    while( qx.size() > 0 ) {

      int x = qx.front();
      int y = qy.front();
      qx.pop();
      qy.pop();

      if ( x > 0 ) {
	if ( walls[x-1][y] == 0 && map[x-1][y] == 0 ) {
	  map[x-1][y] = map[x][y] + 1;
	  qx.push(x-1);
	  qy.push(y);
	}
      }
      if ( x < w - 1 ) {
	if ( walls[x][y] == 0 && map[x+1][y] == 0 ) {
	  map[x+1][y] = map[x][y] + 1;
	  qx.push(x+1);
	  qy.push(y);
	}
      }
      if ( y > 0 ) {
	if ( wallv[x][y-1] == 0 && map[x][y-1] == 0 ) {
	  map[x][y-1] = map[x][y] + 1;
	  qx.push(x);
	  qy.push(y-1);
	}
      }
      if ( y < h - 1 ) {
	if ( wallv[x][y] == 0 && map[x][y+1] == 0 ) {
	  map[x][y+1] = map[x][y] + 1;
	  qx.push(x);
	  qy.push(y+1);
	}
      }

      if ( map[w-1][h-1] != 0 ) break;

    }

    cout << map[w-1][h-1] << endl;

  }

  return 0;

}

C++: #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string> 
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>

using namespace std;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int meiro[40][40][40][40];
int tesu[40][40];
int issearched[40][40];
int w, h;

void tansaku(int x, int y);

int main()
{
	while(1){
		cin >> w >> h;
		if(w == 0 && h == 0) break;
		for(int i = 0; i < h; i++){
			for(int j = 0; j < w; j++){
				tesu[i][j] = 0;
				issearched[i][j] = 0;
			}
		}
		for(int i = 0; i < h - 1; i++){
			for(int j = 0; j < w - 1; j++){
				cin >> meiro[j][i][j + 1][i];
			}
			for(int j = 0; j < w; j++){
				cin >> meiro[j][i][j][i + 1];
			}
		}
		for(int i = 0; i < w - 1; i++){
			cin >> meiro[i][h - 1][i + 1][h - 1];
		}
		tansaku(0, 0);
		cout << tesu[w - 1][h - 1] << endl;
	}
	return 0;
}

void tansaku(int a, int b)
{
	queue<pair<int, int> > qu;
	qu.push(pair<int, int>(a, b));
	tesu[a][b] = 1;
	issearched[a][b] = 1;
	int x, y, next_x, next_y;
	while(1){
		if(qu.empty()) break;
		x = (qu.front()).first;
		y = (qu.front()).second;
		for(int i = 0; i < 4; i++){
			next_x = x + dx[i];
			next_y = y + dy[i];
			if(next_x < 0 || next_x >= w || next_y < 0 || next_y >= h) continue;
			if(issearched[next_x][next_y] == 0 && meiro[x][y][next_x][next_y] == 0){
				issearched[next_x][next_y] = 1;
				tesu[next_x][next_y] = tesu[x][y] + 1;
				qu.push(pair<int, int>(next_x, next_y));
			}
		}
		qu.pop();
	}
	return;
}

C++: #include <stdio.h>
#include <queue>
#include <utility>

using namespace std;


int main(void){
	int h, w, i, j;
	int gx, gy, nx, ny;
	const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1}, INF = 0x7FFFFFFF;
	char maze[59][60];
	int sl[59][59];
	pair<int,int> p;
	queue<pair<int,int>> que;

	scanf("%d%d%*c",&w,&h);

	while(h != 0 || w != 0){

		for(i = 0;i < 2 * h - 1;i++){
			for(j = 0;j < 2 * w - 1;j++)
				maze[i][j] = getchar();
			getchar();
		}

		for(i = 0;i < 2 * h - 1;i++){
			for(j = 0;j < 2 * w - 1;j++)
				sl[i][j] = INF;
		}
		sl[0][0] = 1;
		que.push(pair<int,int>(0,0));
		gx = 2 * w - 2; gy = 2 * h - 2;
		while(que.size()){
			p = que.front(); que.pop();
			if(p.first == gx && p.second == gy)
				break;
			for(i = 0;i < 4;i++){
				nx = p.first + 2 * dx[i]; ny = p.second + 2 * dy[i];
				if(0 <= nx && nx < 2 * w - 1 && 0 <= ny && ny < 2 * h - 1 && sl[ny][nx] == INF && maze[p.second + dy[i]][p.first + dx[i]] == '0'){
					que.push(pair<int,int>(nx,ny));
					sl[ny][nx] = sl[p.second][p.first] + 1;
				}
			}
		}
		while(que.size())
			que.pop();
		if(sl[gy][gx] == INF)
			printf("0\n");
		else
			printf("%d\n",sl[gy][gx]);
		scanf("%d%d%*c",&w,&h);
	}
	return 0;
}