Go: package main

import (
	"container/heap"
	"fmt"
	"math"
)

type Position struct {
	X int64
	Y int64
}

func (one Position) Distance(another Position) int64 {
	return int64(math.Abs(float64(one.X-another.X)) + math.Abs(float64(one.Y-another.Y)))
}

type PersonPosition struct {
	Takayuki Position
	Kazuyuki Position
}

func (one PersonPosition) Distance() int64 {
	return one.Takayuki.Distance(one.Kazuyuki)
}

type Status struct {
	Person PersonPosition
	Turn   int64
}

type PQStatus []*Status

func (pq PQStatus) Len() int {
	return len(pq)
}
func (pq PQStatus) Less(i, j int) bool {
	if pq[i].Turn == pq[j].Turn {
		return pq[i].Person.Distance() < pq[j].Person.Distance()
	}
	return pq[i].Turn < pq[j].Turn
}

func (pq PQStatus) Swap(i, j int) {
	pq[i], pq[j] = pq[j], pq[i]
}

func (pq *PQStatus) Push(x interface{}) {
	item := x.(*Status)
	*pq = append(*pq, item)
}

func (pq *PQStatus) Pop() interface{} {
	old := *pq
	n := len(old)
	item := old[n-1]
	*pq = old[0 : n-1]
	return item
}

func solve(h, w int64) {
	var tx, ty, kx, ky int64
	fmt.Scan(&tx, &ty, &kx, &ky)
	m := make([][]int64, h)
	for i := range m {
		m[i] = make([]int64, w)
		for j := int64(0); j < w; j++ {
			fmt.Scan(&m[i][j])
		}
	}
	start := &Status{Person: PersonPosition{Takayuki: Position{X: tx, Y: ty}, Kazuyuki: Position{X: kx, Y: ky}}, Turn: 0}
	pq := make(PQStatus, 0)
	heap.Init(&pq)
	heap.Push(&pq, start)
	dx := []int64{0, 1, 0, -1}
	dy := []int64{1, 0, -1, 0}
	memo := make(map[PersonPosition]struct{}, 0)
	for pq.Len() > 0 {
		now := heap.Pop(&pq).(*Status)
		if now.Person.Distance() == 0 {
			fmt.Println(now.Turn)
			return
		}
		if _, ok := memo[now.Person]; ok {
			continue
		}
		memo[now.Person] = struct{}{}
		for i := 0; i < 4; i++ {
			next := &Status{}
			*next = *now
			next.Person.Kazuyuki.X += dx[i]
			next.Person.Kazuyuki.Y += dy[i]
			if next.Person.Kazuyuki.X < 0 || next.Person.Kazuyuki.X >= w ||
				next.Person.Kazuyuki.Y < 0 || next.Person.Kazuyuki.Y >= h ||
				m[next.Person.Kazuyuki.Y][next.Person.Kazuyuki.X] == 1 {
				next.Person.Kazuyuki.X -= dx[i]
				next.Person.Kazuyuki.Y -= dy[i]
			}
			next.Person.Takayuki.X -= dx[i]
			next.Person.Takayuki.Y -= dy[i]
			if next.Person.Takayuki.X < 0 || next.Person.Takayuki.X >= w ||
				next.Person.Takayuki.Y < 0 || next.Person.Takayuki.Y >= h ||
				m[next.Person.Takayuki.Y][next.Person.Takayuki.X] == 1 {
				next.Person.Takayuki.X += dx[i]
				next.Person.Takayuki.Y += dy[i]
			}
			next.Turn += 1
			if next.Turn < 100 {
				heap.Push(&pq, next)
			}
		}
	}
	fmt.Println("NA")
}

func main() {
	var h, w int64
	for {
		fmt.Scan(&h, &w)
		if h == 0 && w == 0 {
			break
		}
		solve(h, w)
	}
}

C++: #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int INF = 10000000;
typedef struct state{
  int tx;
  int ty;
  int kx;
  int ky;
  int cost;
  state(int tx,int ty,int kx,int ky,int cost):
      tx(tx),ty(ty),kx(kx),ky(ky),cost(cost){}
}st;
int fie[52][52];
int check[52][52][52][52];
int X,Y;
int dtx[]={0,1,0,-1};
int dty[]={1,0,-1,0};
int dkx[]={0,-1,0,1};
int dky[]={-1,0,1,0};

void init(){
  for(int i=0;i<Y;i++){
    for(int j=0;j<X;j++){
      for(int ii=0;ii<Y;ii++){
	for(int jj=0;jj<X;jj++) check[j][i][jj][ii]=INF;
	//	cout <<check[j][i][0][ii]<<endl;
      }
    }
  }
}

int solve(int tx,int ty,int kx,int ky){
  queue <st> q;
  int cost;
  int ok=0;
  q.push(state(tx,ty,kx,ky,0));
  while(!q.empty()){
    st p=q.front(); q.pop();
    tx=p.tx;
    ty=p.ty;
    kx=p.kx;
    ky=p.ky;
    cost=p.cost;

    if(tx==kx && ty==ky){ ok=1;break;}
    if(cost>=100) break;
    //cout << check[tx][ty][kx][ky] <<" ";
    check[tx][ty][kx][ky]=cost;

    // cout <<tx<<" "<<ty<<" "<<kx<<" "<<ky<<" "<<cost<<endl;

    for(int i=0;i<4;i++){
      int f=0;
      if(tx+dtx[i]<0 || tx+dtx[i]>=X || ty+dty[i]<0 || ty+dty[i]>=Y) f+=1;
      if(kx+dkx[i]<0 || kx+dkx[i]>=X || ky+dky[i]<0 || ky+dky[i]>=Y) f+=10;
      if(f==11) continue;
      if((f/10)){//かずゆきいけない時
	if(fie[tx+dtx[i]][ty+dty[i]]==1 ) f+=1;
      }else if((f%10)){//たかゆきいけない時
	if(fie[kx+dkx[i]][ky+dky[i]]==1 ) f+=10;
      }else{//両方いける時
	if(fie[tx+dtx[i]][ty+dty[i]]==1 ) f+=1;
	if(fie[kx+dkx[i]][ky+dky[i]]==1 ) f+=10;
      }
      if(f>=11) continue;

      if(f/10){//かずゆきがいけない時
	if(check[tx+dtx[i]][ty+dty[i]][kx][ky]<=cost) continue;
      }else if(f%10){//たかゆきイけないとき
	if(check[tx][ty][kx+dkx[i]][ky+dky[i]]<=cost) continue;
      }else{//両方いけるとき
	if(check[tx+dtx[i]][ty+dty[i]][kx+dkx[i]][ky+dky[i]]<=cost)continue;
      }

      if(f/10)  q.push(state(tx+dtx[i],ty+dty[i],kx,ky,cost+1));
      else if(f%10)  q.push(state(tx,ty,kx+dkx[i],ky+dky[i],cost+1));
      else q.push(state(tx+dtx[i],ty+dty[i],kx+dkx[i],ky+dky[i],cost+1));
    }
  }
  if(!ok) return 100;
  return cost;
}
main(){
  int tx,ty,kx,ky;
  while(1){
    cin >> X >> Y;
    if(X==0 && Y==0) break;
    cin >> tx >> ty;
    cin >> kx >> ky;
    init();
    for(int i=0;i<Y;i++){
      for(int j=0;j<X;j++) cin >> fie[j][i];
    }
    int res=solve(tx,ty,kx,ky);
    if(res>=100) cout << "NA" << endl;
    else cout << res << endl;
  }
}

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

using namespace std;

const int inf = 999999;

struct P{
	int x;
	int y;
};

struct St{
	P tk;
	P kz;
	int cost;
};

int xdir[4] = {0, 1, 0, -1}, ydir[4] = {1, 0, -1, 0};

int bfs(char a[51][51], int w, int h, P p, P q)
{
	int r = inf;
	bool vis[51][51][51][51];
	fill(&vis[0][0][0][0], &vis[50][50][50][50], true);
	St s, t;
	queue<St> que;
	s.tk = p;
	s.kz = q;
	s.cost = 0;
	que.push(s);
	
	while(!que.empty()){
		s = que.front();
		que.pop();
		if(s.tk.x == s.kz.x && s.tk.y == s.kz.y){
			r = s.cost;
			break;
		}
		if(s.cost >= 100){
			break;
		}
		
		for(int i = 0; i < 4; i++){
			int tx = s.tk.x+xdir[i], ty = s.tk.y+ydir[i];
			int kx = s.kz.x-xdir[i], ky = s.kz.y-ydir[i];
			if(!(0 <= tx && tx < w && 0 <= ty && ty < h && a[ty][tx] == '0')){
				tx = s.tk.x;
				ty = s.tk.y;
			}
			if(!(0 <= kx && kx < w && 0 <= ky && ky < h && a[ky][kx] == '0')){
				kx = s.kz.x;
				ky = s.kz.y;
			}
			if(vis[ty][tx][ky][kx]){
				vis[ty][tx][ky][kx] = false;
				t.tk.x = tx;
				t.tk.y = ty;
				t.kz.x = kx;
				t.kz.y = ky;
				t.cost = s.cost+1;
				que.push(t);
			}
		}
	}
	
	return r;
}

int main()
{
	int w, h, r;
	char a[51][51];
	P p, q;
	
	while(cin>>w>>h && (w+h)){
		cin >> p.x >> p.y;
		cin >> q.x >> q.y;
		for(int i = 0; i < h; i++){
			for(int j = 0; j < w; j++){
				cin >> a[i][j];
			}
		}
		
		r = bfs(a, w, h, p, q);
		if(r == inf){
			cout << "NA" << endl;
		} else {
			cout << r << endl;
		}
	}
	
	return 0;
}