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

struct Node{
	bool done;
	int cost;
};

int main() {
	// your code goes here
	int w, h;
	while(cin >> w >> h, w){
		int vmaze[30][30] = {};
		int hmaze[30][30] = {};
		Node node[30][30];
		for(int i=0; i<w; i++){
			for(int j=0; j<h; j++){
				node[i][j].done = false;
				node[i][j].cost = 900;
			}
		}
		for(int i=0; i<2*h-1; i++){
			if(i%2 == 0){
				for(int j=0; j<w-1; j++){
					cin >> vmaze[j][i/2];
				}
			}
			else {
				for(int j=0; j<w; j++){
					cin >> hmaze[j][i/2];
				}
			}
		}
		node[0][0].cost = 0;
		while(1){
			int di = -1, dj = -1;
			for(int i=0; i<w; i++){
				for(int j=0; j<h; j++){
					if(node[i][j].done == true) continue;
					if(node[i][j].cost == 900) continue;
					if(di < 0 || node[i][j].cost < node[di][dj].cost){
						di = i; dj = j;
					}
				}
			}
			if(di == -1) break;
			node[di][dj].done = true;
			
			// cout << di << " " << dj << " " << node[di][dj].cost << endl;
			
			if(dj>0 && hmaze[di][dj-1]==0){
				node[di][dj-1].cost = min(node[di][dj-1].cost, node[di][dj].cost + 1);
			}
			if(dj<h-1 && hmaze[di][dj]==0){
				node[di][dj+1].cost = min(node[di][dj+1].cost, node[di][dj].cost + 1);
			}
			if(di>0 && vmaze[di-1][dj]==0){
				node[di-1][dj].cost = min(node[di-1][dj].cost, node[di][dj].cost + 1);
			}
			if(di<w-1 && vmaze[di][dj]==0){
				node[di+1][dj].cost = min(node[di+1][dj].cost, node[di][dj].cost + 1);
			}
		}
		cout << (node[w-1][h-1].cost==900?0:node[w-1][h-1].cost+1) << endl;
	}
	return 0;
}

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

int dx[] = {-1, 0,+1, 0};
int dy[] = { 0,+1, 0,-1};

int node[32][32],v[32][32];

int main()
{
	int w,h,c;
	while(cin >> w >> h, (w||h))
	{
		memset(v,0,sizeof(v));
		memset(node,0,sizeof(node));

		for(int l=0; l<2*h-1; l++)
		{
			int y=l/2;

			if(l%2)
			{
				for(int x=0; x<w; x++)
				{
					cin >> c;
					if(c==0)
					{
						node[x][y]   |= 1<<1;
						node[x][y+1] |= 1<<3;
					}
				}
			}
			else
			{
				for(int x=0; x<w-1; x++)
				{
					cin >> c;
					if(c==0)
					{
						node[x]  [y] |= 1<<2;
						node[x+1][y] |= 1<<0;
					}
				}
			}
		}

		queue<int> q; q.push(0); q.push(0);

		int ans=0,tim=0;
		while(!q.empty())
		{
			tim++;

			int qlen = q.size()/2;
			for(int j=0; j<qlen; j++)
			{
				int px = q.front(); q.pop();
				int py = q.front(); q.pop();
				if(px==w-1 && py==h-1)
				{
					ans=tim; break;
				}
				v[px][py] = 1;

				for(int i=0; i<4; i++)
				{
					if(node[px][py] & (1<<i))
					{
						int nx = px+dx[i];
						int ny = py+dy[i];

						if(!v[nx][ny])
						{
							q.push(nx);
							q.push(ny);
							v[nx][ny] = 1;
						}
					}
				}
			}

			if(ans) break;
		}

		cout << ans << endl;
	}
}

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));
					if(sl[ny][nx] > sl[p.second][p.first] + 1)
						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;
}