Go: package main

import (
	"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)
	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)
	pq.Push(start)
	dx := []int64{0, 1, 0, -1}
	dy := []int64{1, 0, -1, 0}
	memo := make(map[PersonPosition]int64, 0)
	ans := int64(101)
	for pq.Len() > 0 {
		//now := heap.Pop(&pq).(*Status)
		now := pq.Pop().(*Status)
		if now.Person.Distance() == 0 && ans > now.Turn {
			ans = now.Turn
		}
		if v, ok := memo[now.Person]; ok && v <= now.Turn {
			continue
		}
		if ans<=now.Turn {
			continue
		}
		memo[now.Person] = now.Turn
		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)
				pq.Push(next)
			}
		}
	}
	if ans == 101 {
		fmt.Println("NA")
	} else {
		fmt.Println(ans)
	}
}

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

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

using namespace std;

#define MAX 51

int xy[MAX][MAX];
int cost[MAX][MAX][MAX][MAX];
int X,Y;

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

struct state{
  char tx;
  char ty;
  char kx;
  char ky;
  int co;
  state(){}
  state(char tx,char ty,char kx,char ky,char co):
    tx(tx),ty(ty),kx(kx),ky(ky),co(co){}
};

int solve(int tx,int ty,int kx,int ky){

  memset(cost,101,sizeof(cost));

  queue<state> q;
  q.push( state(tx,ty,kx,ky,0) );

  while( !q.empty() ){
    state p=q.front();
    q.pop();

    tx=p.tx;
    ty=p.ty;
    kx=p.kx;
    ky=p.ky;

    for(int i=0;i<4;i++){

      int f=0;
      
      if(p.co+1>=100) continue;
      
      if(kx+dx[i]*-1 <= 0 || ky+dy[i]*-1 <=0 || kx+dx[i]*-1 > X || ky+dy[i]*-1 > Y)
	f+=10;      
      if(tx+dx[i] <= 0 || ty+dy[i] <= 0 || tx+dx[i] > X || ty+dy[i] > Y )
	f++;

      if( xy[ty+dy[i]][tx+dx[i]]==1 )
	f++;
      if(xy[ky+dy[i]*-1][kx+dx[i]*-1]==1 )
	f+=10;

      if(f/10>0 && f%10>0)
	continue;


      if(f==0){
	if(tx+dx[i] == kx+dx[i]*-1 && ty+dy[i] == ky+dy[i]*-1)
	  return p.co+1;
	if( cost[tx+dx[i]][ty+dy[i]][kx+dx[i]*-1][ky+dy[i]*-1] <= p.co)
	  continue;
	cost[tx+dx[i]][ty+dy[i]][kx+dx[i]*-1][ky+dy[i]*-1]=p.co+1;
	q.push( state(tx+dx[i],ty+dy[i],kx+dx[i]*-1,ky+dy[i]*-1,p.co+1) );
      }
      else if(f%10>0){
	if(tx == kx+dx[i]*-1 && ty == ky+dy[i]*-1)
	  return p.co+1;
	if( cost[tx][ty][kx+dx[i]*-1][ky+dy[i]*-1] <= p.co)
	  continue;
	cost[tx][ty][kx+dx[i]*-1][ky+dy[i]*-1]=p.co+1;
	q.push( state(tx,ty,kx+dx[i]*-1,ky+dy[i]*-1,p.co+1) );
      }
      else if(f/10>0){
	if(tx+dx[i] == kx && ty+dy[i] == ky)
	  return p.co+1;
	if( cost[tx+dx[i]][ty+dy[i]][kx][ky] <= p.co)
	  continue;
	cost[tx+dx[i]][ty+dy[i]][kx][ky]=p.co+1;
	q.push( state(tx+dx[i],ty+dy[i],kx,ky,p.co+1) );
      }
    }
  }
  return -1;
} 

main(){
  
  int i,j;
  int kx,ky,tx,ty;
  int n;

  while(1){
    
    cin >> X >> Y;

    if(X==0 && Y==0) break;
    
    cin >> tx >> ty;
    cin >> kx >> ky;
    
    for(i=1;i<=Y;i++){
      for(j=1;j<=X;j++){
	cin >> xy[i][j];
      }
    }
    
    n=solve(tx,ty,kx,ky);
    
    if(n==-1)
      cout << "NA" << endl;
    else
      cout << n << endl;
  }
  return 0;
}

C++: #include <iostream>
#include <queue>
#include <cstring>
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
using namespace std;
bool mem[52][52][52][52] = {{{{}}}};
struct S{
	int a,b,c,d,t;
};
int dx[4] = {-1,0,1,0};
int dy[4] = {0,1,0,-1};
void init() {
	memset(mem,0,sizeof(mem));
}
int main(){
	int x, y, tx, ty, kx, ky, k;
	while(cin >> x >> y, (x || y)) {
		int b[52][52] = {};
		init();
		cin >> tx >> ty >> kx >> ky;
		rep(i,y) {
			rep(j,x) {
				cin >> k;
				b[i+1][j+1] = 1-k;
			}
		}
		queue<S> q;
		S s = {tx,ty,kx,ky,0};
		q.push(s);
		while(!q.empty()) {
			S s = q.front();
			if(q.front().t >= 100) break;
			if(s.a==s.c&&s.b==s.d) break;
			q.pop();
			if(mem[s.a][s.b][s.c][s.d]++) continue;
			rep(i,4) {
				int na = s.a+dx[i], nb = s.b+dy[i], nc = s.c+dx[(i+2)%4], nd = s.d+dy[(i+2)%4];
				if(!b[nb][na]&&!b[nd][nc]) continue;
				if(!b[nb][na]) na = s.a, nb = s.b;
				if(!b[nd][nc]) nc = s.c, nd = s.d;
				S ns = {na, nb, nc, nd, s.t+1};
				q.push(ns);
			}
		}
		if(q.empty()) cout << "NA" << endl;
		else if(q.front().t >= 100) cout << "NA" << endl;
		else cout << q.front().t << endl;
	}
}

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

int field[64][64];
char visit[1 << 24];
int w, h;
int tx, ty, kx, ky;

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

void trymove(int &y, int &x, int d){
	if(!field[y + dy[d]][x + dx[d]]){
		y += dy[d];
		x += dx[d];
	}
}

void solve(){
	memset(visit, 0, sizeof visit);
	memset(field, 1, sizeof field);

	for(int y = 1; y <= h; ++y){
		for(int x = 1; x <= w; ++x){
			scanf("%d", &field[y][x]);
		}
	}

	queue<int> q;
	int st = ty << 18 | tx << 12 | ky << 6 | kx;
	q.push(st);
	visit[st] = 1;
	q.push(-1);
	for(int ans = 0; ans < 100; ){
		st = q.front();
		q.pop();
		if(st == -1){
			q.push(-1);
			++ans;
		}
		else{
			int y1 = st >> 18, x1 = st >> 12 & 63;
			int y2 = st >> 6 & 63, x2 = st & 63;
			if(y1 == y2 && x1 == x2){
				printf("%d\n", ans);
				return;
			}

			for(int i = 0; i < 4; ++i){
				int ny1 = y1, nx1 = x1, ny2 = y2, nx2 = x2;
				trymove(ny1, nx1, i);
				trymove(ny2, nx2, (i + 2) & 3);
				st = ny1 << 18 | nx1 << 12 | ny2 << 6 | nx2;
				if(!visit[st]){
					visit[st] = 1;
					q.push(st);
				}
			}
		}
	}

	puts("NA");
}

int main(){
	while(scanf("%d%d%d%d%d%d", &w, &h, &tx, &ty, &kx, &ky) == 6){
		solve();
	}
}