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;
typedef pair<int,int> P;
int H,W;
int A[100][100],dist[100][100] = {};
int dx[4] = {-2,2,0,0},dy[4] = {0,0,-2,2};

bool in(int x,int y){
	return 1<=x && x<=2*H-1 && 1<=y && y<=2*W-1;
}

int main(){
	while(cin >> W >> H && W>0){
		for(int i=1;i<=2*H-1;i++){
			for(int j=1;j<=2*W-1;j++){
				A[i][j] = -1;
				dist[i][j] = -1;
			}
		}
		for(int i=1;i<=2*H-1;i++){
			if(i%2==1){
				for(int j=1;j<=W-1;j++) cin >> A[i][2*j];
			}else{
				for(int j=1;j<=W;j++) cin >> A[i][2*j-1];
			}
		}
		dist[1][1] = 1;
		queue<P> Q;
		Q.push(P(1,1));
		while(!Q.empty()){
			P p = Q.front(); Q.pop();
			int x = p.first,y = p.second;
			for(int i=0;i<4;i++){
				int nx = x+dx[i],ny = y+dy[i];
				if(in(nx,ny) && A[x+dx[i]/2][y+dy[i]/2]==0 && dist[nx][ny]==-1){
					dist[nx][ny] = dist[x][y]+1;
					Q.push(P(nx,ny));
				}
			}
		}
		cout << (dist[2*H-1][2*W-1]!=-1? dist[2*H-1][2*W-1]:0) << endl;
	}
}

C++: #include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <iostream>
#include <deque>
#include <complex>
#include <string>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <valarray>
#include <iterator>
using namespace std;

typedef long long int lli;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;

struct P {int x, y, z; P(int x, int y, int z):x(x), y(y), z(z){}};

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RREP(i,x) for(int i=(x);i>=0;i--)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)

//FILE *in = freopen("B", "r", stdin);

int n, m;
char data[100][100];
int ch[100][100];

int mvx[4] = {0, 1, 0, -1};
int mvy[4] = {1, 0, -1, 0};

int maxn, maxm;

void input(){
	memset(data, 0, sizeof(data));
	memset(ch , 0, sizeof(ch));
	maxn = n*2+1;
	maxm = m*2 + 1;
	gets(data[0]);
	fill(data[0], data[0] + maxn, '1');
	for(int i = 1; i <= m * 2 - 1; i++) {
		gets(data[i]+1);
		data[i][0] = '1';
		data[i][maxn-1] = '1';
	}
	fill(data[maxm-1], data[maxm-1] + maxn, '1');
}

void process() {
	queue<P> que;
	que.push(P(1,1,1));
	ch[1][1] = 1;
	while(!que.empty()) {
		P cur = que.front(); que.pop();

		if(cur.x == maxn - 2 && cur.y == maxm-2) {
			printf("%d\n", cur.z);
			return;
		}

		for(int i = 0; i < 4; i ++) {
			if(cur.x + mvx[i]*2 >= 0 && cur.x + mvx[i]*2 <= maxn - 1 && cur.y + mvy[i]*2 >= 0 && cur.y + mvy[i]*2 < maxm
				&& data[cur.y + mvy[i]][cur.x + mvx[i]] != '1' && !ch[cur.y + mvy[i]*2][cur.x + mvx[i]*2]) {
					ch[cur.y + mvy[i]*2][cur.x + mvx[i]*2] = 1;
					que.push(P(cur.x + mvx[i]*2, cur.y + mvy[i]*2, cur.z + 1));
			}
		}
	}
	printf("0\n");
}

int main() {
	while(true){
		scanf("%d%d", &n, &m);
		if(n == 0 && m == 0)break;
		input();
		process();
	}
	return 0;
}

C++: #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ll long long
#define ull unsigned long long
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

using namespace std;

int main(){
  int w,h;
  while(cin >> w >> h){
    if(!w)break;
    vector<vector<int>> mp(2*h-1,vector<int>(2*w-1,0));
    int W = 2*w-1;
    int H = 2*h-1;
    for(int i=0;i<H-2;i+=2){
	for(int j=0;j<W-2;j+=2){
	cin >> mp[i][j+1];
      }
      for(int j=0;j<W;j+=2){
	cin >> mp[i+1][j];
      }
    }
    for(int j=0;j<W-2;j+=2){
      cin >> mp[H-1][j+1];
    }
    /*    REP(i,H){
      REP(j,W)cout << mp[i][j] << " ";
      cout << endl;
      }*/
    queue<pair<int,int>> que;
    que.push(make_pair(0,0));
    mp[0][0] = 1;
    while(que.size()){
      pair<int,int> p = que.front();
      que.pop();
      for(int k=0;k<4;k++){
	int y = p.first+2*dy[k];
	int x = p.second+2*dx[k];
	if(x>=0 && x<W && y>=0 && y<H){
	  if(mp[p.first+dy[k]][p.second+dx[k]])continue;
	  if(mp[p.first][p.second]+1 > mp[y][x] && mp[y][x]>0)
	    continue;
	  else{
	    mp[y][x] = mp[p.first][p.second]+1;
	    que.push(make_pair(y,x));
	  }
	}
      }
    }
    cout << mp[H-1][W-1] << endl;
  }
    return 0;
}