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>


/*TIME:27min*/

using namespace std;

int main(){
	int w,h;

	int wallX[40][40];
	int wallY[40][40];
	int flag[40][40];

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

	while(cin>>w>>h){
		if(w==0&&h==0)break;

		for(int i=0;i<40;i++){
			for(int j=0;j<40;j++){
				wallX[i][j]=-1;
				wallY[i][j]=-1;
				flag[i][j]=1;
			}
		}

		for(int i=1;i<=h;i++){
			for(int j=1;j<=w;j++){
				flag[i][j]=0;
			}
		}

		for(int i=1;i<=h;i++){
			for(int j=1;j<=w-1;j++){
				cin>>wallX[i][j];
			}

			if(i==h)break;

			for(int j=1;j<=w;j++){
				cin>>wallY[i][j];
			}
		}

		/*
		for(int i=1;i<=h;i++){
			cout<<" ";
			for(int j=1;j<w;j++){
				if(wallX[i][j]==1){
					cout<<"| ";
				}
				else{
					cout<<"  ";
				}
			}
			cout<<endl;
			for(int j=1;j<=w;j++){
				if(wallY[i][j]==1){
					cout<<"- ";
				}
				else{
					cout<<"  ";
				}
			}
			cout<<endl;
		}
		*/


		//BFS
		queue<int> x;
		queue<int> y;
		queue<int> cnt;
		int ansFlag=0;

		x.push(1);
		y.push(1);
		cnt.push(1);
		flag[1][1]=1;

		while(x.size()!=0){
			int topX = x.front();
			int topY = y.front();
			int topCnt=cnt.front();
			x.pop();
			y.pop();
			cnt.pop();

			if(topX == w && topY ==h){
				cout<<topCnt<<endl;
				ansFlag=1;
				break;
			}

			for(int i=0;i<4;i++){
				int afterX = topX+dx[i];
				int afterY = topY+dy[i];
				if(flag[afterY][afterX] == 0){
					if(i%2==0){
						if(wallX[afterY][afterX-1]==0){
							x.push(afterX);
							y.push(afterY);
							cnt.push(topCnt+1);
							flag[afterY][afterX]=1;
						}
					}
					else{
						if(wallY[afterY-1][afterX]==0){
							x.push(afterX);
							y.push(afterY);
							cnt.push(topCnt+1);
							flag[afterY][afterX]=1;
						}
					}
				}
			}
		}
		if(ansFlag==0){
			cout<<0<<endl;
		}

	}

	return 0;
}

C++: #include <iostream>
#include <vector>
#include <queue>
using namespace std;
using P = pair<int, int>;

int main() {
    int w, h;
    while(cin >> w >> h, w) {
        vector<vector<int>> W(2*h-1);
        vector<vector<int>> ret(w, vector<int>(h, 0));
        for(int i=0; i<2*h-1; ++i) {
            int j_range = i%2 == 0 ? w-1 : w;
            for(int j=0; j<j_range; ++j) {
                int tmp; cin >> tmp;
                W[i].push_back(tmp);
            }
        }

        queue<P> que;
        ret[0][0] = 1;
        que.push(make_pair(0, 0));
        while(!que.empty()) {
            P p = que.front();
            que.pop();
            int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; // down, right, up, left
            int wy[4] = {p.second*2+1, p.second*2, p.second*2-1, p.second*2},
                wx[4] = {p.first, p.first, p.first, p.first-1};
            for(int i=0; i<4; ++i) {
                int nx = p.first + dx[i], ny = p.second + dy[i];
                if(0 <= nx && nx < w && 0 <= ny && ny < h && ret[nx][ny] == 0) {
                    if(W[wy[i]][wx[i]] != 1) {
                        que.push(make_pair(nx, ny));
                        ret[nx][ny] = ret[p.first][p.second] + 1;
                    }
                }
            }
        }
        cout << ret[w-1][h-1] << endl;
    }
}

C++: #include <iostream>
#include <climits>
#include <cstring>
#include <queue>

using namespace std;

bool field[100][100];
int w, h, dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1},
	dp[100][100];

void solve()
{
	queue<int> qux, quy;
	
	for( int j = 0; j < 2*h-1; j++)
		for( int i = 0; i < 2*w-1; i++)
			dp[j][i] = INT_MAX;
	
	dp[0][0] = 1;
	qux.push(0);
	quy.push(0);
	
	while( !qux.empty() && !quy.empty() )
	{

		int x = qux.front();
		int y = quy.front();

		qux.pop();
		quy.pop();
		
		for(int i = 0; i < 4; i++)
		{
			int nx = x + dx[i];
			int ny = y + dy[i];

			if( nx >= 0 && nx < 2*w-1 && ny >= 0 && ny < 2*h-1 && field[ny][nx] != 1 )
			{
				nx += dx[i];
				ny += dy[i];

				if( dp[ny][nx] > dp[y][x] + 1 )
				{
					dp[ny][nx] = dp[y][x] + 1;
					qux.push(nx);
					quy.push(ny);
				}
			}
		}

	}

	return;
}

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

		for(int j = 0; j < 2*h-1; j++)
		{
			if( j % 2 == 0 )
			{
				for(int i = 0; i < w-1; i++)
				{
					cin >> field[j][2*i+1];
				}
			}
			else
			{
				for(int i = 0; i < w; i++)
				{
					cin >> field[j][2*i];
				}
			}

		}

/*
//field表示用

		for( int j = 0; j < 2*h-1; j++)
		{
			for( int i = 0; i < 2*w-1; i++)
			{
				cout << field[j][i];
			}
			
			cout << endl;
		}
*/

		solve();

		if( dp[2*h-2][2*w-2] == INT_MAX )
			cout << '0' << endl;
		else
			cout << dp[2*h-2][2*w-2] << endl;
	}

	return 0;
}