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>
#define MAX_W 30
#define MAX_H 30
using namespace std;

typedef pair<int, int> P;

int a[MAX_H * 2][MAX_W];
int d[MAX_H][MAX_W];
bool visited[MAX_H][MAX_W];

void bfs(int w, int h) {
  P t;
  t.first = t.second = 0;
  d[0][0] = 1;
  visited[0][0] = true;
  queue<P> que;
  que.push(t);

  while (que.empty() == false) {
    t = que.front();
    que.pop();
    P s;
    s.first = t.first - 1;
    s.second = t.second;
    if (s.first >= 0 && a[s.first * 2 + 1][s.second] == 0
	&& visited[s.first][s.second] == false) {
      d[s.first][s.second] = d[t.first][t.second] + 1;
      visited[s.first][s.second] = true;
      que.push(s);
    }
    s.first = t.first + 1;
    s.second = t.second;
    if (s.first < h && a[t.first * 2 + 1][s.second] == 0
	&& visited[s.first][s.second] == false) {
      d[s.first][s.second] = d[t.first][t.second] + 1;
      visited[s.first][s.second] = true;
      que.push(s);
    }
    s.first = t.first;
    s.second = t.second - 1;
    if (s.second >= 0 && a[s.first * 2][t.second] == 0
	&& visited[s.first][s.second] == false) {
      d[s.first][s.second] = d[t.first][t.second] + 1;
      visited[s.first][s.second] = true;
      que.push(s);
    }
    s.first = t.first;
    s.second = t.second + 1;
    if (s.second < w && a[s.first * 2][s.second] == 0
	&& visited[s.first][s.second] == false) {
      d[s.first][s.second] = d[t.first][t.second] + 1;
      visited[s.first][s.second] = true;
      que.push(s);
    }
  }
}

void init() {
  for (int i = 0; i < MAX_H * 2 + 1; i++) {
    for (int j = 0; j < MAX_W; j++) {
      a[i][j] = 0;
    }
  }
  for (int i = 0; i < MAX_H; i++) {
    for (int j = 0; j < MAX_W; j++) {
      d[i][j] = 0;
      visited[i][j] = false;
    }
  }
}

int main() {
  while (true) {
    int w, h;
    cin >> w >> h;
    if (w == 0 && h == 0) return 0;

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

    bfs(w, h);
    cout << d[h - 1][w - 1] << endl;
    for (int i = 0; i < h; i++) {
      for (int j = 0; j < w; j++) {
	cout << d[i][j] << ' ';
      }
      cout << endl;
    }
  }
}

C++: #include<iostream>
#include<queue>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n)   REP(i,0,n)


const int inf = (1<<21);

class state{
public:
  int y,x,c;
};

int cost[100][100];
bool iswall[100][100][4];

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

int bfs(int r,int c){
  /*
  rep(i,r){
    rep(j,c){
      cout << iswall[i][j][0];
    }
    cout << endl;
  }
  */

  rep(i,r)rep(j,c)cost[i][j]=inf;
  queue<state > Q;
  Q.push((state){0,0,0});
  while(!Q.empty()){
    state now = Q.front();Q.pop();
    if (cost[now.y][now.x] != inf)continue;
    cost[now.y][now.x]=now.c;
    
    if (now.x == c-1 && now.y == r-1)return now.c+1;
    //cout << now.x <<" " << now.y << " " <<now.c <<" " <<  c-1 <<" " << r-1 << endl;
    
    rep(i,4){
      int nex=now.x+dx[i],ney=now.y+dy[i];
      if (nex == -1 || nex == c || ney == -1 || ney == r || iswall[now.y][now.x][i])continue;
      Q.push((state){ney,nex,now.c+1});
    }
    
  }
  return 0;
}


main(){
  int r,c;
  while(cin>>c>>r && c){
    rep(i,100)rep(j,100)rep(k,4)iswall[i][j][k]=false;

    rep(i,r-1){
      bool tmp;
      rep(j,c-1){
	cin>>tmp;iswall[i][j][0]=iswall[i][j+1][1]=tmp;
      }
      rep(j,c){
	cin>>tmp;iswall[i][j][2]=iswall[i+1][j][3]=tmp;
      }
    }

    rep(j,c-1){
      bool tmp;	cin>>tmp;iswall[r-1][j][0]=iswall[r-1][j+1][1]=tmp;
    }
    cout << bfs(r,c) << endl;
  }

}