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<cstdio>
#include<queue>
using namespace std;
#define MAX 101
#define Nll -1
int w,h;
int xs,ys,xg,yg;
int blockNm;
int map[MAX][MAX];
typedef queue < pair<int,int> > Queue;
void setBlock(int color,int dir,int x,int y){
	int dx[]={2,0};
	int dy[]={0,2};
	int xb=x,yb=y;//x_base,y_base
	for(int i=0;i<2;i++,xb+=dx[dir],yb+=dy[dir]){
		map[yb][xb]
		        =map[yb][xb+1]
		        =map[yb+1][xb]
		        =map[yb+1][xb+1]=color;
	}
}
void init(){
	for(int i=0;i<MAX;i++)for(int j=0;j<MAX;j++)map[i][j]=-1;
}
void print(){
	for(int i=0;i<h;i++){for(int j=0;j<w;j++)printf("%2d",map[i][j]);cout<<endl;}
}
bool isGoal(int xs,int ys,int xg,int yg){
	int color=map[xs][ys];
	int dx[]={ 0, 1, 0,-1};
	int dy[]={-1, 0, 1, 0};
	Queue q;
	q.push(pair<int,int>(xs,ys));
	while(!q.empty()){
		pair<int,int> cur=q.front();q.pop();
		if(cur.first==xg&&cur.second==yg)return true;
		map[cur.first][cur.second]=Nll;
		for(int i=0;i<4;i++){
			if(cur.first+dx[i]<1||cur.first+dx[i]>w
					||cur.second+dy[i]<1||cur.second+dy[i]>h
					||map[cur.first+dx[i]][cur.second+dy[i]]==Nll
					||map[cur.first+dx[i]][cur.second+dy[i]]!=color)continue;
			q.push(pair<int,int>(cur.first+dx[i],cur.second+dy[i]));
		}
	}
	return false;
}
int main(){
	while(cin>>w>>h&&(w||h)){
		init();
		cin>>xs>>ys>>xg>>yg>>blockNm;
		for(int i=0;i<blockNm;i++){
			int color,dir,x,y;
			cin>>color>>dir>>x>>y;
			setBlock(color,dir,x,y);
		}
		//print();
		string ans=isGoal(xs,ys,xg,yg)?"OK":"NO";
		cout<<ans<<endl;
	}

	return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
int dy[] = {1, 0, 0, -1};
int dx[] = {0, 1, -1, 0};
int b[110][110];
int w, h;
int xs, ys, xg, yg;
int color;
bool flag = false;
bool used[110][110];

void dfs(int y, int x, int py, int px){
	rep(i, 4){
		int ny = y + dy[i], nx = x + dx[i];
		if(used[ny][nx]) continue;//???????????¨???????????????????????????
		if(!(0 <= ny && ny < h && 0 <= nx && nx < w)) continue;
		if(b[ny][nx] != color) continue;
		if(ny == py && nx == px) continue;
		if(ny == yg && nx == xg){
			flag = true;return;
		}
		used[ny][nx] = true;
		dfs(ny, nx, y, x);
	}
	return;//????????¢?????¨???????????????
}

int main(void){
	while(1){
		rep(i, 110)rep(j, 110){
			b[i][j] = -1; used[i][j] = false;
		}
		cin >> w >> h;
		if(w == 0 && h == 0) return 0;
		cin >> xs >> ys >> xg >> yg;
		xs--; ys--; xg--; yg--;
		int n; cin >> n;
		rep(i, n){
			int c, d, x, y;
			cin >> c >> d >> x >> y;
			x--; y--;
			if(d == 0){//?¨?
				b[y][x] = b[y][x + 1] = b[y][x + 2] = b[y][x + 3] = c;
				b[y + 1][x] = b[y + 1][x + 1] = b[y + 1][x + 2] = b[y + 1][x + 3] = c;
			}else{//???
				b[y][x] = b[y][x + 1] = c;
				b[y + 1][x] = b[y + 1][x + 1] = c;
				b[y + 2][x] = b[y + 2][x + 1] = c;
				b[y + 3][x] = b[y + 3][x + 1] = c;
			}
		}
		color = b[ys][xs];
		if(color == -1) {//?????????????????????????????????
			printf("NG\n"); continue;
		}
		used[ys][xs] = true; flag = false;
		dfs(ys, xs, -1, -1);
		if(flag) printf("OK\n");
		else printf("NG\n");
	}
}

C++: #include<iostream>
#include<cstdio>
using namespace std;
int w,h,xs,ys,xg,yg,n;
int c,d,x,y,ans=0,f=0;
int map[101][101]={0},v[101][101]={0};
int root(int x,int y,int vmap[][101]){
	int mx[]={0,1,0,-1},fx;
	int my[]={1,0,-1,0},fy;
	if(x==xg&&y==yg){
		f=1;
		return f;
	}
	for(int i=0;i<4;i++){
		fx=x+mx[i];
		fy=y+my[i];
		if(map[fy][fx]==map[xs][ys]&&fy>=0&&fy<h&&fx>=0&&fx<w&&vmap[fy][fx]==0){
			vmap[fy][fx]=1;
			return root(fx,fy,vmap);
		}
	}
	return f;
}
int main(){
	scanf("%d %d",&w ,&h);
	while(w!=0&&h!=0){
		scanf("%d %d %d %d %d",&xs ,&ys ,&xg ,&yg ,&n);
		for(int i=0;i<n;i++){
			scanf("%d %d %d %d",&c ,&d ,&x ,&y);
			if(d==0){
				for(int w=x;w<x+4;w++){
					for(int h=y;h<y+2;h++){
						map[h][w]=c;
					}
				}
			}
			if(d==1){
				for(int w=x;w<x+2;w++){
					for(int h=y;h<y+4;h++){
						map[h][w]=c;
					}
				}
			}
		}
		/*for(int i=0;i<w;i++){
			for(int i1=0;i1<h;i1++){
				printf("%d ",map[i][i1]);
			}printf("\n");
		}*/
		x=xs;
		y=ys;
		ans=root(x,y,v);
		if(ans==1){
			printf("OK\n");
		}
		else{
			printf("NG\n");
		}
		for(int i=0;i<101;i++){
			for(int i1=0;i1<101;i1++){
				map[i][i1]=0;
				v[i][i1]=0;
			}
		}
		f=0;
		ans=0;
		scanf("%d %d",&w ,&h);
	}
	return 0;
}

C++: #include <iostream>
using namespace std;
   
int F[102][102];
int xg,yg,w,h;
   
   
void DFS(int Y,int X,int c){
  //if(Y < 1 || X < 1)
    //return;
  if(F[Y][X] != c){
    return;
  }
   
  F[Y][X] = -1;
  DFS(Y+1,X  ,c);
  DFS(Y-1  ,X,c);
  DFS(Y,X+1  ,c);
  DFS(Y  ,X-1,c);
}
   
   
int main(){
  int xs,ys,n;
  while(1){
    cin >> w >> h;
    if(w == 0 && h == 0)
      break;
for(int i=0; i<102; i++){
      for(int j=0; j<102; j++){
        F[i][j] = 10;
      }
    }
       F[0][102] = 0;
    cin >> xs >> ys >> xg >> yg >> n;
   
   
    for(int i=0;i<n;i++){
      int c,d,x,y;
      cin >> c >> d >> x >> y;
      if(c == 0)
         c = 1919810;
      if(d == 0){
        for(int j=0;j<4;j++){
          F[x+j][y] = c;
          F[x+j][y+1] = c;
        }
      } else {
        for(int j=0;j<4;j++){
          F[x][y+j] = c;
          F[x+1][y+j] = c;
        }
      }
    }
  DFS(xs,ys,F[xs][ys]);
   
  if(F[xg][yg] == -1){
    cout << "OK" << endl;
  } else {
    cout << "NG" <<endl;
  }
  }
}