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 <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<i_i, int> p_i;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
template<class T> using vv=vector<vector<T> >;
typedef deque<int> di;
typedef deque<deque<int> > ddi;

int main() {
  vi results;

  while (true) {
    int w, h;
    cin >> w >> h;
    if (w==0) { break; }
    vvi vertical(h, vi(w+1, 1));
    vvi horizontal((h+1), vi(w, 1));
    
    for (int iw = 1; iw < w; iw++) {
      cin >> vertical[0][iw];
    }
    for (int ih = 1; ih < h; ih++) {
      for (int iw_hor = 0 ; iw_hor < w ; iw_hor++) {
        cin >> horizontal[ih][iw_hor];
      }
      for (int iw_ver = 1; iw_ver < w; iw_ver++) {
        cin >> vertical[ih][iw_ver];
      }
    }

    vvi md(h, vi(w, INT_MAX)); // min_distance, INT_MAX: not reached
    md[0][0] = 1;
    ddi bfs = {{0, 0}};
    while (!bfs.empty()) {
      di current = bfs.front(); // {h, w}
      vvi fq_ver = {{1, 1}, {0, -1}}; // wall, grid
      vvi fq_hor = {{1, 1}, {0, -1}}; // wall, grid
      for (auto dir : fq_ver) {
        if (vertical[current[0]][current[1] + dir[0]] == 0 &&
            md[current[0]][current[1] + dir[1]] == INT_MAX) {
          md[current[0]][current[1] + dir[1]] = md[current[0]][current[1]] + 1;
          bfs.push_back({current[0], current[1] + dir[1]});
        }
      }
      for (auto dir : fq_hor) {
        if (horizontal[current[0] + dir[0]][current[1]] == 0 &&
            md[current[0] + dir[1]][current[1]] == INT_MAX) {
          md[current[0] + dir[1]][current[1]] = md[current[0]][current[1]] + 1;
          bfs.push_back({current[0] + dir[1], current[1]});
        }
      }
      bfs.pop_front();
    }
    if (md[h-1][w-1] == INT_MAX) {
      md[h-1][w-1] = 0;
    }
    results.push_back(md[h-1][w-1]);
  }

  for (int i = 0 ; i < results.size() ; i++) {
    printf("%d\n", results[i]);
  }

  return 0;
}

C++: #include<iostream>
#include<queue>
#include<limits.h>
using namespace std;
int dy[] = { 0, 1, 0, -1 };
int dx[] = { 1, 0, -1, 0 };
static int map[1000][1000];
static int minPath[1000][1000];
typedef struct d Data;
struct d
{
	int x;
	int y;
	int count;
};
int main()
{
	int w, h;
	while (cin >> w >> h && w != 0 || h != 0)
	{
		for (int i = 0; i < 1000; i++)
		{
			for (int j = 0; j < 1000; j++)
			{
				map[i][j] = 0;
			}
		}

		for (int i = 0; i < h + (h - 1); i++)
		{
			for (int j = (i + 1) % 2; j < w + (w - 1); j+=2)
			{
				cin >> map[i][j];
			}
		}
		for (int i = 0; i < h + (h - 1); i++)
		{
			for (int j = 0; j < w + (w - 1); j++)
			{
				minPath[i][j] = INT_MAX;
			}
		}

		int ans = 0;
		queue<Data> q;
		Data first;
		first.x = 0;
		first.y = 0;
		first.count = 1;
		q.push(first);
		minPath[0][0] = 1;
		while (q.size() > 0)
		{
			Data data = q.front(); q.pop();
			if (data.x == w + (w - 1) - 1 && data.y == h + (h - 1) - 1)
			{
				ans = data.count;
				break;
			}

			for (int i = 0; i < 4; i++)
			{
				int nx = data.x + dx[i] * 2;
				int ny = data.y + dy[i] * 2;
				if (nx < 0 || nx >= w + (w - 1) || ny < 0 || ny >= h + (h - 1))continue;
				int px = data.x + dx[i];
				int py = data.y + dy[i];
				if (map[py][px] == 1)continue;
				if (data.count + 1 > minPath[ny][nx])continue;
				Data d;
				d.x = nx;
				d.y = ny;
				d.count = data.count + 1;
				minPath[ny][nx] = d.count;
				q.push(d);
			}
		}
		cout << ans << endl;


	}
	return 0;
}