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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
const ll MOD = 1000000007;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(5e5 + 5);
const double EPS = 1e-10;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).begin(), (v).end())
#define ALL(v) (v).begin(), (v).end()

int h, w, d[35][35];
int row[35][35], cul[35][35];

bool isIn(int i, int j){
    return i>=0 && i<h && j>=0 && j<w;
}

int bfs(){
    REP(i,h)fill(d[i],d[i]+w,IINF);
    queue<P> que;
    que.push({0,0});
    d[0][0] = 1;
    while(!que.empty()){
        P p = que.front();
        que.pop();
        int pi = p.first, pj = p.second;
        REP(k,4){
            int ni = pi + di[k], nj = pj + dj[k];
            if(!isIn(ni,nj))continue;
            if(di[k]!=0 && cul[pi+max(0,di[k])][pj])continue;
            if(dj[k]!=0 && row[pi][pj+max(0,dj[k])])continue;
            if(d[ni][nj]!=IINF)continue;
            que.push({ni,nj});
            d[ni][nj] = d[pi][pj]+1;
        }
    }
    return (d[h-1][w-1]!=IINF?d[h-1][w-1]:0);
}

int main() {
    while(1){
        cin >> w >> h;
        if(w==0)break;
        REP(i,2*h-1){
            if(i%2==0){
                REP(j, w-1){
                    cin >> row[i/2][j+1];
                }
            }
            else{
                REP(j, w){
                    cin >> cul[i/2+1][j];
                }
            }
        }

        cout << bfs() << endl;
    }
    return 0;
}

C++: #include <iostream>
#include <queue>
#include <map>
#include <utility>

using namespace std;
int data[70][31]={};
int visit[31][31]={};
int ans[31][31]={1};

int main(){
	int w,h;
	while(cin>>w>>h){
		for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){
				visit[i][j]=0;
				ans[i][j]=0;
			}
		}
		ans[0][0]=1;
		if(!w && !h){
			break;
		}
		for(int i=0;i<2*h-1;i++){
			if(i%2==0){
				for(int j=0;j<w-1;j++){
					cin>>data[i][j];
				}
			}
			else{
				for(int j=0;j<w;j++){
					cin>>data[i][j];
				}
			}
		}

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

		queue<pair<int,int> > q;
		q.push(make_pair(0,0));
		int dx[4]={-1,0,1,0};
		int dy[4]={0,-1,0,1};
		while(1){
			if(q.empty()){
				//cout<<"can't find"<<endl;
				break;
			}
			pair<int,int> now;
			now=q.front();
			q.pop();
			if(h-1==now.first && w-1==now.second){
				break;
			}
			//cout<<now.first<<" "<<now.second<<" "<<visit[now.first][now.second]<<endl;
			/*if(visit[now.first][now.second]){
				//cout<<"visited"<<endl;
				continue;
			}*/
			visit[now.first][now.second]=1;
			for(int i=0;i<4;i++){
				if(h>now.first+dy[i] && 0<=now.first+dy[i] && w>now.second+dx[i] && 0<=now.second+dx[i] && visit[now.first+dy[i]][now.second+dx[i]]==0){
					if(i==0 && data[2*now.first][now.second-1]==0){
						//cout<<"hidari"<<endl;
						q.push(make_pair(now.first+dy[i],now.second+dx[i]));
						ans[now.first+dy[i]][now.second+dx[i]]=ans[now.first][now.second]+1;
					}
					else if(i==1 && data[2*now.first-1][now.second]==0){
						//cout<<"ue"<<endl;
						q.push(make_pair(now.first+dy[i],now.second+dx[i]));
						ans[now.first+dy[i]][now.second+dx[i]]=ans[now.first][now.second]+1;
					}
					else if(i==2  && data[2*now.first][now.second]==0){
						//cout<<"migi"<<endl;
						q.push(make_pair(now.first+dy[i],now.second+dx[i]));
						ans[now.first+dy[i]][now.second+dx[i]]=ans[now.first][now.second]+1;
					}
					else if(i==3 && data[2*now.first+1][now.second]==0){
						//cout<<"sita"<<endl;
						q.push(make_pair(now.first+dy[i],now.second+dx[i]));
						ans[now.first+dy[i]][now.second+dx[i]]=ans[now.first][now.second]+1;
					}
				}
			}
		}
		cout<<ans[h-1][w-1]<<endl;
	}
	return 0;
}