Go: package main

import (
	"bufio"
	"os"
	"strings"
	"strconv"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

var (
	dx = []int{0, -1, 0, 1}
	dy = []int{1, 0, -1, 0}
)

func main() {
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		w, _ := strconv.Atoi(buf[0])
		h, _ := strconv.Atoi(buf[1])
		if w == 0 && h == 0 {
			break
		}
		scanner.Scan()
		buf_ := strings.Split(scanner.Text(), " ")
		xs, _ := strconv.Atoi(buf_[0])
		ys, _ := strconv.Atoi(buf_[1])
		scanner.Scan()
		buf__ := strings.Split(scanner.Text(), " ")
		xg, _ := strconv.Atoi(buf__[0])
		yg, _ := strconv.Atoi(buf__[1])
		xs--
		ys--
		xg--
		yg--
		scanner.Scan()
		n, _ := strconv.Atoi(scanner.Text())
		field := make([][]int, 100)
		for i := range  field {
			field[i] = make([]int, 100)
		}
		visited := make([][]bool, 100)
		for i := range visited {
			visited[i] = make([]bool, 100)
		}
		for i := 0; i < n; i++ {
			scanner.Scan()
			buf___ := strings.Split(scanner.Text(), " ")
			c, _ := strconv.Atoi(buf___[0])
			d, _ := strconv.Atoi(buf___[1])
			x, _ := strconv.Atoi(buf___[2])
			y, _ := strconv.Atoi(buf___[3])
			x--
			y--
			switch d {
			case 0:
				for j := 0; j < 4; j++ {
					for k := 0; k < 2; k++ {
						field[x+j][y+k] = c
					}
				}
			case 1:
				for j := 0; j < 2; j++ {
					for k := 0; k < 4; k++ {
						field[x+j][y+k] = c
					}
				}
			}
		}
		if field[xs][ys] != field[xg][yg] || // スタートとゴールの色が等しくないと"NG"
			field[xs][ys] == 0 { // スタートの色が無職
			fmt.Println("NG")
			continue
		}
		Q := make([]Entry, 0)
		visited[xs][ys] = true
		Q = append(Q, Entry{xs, ys})
		for len(Q) > 0 {
			row := Q[0].x
			col := Q[0].y
			Q = Q[1:]
			for i := 0; i < 4; i++ {
				if 0 <= row+dx[i] && row+dx[i] < w &&
					0 <= col+dy[i] && col+dy[i] < h && // 移動可能な範囲内かどうか
					!visited[row + dx[i]][col + dy[i]] && // 訪問済みか
					field[row+dx[i]][col+dy[i]]==field[row][col] { // 色が同じかどうか
						visited[row+dx[i]][col+dy[i]] = true
						Q = append(Q, Entry{row+dx[i],col+dy[i]})
				}
			}
		}
		if visited[xg][yg] {
			fmt.Println("OK")
		} else {
			fmt.Println("NG")
		}
	}
}

type Entry struct {
	x, y int
}

C++: #include<iostream>
#include<cstring>
using namespace std;
int map[110][110];
int com[110][110];
int lx,ly,sx,sy,gx,gy;
int py[4]={1,0,-1,0};
int px[4]={0,1,0,-1};
int fl;
int mei(int zx,int zy ,int cei[][110])
{
	int i;
	if(fl) return 0;
	if(zx==gx && zy==gy)
	{
		fl=1;
		return 0;
	}
	cei[zy][zx]=1;
	for(i=0;i<4;i++)
	{
		if(cei[zy+py[i]][zx+px[i]]==0 && map[sy][sx]==map[zy+py[i]][zx+px[i]])
		{
			mei(zx+px[i],zy+py[i],cei);
			
		}
	}
	cei[zy][zx]=0;
	return 0;
}
int main()
{
	int n,col,muk,vx,vy;
	int i,j,t;
	while(cin >> lx >> ly, lx!=0 && ly!=0)
	{
		fl=0;
		cin >> sx >> sy >> gx >> gy >> n;
		memset(map,0,sizeof(map));
		memset(com,0,sizeof(com));
		for(i=0;i<n;i++)
		{
			cin >> col >> muk >> vx >> vy;
			if(muk==0)
			{
				for(j=vy;j<2+vy;j++)
				{
					for(t=vx;t<4+vx;t++)
					{
						map[j][t]=col;
					}
				}
			}
			else
			{
				for(j=vy;j<4+vy;j++)
				{
					for(t=vx;t<2+vx;t++)
					{
						map[j][t]=col;
					}
				}
			}
		}
		if(map[sy][sx]!=map[gy][gx])
		{
			cout << "NG" << endl;
			continue;
		}
		mei(sx,sy,com);
		if(fl) cout << "OK" << endl;
		else cout << "NG" << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<cstdio>
using namespace std;
	int u[150][150],p,v[150][150],xg,yg,q,dx[]={1,0,-1,0},dy[]={0,1,0,-1},w,h;
void ret(int x,int y){
	int a,b,i;
	v[y][x]=1;
	if(xg==x&&yg==y)
		p++;
	else
	for(i=0;i<4;i++){
		a=x+dx[i];
		b=y+dy[i];
		if(a<1||a>w||b<1||b>h||v[b][a]==1)
			continue;
		else if(u[b][a]==q)
			ret(a,b);
	}
}
int main(){
	int xs,ys,c,d,x,y,n;
	while(cin>>w>>h,w||h){
		for(int i=1;i<=h;i++)
			for(int j=1;j<=w;j++)
			v[i][j]=0;
		scanf("%d %d",&xs,&ys);
		scanf("%d %d",&xg,&yg);
		scanf("%d",&n);
		for(int k=0;k<n;k++){
			scanf("%d %d %d %d",&c,&d,&x,&y);
			if(d==0)
				for(int i=0;i<2;i++)
				for(int j=0;j<4;j++)
				u[i+y][j+x]=c;
			else 
				for(int i=0;i<4;i++)
				for(int j=0;j<2;j++)
				u[i+y][j+x]=c;
		}
		q=u[ys][xs];
		p=0;
		ret(xs,ys);
		if(p>0)
			printf("OK\n");
		else printf("NG\n");
	}
	return 0;
}

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

int F[102][102] = { 0 };

void DFS(int Y, int X, int c) {
	//cout << Y << " " << X << endl;
	if (F[Y][X] != c)
		return;
	F[Y][X] = 10;
	DFS(Y - 1, X, c);//???
					 //DFS(Y - 1, X+1, A_ito);//??????
	DFS(Y, X + 1, c);//???
					 //DFS(Y + 1, X+1, A_ito);//??????
	DFS(Y + 1, X, c);//???
					 //DFS(Y + 1, X-1, A_ito);//??????
	DFS(Y, X - 1, c);//???
					 //DFS(Y - 1, X-1, A_ito);//??????
}


int main()
{
	int xs, ys, xg, yg, n;
	int c, d, x, y;
	int W = 1, H = 1;

	while ((W != 0) && (H != 0)) {
		cin >> W >> H;
		for (int i = 0;i <= H;i++) {
			for (int j = 0;j <= W;j++) {
				F[i][j] = 6;
			}
		}
		cin >> xs >> ys >> xg >> yg >> n;
		for (int i = 1;i <= n;i++) {
			cin >> c >> d >> x >> y;
			if (d == 0) {
				F[x][y] = c;
				F[x][y + 1] = c;
				F[x + 1][y] = c;
				F[x + 1][y + 1] = c;
				F[x + 2][y] = c;
				F[x + 2][y + 1] = c;
				F[x + 3][y] = c;
				F[x + 3][y + 1] = c;
			}
			if (d == 1) {
				F[x][y] = c;
				F[x + 1][y] = c;
				F[x][y + 1] = c;
				F[x + 1][y + 1] = c;
				F[x][y + 2] = c;
				F[x + 1][y + 2] = c;
				F[x][y + 3] = c;
				F[x + 1][y + 3] = c;
			}
		}
		
			DFS(ys, xs, F[ys][xs]);

		if (F[yg][xg] == F[ys][xs]) {
			cout << "OK" << endl;
		}
		else { cout << "NG" << endl; }
		for (int i = 0;i <= H;i++) {
			for (int j = 0;j <= W;j++) {
				F[i][j] = 0;
			}
		}
		
	}

	return 0;
}

C++: #include<iostream>
using namespace std;
int w, h, xs, ys, xg, yg, stage[101][101] = {};
int ny[4] = { 0, 1, 0, -1 }, nx[4] = { 1, 0, -1, 0 };
int bc;
bool ans = false;
void func(int x, int y){
	if (x == xg && y == yg){
		ans = true;
	}
	for (int i = 0; i < 4; i++){
		if (stage[y + ny[i]][x + nx[i]] != bc) return;
		func(x + nx[i], y + ny[i]);
	}
}
int main(){
	int n, c, d, x, y, bw, bh;
	cin >> w >> h >> xs >> ys >> xg >> yg >> n;
	for (int i = 0; i < n; i++){
		cin >> c >> d >> x >> y;
		if (d == 0){
			bw = 4;
			bh = 2;
		}
		else{
			bw = 2;
			bh = 4;
		}
		for (int j = 0; j < bh; j++){
			for (int k = 0; k < bw; k++){
				stage[y + j][x + k] = c;
			}
		}
	}
	bc = stage[1][1];
	func(1, 1);
	if (ans == true) cout << "OK\n";
	else cout << "NG\n";
	return 0;
}

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

int F[101][102];

void DFS(int Y, int X, int c) {
	//cout << Y << " " << X << endl;
	if (F[Y][X] != c)
		return;
	F[Y][X] = 10;
	DFS(Y - 1, X, c);//???
					 //DFS(Y - 1, X+1, A_ito);//??????
	DFS(Y, X + 1, c);//???
					 //DFS(Y + 1, X+1, A_ito);//??????
	DFS(Y + 1, X, c);//???
					 //DFS(Y + 1, X-1, A_ito);//??????
	DFS(Y, X - 1, c);//???
					 //DFS(Y - 1, X-1, A_ito);//??????
}


int main()
{
	int xs, ys, xg, yg, n;
	int c, d, x, y;
	int W = 1, H = 1;

	while ((W != 0) && (H != 0)) {
		cin >> W >> H;
		cin >> xs >> ys >> xg >> yg >> n;
		for (int i = 1;i <= n;i++) {
			cin >> c >> d >> x >> y;
			if (d == 0) {
				F[x][y] = c;
				F[x][y + 1] = c;
				F[x + 1][y] = c;
				F[x + 1][y + 1] = c;
				F[x + 2][y] = c;
				F[x + 2][y + 1] = c;
				F[x + 3][y] = c;
				F[x + 3][y + 1] = c;
			}
			if (d == 1) {
				F[x][y] = c;
				F[x + 1][y] = c;
				F[x][y + 1] = c;
				F[x + 1][y + 1] = c;
				F[x][y + 2] = c;
				F[x + 1][y + 2] = c;
				F[x][y + 3] = c;
				F[x + 1][y + 3] = c;
			}
		}
		if (F[ys][xs] != 0)
			DFS(ys, xs, F[ys][xs]);

		if (F[yg][xg] == 10) {
			cout << "OK" << endl;
		}
		else { cout << "NG" << endl; }
		/*for (int i = 0;i < H;i++) {
			for (int j = 0;j < W;j++) {
				F[i][j] = 0;
			}
		}
		*/
	}

	return 0;
}