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>
#include <vector>
using namespace std;
int w,h;
char map[200][200];
class Node{
public:
	int x,y;
	int c;
	Node(int _x,int _y,int _c):x(_x),y(_y),c(_c){

	}
};
void show(){
	for(int i=0;i<h*2-1;i++){
		for(int j=0;j<w*2-1;j++)cout<<map[i][j];
		cout<<endl;
	}
	cout<<endl;
}
bool visited[200][200];
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
int bfs(){
//	for(int i=0;i<100;i++)fill(visited[i],visited[i]+100,false);
	queue<Node> q;
	q.push(Node(0,0,1));
//	visited[0][0]=true;
	int gw=2*w-2;
	int gh=2*h-2;
	while(!q.empty()){
		Node cur=q.front();q.pop();
		if(cur.x==gw&&cur.y==gh)return cur.c;
		for(int i=0;i<4;i++){
			int nx=cur.x+dx[i];
			int ny=cur.y+dy[i];
			if(nx<0||ny<0||nx>gw||ny>gh||map[ny][nx]=='1')continue;
			nx=nx+dx[i];
			ny=ny+dy[i];
			if(nx<0||ny<0||nx>gw||ny>gh||map[ny][nx]=='1')continue;
			map[ny][nx]='1';
			q.push(Node(nx,ny,cur.c+1));
		}
	}
	return 0;
}
void solve(){
	cout<<bfs()<<endl;
}
int main(){
	while(cin>>w>>h&&(w||h)){
		for(int i=0;i<100;i++)for(int j=0;j<100;j++)map[i][j]='0';
		int hline=h*2-1;
		for(int i=0;i<hline;i++){
			if(i%2){
				for(int j=0;j<w;j++)cin>>map[i][2*j];
			}
			else {
				for(int j=0;j<w-1;j++)cin>>map[i][1+2*j];

			}
		}
//		show();
		solve();
	}
	return 0;
}

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

using namespace std;

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

int main(){
    int w, h;
    string s[59];
    int step[30][30];
    while(cin >> w >> h, w){
        getline(cin, s[0]);
        for(int i=0;i<2*h-1;i++) getline(cin, s[i]);
        for(int i=0;i<2*h-1;i++) s[i] += " ";
        memset(step, -1, sizeof(step));
        queue< pair<int, int> > qu; qu.push(make_pair(0,0));
        step[0][0] = 1;
        while(!qu.empty()){
            pair<int, int> p = qu.front(); qu.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(nx<0||h<=nx||ny<0||w<=ny) continue;
                if(s[2*x+dx[i]][2*y+dy[i]]=='1') continue;
                if(step[nx][ny]!=-1) continue;
                step[nx][ny] = step[x][y] + 1;
                qu.push(make_pair(nx, ny));
            }
        }
        cout << (step[h-1][w-1] == -1 ? 0 : step[h-1][w-1]) << endl;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
const int INF = 100000;
typedef pair<int, int> P;
int w, h;
int ny,nx;
int main()
{
    while (cin >> w >> h)
    {
        int dis[h][w];
        bool wall[2][h][w];
        if (w == 0 && h == 0)
            return 0;
        for (int i = 0; i < h; i++)
        {
            for (int j = 0; j < w; j++)
            {
                dis[i][j] = INF;
            }
        }
        for (int i = 0; i < 2 * h - 1; i++)
        {
            //横
            if (i % 2 == 0)
            {
                for (int j = 0; j < w - 1; j++)
                {
                    cin >> wall[0][i / 2][j];
                }
            }
            //縦
            else
            {
                for (int j = 0; j < w; j++)
                {
                    cin >> wall[1][i / 2][j];
                }
            }
        }
        dis[0][0] = 0;
        queue<P> que;
        que.push(P(0, 0));
        while (!que.empty())
        {
            P p = que.front();
            que.pop();
            ny = p.first;
            nx = p.second;
            if (ny - 1 >= 0 && wall[1][ny - 1][nx] == 0 && dis[ny-1][nx] == INF)
            {
                dis[ny - 1][nx] = dis[ny][nx] + 1;
                que.push(P(ny - 1, nx));
            }
            if (ny + 1 < h && wall[1][ny][nx] == 0 && dis[ny + 1][nx] == INF)
            {
                dis[ny + 1][nx] = dis[ny][nx] + 1;
                que.push(P(ny + 1, nx));
            }
            if (nx - 1 >= 0 && wall[0][ny][nx - 1] == 0 && dis[ny][nx - 1] == INF)
            {
                dis[ny][nx - 1] = dis[ny][nx] + 1;
                que.push(P(ny, nx - 1));
            }
            if (nx + 1 < w && wall[0][ny][nx] == 0 && dis[ny][nx + 1] == INF)
            {
                dis[ny][nx + 1] = dis[ny][nx] + 1;
                que.push(P(ny, nx + 1));
            }
        }
        if (dis[h - 1][w - 1] == INF)
            cout << 0 << endl;
        else
            cout << dis[h - 1][w - 1]+1 << endl;
    }
}