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 vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

#define INF 1e9

struct edge{int from,to,w;};
bool operator < (const edge &e, const edge &f) {
  return e.w != f.w ? e.w > f.w :
    e.from != f.from ? e.from < f.from : e.to < f.to;
}

vector<edge> g[100];


int w,h;
int getpos(int x,int y){
  return x*h+y;
}
int MAX_POS(){
  return w*h;
}

// http://www.prefield.com/algorithm/graph/dijkstra.html
vi dijkstra(int s) {
  vi dist(MAX_POS(),INF);
  dist[s] = 0;
  priority_queue<edge> Q; // "e < f" <=> "e.weight > f.weight"
  for (Q.push((edge){-2, s, 0}); !Q.empty(); ) {
    edge e = Q.top(); Q.pop();
    // if (prev[e.to] != -1) continue;
    REP(i,g[e.to].size()){
      edge f = g[e.to][i];
      if (dist[f.to] > e.w+f.w) {
        dist[f.to] = e.w+f.w;
        Q.push((edge){f.from, f.to, e.w+f.w});
      }
    }
  }
  return dist;
}

void addE(int from,int to){
  g[from].push_back((edge){from,to,1});
  g[to].push_back((edge){to,from,1});
}

int main(){
  while(true){
    cin>>w>>h;
    if(w==0 && h==0)break;
    // init
    REP(i,100)g[i].clear();
    // input
    REP(i,2*h-1){
      if(i%2==0){
        // yoko kabe
        REP(j,w-1){
          int t;
          cin >> t;
          if(t==0) addE(getpos(j,i/2),getpos(j+1,i/2));
        }
      }else{
        // tate kabe
        REP(j,w){
          int t;
          cin >> t;
          if(t==0) addE(getpos(j,i/2),getpos(j,i/2+1));
        }
      }
    }
    // dijkstra
    vi dist = dijkstra(0);
    int goal = MAX_POS()-1;
    if(dist[goal]==INF){
      cout << 0 << endl;
    }else{
      cout << dist[goal]+1 << endl;
    }
  }
  return 0;
}

C++: #include <iostream>
#include <queue>
using namespace std;

int w,h, HL,WL;
int area[70][70];

struct P{
  int x,y;
  int t;
  P(){};
  P(int i,int j){x=i;y=j;t=0;}
  P(int i,int j,int nt){x=i;y=j;t=nt;}
};

void pr(){
  for( int i=0;i<HL;i++ ){
    for( int j=0;j<WL;j++ )
      cout << area[i][j] << " ";
    cout << endl;
  }
}

int main(){
  queue<P> q;
  P p;
  while( cin>>w>>h &&(w|h) ){
    // cout << "  h="<<h << " w="<<w<<endl;

    HL=2*h+1;
    WL=2*w+1;
    for( int i=0;i<HL;i++ ){
      for( int j=0;j<WL;j++ ){
	if( i==0 || j==0 || i==HL-1 || j==WL-1 )
	  area[i][j]=1;
	else
	  area[i][j] = 0;
      }
    }

    for( int i=1;i<HL-1;i++ ){
      if( i & 0x01 ){ // odd
	for( int j=1;j<w;j++ )
	  cin >> area[i][2*j];
      }else{
	for( int j=0;j<w;j++ )
	  cin >> area[i][2*j+1];
      }
    }

    while( !q.empty() ) q.pop();
    q.push( P(1,1) );
    int ans=0;
    while( !q.empty() ){
      p=q.front(); q.pop();
      int x=p.x, y=p.y, t=p.t, nt=t+1;

      if( area[x][y]==1 ) continue;

      if( x==2*h-1 && y==2*w-1 ){
	ans=t+1; break;
      }
      area[x][y]=1;
      if( area[x+1][y]==0 ) q.push( P(x+2,y,nt) );
      if( area[x-1][y]==0 ) q.push( P(x-2,y,nt) );
      if( area[x][y+1]==0 ) q.push( P(x,y+2,nt) );
      if( area[x][y-1]==0 ) q.push( P(x,y-2,nt) );
    }
    cout << ans << endl;

  }

  return 0;
}