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 <vector>
#include <queue>
#include <complex>
using namespace std;
typedef complex<int> P;

int main()
{
  int w, h;
  while (cin >> w >> h && !(w == 0 && h == 0)) {
    vector<vector<bool> > grid(2*h+1, vector<bool>(2*w+1, false));
    fill(grid.front().begin(), grid.front().end(), true);
    fill(grid.back().begin(), grid.back().end(), true);
    for (int i = 1; i < 2*h; i++) {
      grid[i][0] = true;
      grid[i][2*w] = true;
      if (i % 2 == 1) {
        for (int j = 0; j < w-1; j++) {
          int x;
          cin >> x;
          if (x == 1) {
            grid[i-1][2*j+2] = true;
            grid[i][2*j+2] = true;
            grid[i+1][2*j+2] = true;
          }
        }
      } else {
        for (int j = 0; j < w; j++) {
          int x;
          cin >> x;
          if (x == 1) {
            grid[i][2*j] = true;
            grid[i][2*j+1] = true;
            grid[i][2*j+2] = true;
          }
        }
      }
    }

    queue<pair<int,P> > q;
    q.push(make_pair(0, P(1, 1)));
    grid[1][1] = true;
    while (!q.empty()) {
      const pair<int,P> p = q.front();
      q.pop();
      if (p.second == P(2*h-1, 2*w-1)) {
        cout << p.first/2+1 << endl;
        goto NEXT;
      }

      for (int d = 0; d < 4; d++) {
        static const P dir[] = {P(-1, 0), P(1, 0), P(0, -1), P(0, 1)};
        const P next = p.second + dir[d];
        if (!grid[next.real()][next.imag()]) {
          q.push(make_pair(p.first+1, next));
          grid[next.real()][next.imag()] = true;
        }
      }
    }
    cout << 0 << endl;
NEXT:
    ;
  }
  return 0;
}

C++: 

#include <iostream>
#include <algorithm>
#include <stdlib.h>
#include <string>
#include <queue>
#include <map>
#include <stack>
using namespace std;
 
int dx[8]={1,-1,0,0,1,1,-1,-1};
int dy[8]={0,0,1,-1,-1,1,-1,1};
 
 
int main() {
int tate,yoko;
while(cin>>yoko>>tate && yoko){
int t[35][35]={0},y[35][35]={0};
for(int i=0;i<2*tate-1;i++){
if(i%2==0){
for(int j=0;j<yoko-1;j++) cin>>y[i/2][j];
}
else{
for(int j=0;j<yoko;j++) cin>>t[i/2][j];
}
}
int su[35][35]={0};
queue<pair<pair<int,int>,int > > qu;
qu.push(make_pair(make_pair(0,0),0));
su[0][0]=1;
int ans;
while(1){
if(qu.size()==0){
ans=-1;
break;
}
pair<pair<int,int>,int > dd=qu.front();
qu.pop();
int t1=dd.first.first,y1=dd.first.second;
if(dd.first.first==tate-1 && dd.first.second==yoko-1){
ans=dd.second;
break;
}
for(int i=0;i<4;i++){
if(0>t1+dx[i] || t1+dx[i]>=tate || 0>y1+dy[i] || y1+dy[i]>=yoko) continue;
if((i==0 && su[t1+dx[i]][y1+dy[i]]==0 && t[t1][y1]==0) ||(i==1 && su[t1+dx[i]][y1+dy[i]]==0 && t[t1+dx[i]][y1+dx[i]]==0)||(i==2 && su[t1+dx[i]][y1+dy[i]]==0 && y[t1][y1]==0) || (i==3 && su[t1+dx[i]][y1+dy[i]]==0 && y[t1+dx[i]][y1+dy[i]]==0) ){
qu.push(make_pair(make_pair(t1+dx[i],y1+dy[i]),dd.second+1));
su[t1+dx[i]][y1+dy[i]]=1;
}

}



}

cout<<ans+1<<endl;
}


	return 0;
 
}

C++: #include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#include <cstring>

const int INF=1E8;

using namespace std;

const int MAX_W=30,MAX_H=30;

int w,h;
char s[MAX_H*2-1][100];

vector<int> G[MAX_W*MAX_H];
int d[MAX_W*MAX_H];

vector<int> out;

int bfs(){
	fill(d,d+w*h,INF);
	d[0]=0;
	queue<int> q;
	q.push(0);
	while (!q.empty()){
		int v=q.front();
		q.pop();
		for (int i=0;i<G[v].size();i++){
			if (d[G[v][i]]==INF){
				d[G[v][i]]=d[v]+1;
				q.push(G[v][i]);
			}
		}
	}
	return d[w*h-1];
}

int main(){
	do{
		scanf("%d %d",&w,&h);
		if (w || h){
			for (int i=0;i<h;i++){
				for (int j=0;j<w;j++){
					G[i*w+j].clear();
				}
			}
			fprintf(stderr,"debug:%d",h*2-1);
			for (int i=0;i<2*h-1;i++){
				scanf("%s",s[i]);
			}
			for (int i=0;i<2*h-1;i++){
				for (int j=0,l=strlen(s[i]);j<l;j++){
					int v1,v2;
					if (s[i][j]=='0'){
						if (i%2==0){
							v1=i/2*w+j/2;
							v2=v1+1;
						}
						else{
							v1=i/2*w+j/2;
							v2=v1+w;
						}
					}
					G[v1].push_back(v2);
					G[v2].push_back(v1);
				}
			}
			fprintf(stderr,"debug:%d\n",G[0][0]);
			out.push_back(bfs());
		}
	}while(w || h);
	for (vector<int>::iterator ite=out.begin();ite!=out.end();ite++){
		printf("%d\n",(*ite==INF) ? 0:*ite);
	}
	return 0;
}