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<queue>
#include<string.h>
using namespace std;
#define TATE 1
#define YOKO 0

struct ST {
        int x;
        int y;
    };

int main(void){
    int map[101][101];
    int board[101][101];
    int T[]={0,-1,1,0};
    int Y[]={1,0,0,-1};
    int w,h,xs,xg,ys,yg,n,color,muki,x,y;
    
    ST RE;
    ST GO;
    queue <ST> Q;
    while(1){
        memset(map,0,sizeof(map));
        memset(board,0,sizeof(board));
        cin>>w>>h;
        if(w==0&&h==0)break;
        cin>>xs>>ys>>xg>>yg>>n;
        for(int i=0;i<n;i++){
            cin>>color>>muki>>x>>y;
            if(muki==YOKO){
                for(int j=0;j<4;j++){
                    board[y][x+j]=board[y+1][x+j]=color;
                }
            }
            else{
                for(int j=0;j<4;j++){
                    board[y+j][x]=board[y+j][x+1]=color;
                }
            }
        }
       /* for(int i=1;i<=h;i++){
            for(int j=1;j<=w;j++){
                cout<<board[i][j];
            }
            cout<<endl;
        }*/
        RE.x=xs;
        RE.y=ys;
        map[ys][xs]=1;
        Q.push(RE);
        int flag=0;
        while(!Q.empty()){
            RE=Q.front();
            Q.pop();
            if(RE.x==xg&&RE.y==yg&&board[RE.y][RE.x]==board[yg][xg]){
                flag=1;
                //cout<<RE.x<<" "<<RE.y<<endl;
                break;
            }
            else{
                for(int i=0;i<4;i++){
                    GO=RE;
                    if(GO.x+Y[i]>0&&GO.y+T[i]>0&&GO.x+Y[i]<101&&GO.y+T[i]<101&&board[GO.y+T[i]][GO.x+Y[i]]==board[yg][xg]&&map[GO.y+T[i]][GO.x+Y[i]]!=1){
                        GO.x+=Y[i];
                        GO.y+=T[i];
                        map[GO.y][GO.x]=1;
                        Q.push(GO);
                    }
                }
            }
        }
       /* for(int i=0;i<h;i++){
            for(int j=0;j<w;j++){
                cout<<board[i][j];
            }
            cout<<endl;
        }*/
        if(flag==1){
            cout<<"OK"<<endl;
        }
        else{
            cout<<"NG"<<endl;
        }
    }
    
}

C++: #include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<complex>
#include<cmath>
#include<algorithm>
#include<map>
#include<vector>
#include<sstream>
#include<iostream>
#include<queue>
using namespace std;
const int dx[] = {1,0,-1,0},dy[] = {0,1,0,-1};
struct point{
    int x,y;
    point(){}
    point(int a, int b){x = a;y = b;}
};
int main(void){

    int w,h;
    while(cin>>w>>h,w){
        int xs,ys,xg,yg,n;
        cin>>xs>>ys>>xg>>yg>>n;
        int field[100][100] = {{0}};
        for(int i = 0;i < n;i++){
            int c,d,x,y;
            int dw = 4,dh = 2;
            cin>>c>>d>>x>>y;
            if(d)swap(dw,dh);
            for(int di = y;di < dh + y && di < h; di++){
                for(int dj = x;dj < dw + x && dj < w;dj++){
                    field[di][dj] = c;
                }
            }
        }
        int C = field[xs][ys];
        bool vis[100][100] = {{false}};
        queue<point> Q;
        Q.push(point(xs,ys));
        while(!Q.empty()){
            point P = Q.front();
            vis[P.x][P.y] = true;
            Q.pop();
            for(int i = 0;i < 4;i++){
                point p = point(P.x + dx[i],P.y + dy[i]);
                if(0 <= p.x && p.x < w && 0 <= p.y && p.y < h){
                    if(!vis[p.x][p.y]&&field[p.x][p.y] == C){
                        Q.push(p);
                    }
                }

            }
        }
        if(vis[xg][yg])cout<<"OK"<<endl;
        else cout<<"NG"<<endl;
    }


    return 0;
}

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


int F[1000][1000];

//?????????????????????
void r(int yy,int xx,int z){
 if(F[yy][xx]!=z){
	return ;
 }

F[yy][xx]=10;

r(yy-1,xx,z);
r(yy,xx+1,z);
r(yy+1,xx,z);
r(yy,xx-1,z);

}




int main(){
 int w,h,xs,ys,xg,yg,n;
 int c,d,x,y;

while(1){
 cin>>w>>h;

//?????????????????????0???????????????
 if(w==0&&h==0)break;
//???????????????????????????????????\?????°????±??????£???????????????
 cin>>xs>>ys>>xg>>yg>>n;

//n?????°???????????????????????????
for(int i=0;i<n;i++){
	cin>>c>>d>>x>>y;//?????????????????¨????????±????????????
	if(d==0){
		F[x  ][y]=c;
		F[x+1][y]=c;
 		F[x+2][y]=c;
 		F[x+3][y]=c;
 		F[x  ][y+1]=c;
 		F[x+1][y+1]=c;
 		F[x+2][y+1]=c;
 		F[x+3][y+1]=c;
	}
	if(d==1){
		F[x][y  ]=c;
 		F[x][y+1]=c;
		F[x][y+2]=c;
		F[x][y+3]=c;
 		F[x+1][y  ]=c;
		F[x+1][y+1]=c;
		F[x+1][y+2]=c;
 		F[x+1][y+3]=c;
	}
}

//??\????????????????????????


//??????????????????
r(xs,ys,F[xs][ys]);
//??´???????????????
if(F[xg][yg]==10){
	cout<<"OK"<<endl;
}else{
	cout<<"NG"<<endl;
}
//???????????????????????????
for(int i=1;i<=w;i++){
	for(int g=1;g<=w;g++){
		F[i][g]=6;
	}
}
//?????????????????????
}
return 0;
}