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 <array>
#include <cstdint>
#include <iostream>
#include <vector>

using namespace std;
void dfs(array<array<uint32_t, 30>, 30> &maze, int32_t h, int32_t w,
         vector<vector<uint32_t>> &vwalls, vector<vector<uint32_t>> &pwalls,
         uint32_t depth) {
  // cerr << h << " " << w << " " << depth << endl;
  maze[h][w] = depth;
  if (pwalls[h][w] == 0 && depth + 1 < maze[h][w + 1]) {
    dfs(maze, h, w + 1, vwalls, pwalls, depth + 1);
  }
  if (h - 1 > 0 && vwalls[h - 1][w] == 0 && depth + 1 < maze[h - 1][w]) {
    dfs(maze, h - 1, w, vwalls, pwalls, depth + 1);
  }
  if (vwalls[h][w] == 0 && depth + 1 < maze[h + 1][w]) {
    dfs(maze, h + 1, w, vwalls, pwalls, depth + 1);
  }
  if (w - 1 > 0 && pwalls[h][w - 1] == 0 && depth + 1 < maze[h][w - 1]) {
    dfs(maze, h, w - 1, vwalls, pwalls, depth + 1);
  }
}

int32_t main() {
  while (true) {
    int32_t w, h;
    cin >> w >> h;
    if (w == 0) break;

    array<array<uint32_t, 30>, 30> maze;
    for (uint32_t i = 0; i < maze.size(); i++) {
      for (uint32_t j = 0; j < maze[i].size(); j++) {
        maze[i][j] = UINT32_MAX;
      }
    }

    vector<vector<uint32_t>> vwalls;
    vector<vector<uint32_t>> pwalls;

    for (uint32_t i = 0; i < 2 * h - 1; i++) {
      uint32_t block;
      if (i % 2 == 0) {
        vector<uint32_t> walls;
        for (uint32_t j = 0; j < w - 1; j++) {
          cin >> block;
          walls.push_back(block);
        }
        walls.push_back(1);
        pwalls.push_back(walls);
      } else {
        vector<uint32_t> walls;
        for (uint32_t j = 0; j < w; j++) {
          cin >> block;
          walls.push_back(block);
        }
        vwalls.push_back(walls);
      }
    }

    vector<uint32_t> senti;
    for (uint32_t j = 0; j < w; j++) {
      senti.push_back(1);
    }
    vwalls.push_back(senti);

    dfs(maze, 0, 0, vwalls, pwalls, 1);
    if (maze[h - 1][w - 1] == UINT32_MAX) {
      cout << 0 << endl;
    } else {
      cout << maze[h - 1][w - 1] << endl;
    }
  }

  return 0;
}

C++: #include <bits/stdc++.h>

#define rep(i, n) for(int i = 0; i < n; i++)

typedef long long ll;
using namespace std;
int mod = 1000000007;

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

ll cost[1000];
bool kakutei[1000];

vector<int> nodes[1000];

void init(){
    rep(i, 1000) cost[i] = mod;
    rep(i, 1000) kakutei[i] = false;
    rep(i, 1000) nodes[i].clear();
}

void dijk(int s){
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    pq.push(make_pair(1, s));
    cost[s] = 1;
    while(!pq.empty()){
        pair<ll, int> op = pq.top();
        pq.pop();
        int id = op.second;
        ll c = op.first;
        if(kakutei[id]) continue;
        kakutei[id] = true;
        rep(i, nodes[id].size()){
            int to = nodes[id][i];
            if(c+1 < cost[to]){
                cost[to] = c+1;
                pq.push(make_pair(c+1, to));
            }
        }
    }
}

int main(void){
    //右: 0, 上: 1, 左: 2, 下: 3
    vector<int> ans;
    int H, W;
    while(true){
        init();
        cin >> W >> H;
        if(W == 0) break;
        int input_loop = 2*H-1;
        rep(i, input_loop){
            int id = i/2;
            int st = id*W;
            if(i % 2){
                rep(j, W){
                    int temp; cin >> temp;
                    if(temp == 0){
                        nodes[st+j].push_back(st+j+W);
                        nodes[st+j+W].push_back(st+j);
                    }
                }
            }
            else{
                rep(j, W-1){
                    int temp; cin >> temp;
                    if(temp == 0){
                        nodes[st+j].push_back(st+1+j);
                        nodes[st+1+j].push_back(st+j);
                    }
                }
            }
        }
        dijk(0);

        /*
        rep(i, H){
            rep(j, W){
                cout << cost[i*W+j] << " ";
            }
            cout << endl;
        }
        */
        ans.push_back(cost[H*W-1]);
    }
    rep(i, ans.size()){
        if(ans[i] != mod)cout << ans[i] << endl;
        else cout << 0 << endl;
    }
    return 0;
}