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>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;

int color[200][200];
bool flg[200][200];
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

void dfs(int ny,int nx,int gy,int gx){
	flg[ny][nx]=true;
	rep(i,4){
		if(color[ny+dy[i]][nx+dx[i]]==color[ny][nx] && flg[ny+dy[i]][nx+dx[i]]==false)dfs(ny+dy[i],nx+dx[i],gy,gx);
	}
	return;
}

int main(){
	int w,h,n,c,d,x,y;
	pair<int,int> s,g;
	while(1){
		rep(i,200)rep(j,200)color[i][j]=flg[i][j]=0;
		cin>>w>>h;
		if(w==0 && h==0)break;
		cin>>s.first>>s.second;
		cin>>g.first>>g.second;
		cin>>n;
		rep(i,n){
			cin>>c>>d>>x>>y;
			if(d==0){
				rep(j,2){
					rep(k,4){
						color[y-1+j][x-1+k]=c;
					}
				}
			}else{
				rep(j,4){
					rep(k,2){
						color[y-1+j][x-1+k]=c;
					}
				}
			}
		}
		dfs(s.first-1,s.second-1,g.first-1,g.second-1);
		if(flg[g.second-1][g.first-1])cout<<"OK"<<endl;
		else cout<<"NG"<<endl;
	}
	return 0;
}

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

int F[102][102];

void DFS(int Y,int X,int C){
   if(F[Y][X]!=C)
      return;
   F[Y][X]=6;
   DFS(Y-1,X,C);
   DFS(Y,X+1,C);
   DFS(Y+1,X,C);
   DFS(Y,X-1,C);
} 

int main(){
   int w,h,xs,ys,xg,yg,n;
   int c,d,x,y;
   while(true){
      cin >> w >> h;
      if(w==0&&h==0)
         break;
      cin >> xs >> ys;
      cin >> xg >> yg;
      cin >> n;
      for(int i=1;i<=n;i++){
         cin >> c >> d >> x >> y;
         if(d==0){
             F[y+1][x+1]=c;
             F[y+1][x+2]=c;
             F[y+1][x+3]=c;
             F[y+1][x+4]=c;  
             F[y+2][x+1]=c;
             F[y+2][x+2]=c;
             F[y+2][x+3]=c;
             F[y+2][x+4]=c;   
         }
         else{
             F[y+1][x+1]=c;
             F[y+2][x+1]=c;
             F[y+3][x+1]=c;
             F[y+4][x+1]=c;  
             F[y+1][x+2]=c;
             F[y+2][x+2]=c;
             F[y+3][x+2]=c;
             F[y+4][x+2]=c;   
         }
      }
      if(F[ys+1][xs+1]==1&&F[ys+1][xs+1]==2&&F[ys+1][xs+1]==3&&F[ys+1][xs+1]==4&&F[ys+1][xs+1]==5)
         DFS(ys+1,xs+1,F[ys+1][xs+1]);
      if(F[yg+1][xg+1]==F[ys+1][xs+1])
         cout << "OK" << endl;
      else
         cout << "NG" << endl;
      for(int i=1;i<=w;i++)
         for(int j=1;j<=h;j++)
            F[i][j]=0;
      
   }
   return 0;
}

C++: #include<iostream>
#include<string>
#include<string.h>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<stdlib.h>
#include<queue>
#include<map>
#include<vector>
#include<list>
#include<stack>
#include<functional>

using namespace std;

#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0;i<n;i++)

typedef unsigned long long ull; typedef long long ll;

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

typedef pair<int ,int > P;

char maze[105][105];

int sx,sy; int gx,gy; int w,h;

char sc; //スタート地点のカラー

//stdin //stdout

void dfs(int x,int y) { maze[x][y]='9';

for(int i=0;i<4;i++) { int nx=x+dx[i]; int ny=y+dy[i];

if(0<=nx && nx<=w && 0<=ny && ny<=h &&maze[nx][ny]==sc) { dfs(nx,ny); }

} return ; }

void solve() {

rep(i,101) rep(j,101) maze[i][j]='0';

int n; char c; int d; int x,y;

cin>>sy>>sx; cin>>gy>>gx;

cin>>n;

rep(i,n) { cin>>c>>d>>y>>x;

if(d==1) { rep(i,4) { rep(j,2) { maze[x+i][y+j]=c;

} } } else if (d==0) { rep(i,2) { rep(j,4) { maze[x+i][y+j]=c;

} } }

} //6 6 //1 1 //3 6 //2 //1 0 1 1 //1 1 3 3 // rep(i,w+1) // { // rep(j,h+1) // { // cout<<maze[i][j]; //// } // cout<<endl; // } //// cout<<maze[gx][gy]<<endl;

if(maze[sx][sy]=='0') { cout<<"NG"<<endl; return; } else { sc=maze[sx][sy]; dfs(sx,sy); }

//rep(i,w+1) //{ // rep(j,h+1) // { // cout<<maze[i][j];

// } // cout<<endl; //}

if(maze[gx][gy]=='9') { cout<<"OK"<<endl; return; } else { cout<<"NG"<<endl; return; }

}

int main() {

while(cin>>w>>h) { if(w==0 && h==0) { return 0; } else { solve(); } }

return 0; }

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

int F[102][102];
int ans=0;

void set(int C2, int D2, int X2, int Y2){
	switch(D2){
				case 0:
					for(int i=0; i<2; i++){
						for(int j=0; j<4; j++){
							F[Y2+i][X2+j] = C2;
						}
					}
					break;
				case 1:
					for(int k=0; k<4; k++){
						for(int l=0; l<2; l++){
							F[Y2+k][X2+l] = C2;
						}
					}
					break;
			}
			
			return ;
			
}





void maze(int C, int D, int X, int Y){
	switch(C){
		case 1:
			set(C, D, X, Y);
			break;
		case 2:
			set(C, D, X, Y);
			break;
		case 3:
			set(C, D, X, Y);
			break;
		case 4:
			set(C, D, X, Y);
			break;
		case 5:
			set(C, D, X, Y);
			break;
	
	}

	return ;
	
}

void judge(int X, int Y, int XG, int YG, int A){
	
	if(A==0)
		return;
	
	cout << F[Y][X] << endl;
	
	
	if(F[YG][XG]==A)
		ans = 1;
	
	if(F[Y][X]!=A)		//　再帰関数が停止する条件
		return;
		
	F[Y][X] = 7;
	
	judge(Y-1, X  , XG, YG, A);		//　上
	
	judge(Y  , X+1, XG, YG, A);		//　右
	
	judge(Y+1, X  , XG, YG, A);		//　下
	
	judge(Y  , X-1, XG, YG, A);		//　左
	

}


int main()
{

	int w, h;
	int xs, ys;
	int xg, yg;
	int n;
	int c, d, x, y;
	
	while(1){
	
	cin >> w >> h;
	
	if(w==0 && h==0)
		return 0;
	
	cin >> xs >> ys;
	cin >> xg >> yg;
	cin >> n;
	
	
	
	
	for(int i=0; i<102; i++){
		for(int j=0;j<102; j++){
			F[i][j] = 0;
		}
	}
	
	for(int i=0; i<n; i++){
		cin >> c >> d >> x >> y;
		maze(c, d, x, y);
	
	}
	 
	for(int i=1; i<=h; i++){
		for(int j=1;j<=w; j++){
			cout << F[i][j];
		}
		cout << endl;
	}
			 
	ans = 0;
			 
			 
	int a = F[xs][ys];
			 
	judge(xs, ys, xg, yg, a);
	
	if(ans==1)
		cout << "OK" << endl;
		
	else
		cout << "NG" << endl;
		
	}

	return 0;

}