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<map>
#include<queue>
#include<cstdio>
#include<cstring>
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#define SIZE 110
using namespace std;

typedef pair<int,int> P;

void make_mass(void);   //マス作成用関数
void solve(void);       //処理

int n;             //ブロックの個数
int w,h;           //ボードの幅、高さ
int goal=0;        //迷路になっているか
int scolor;        //スタート位置の色
int sx,sy,gx,gy;   //スタートの座標、ゴールの座標
int mass[SIZE][SIZE];
int data[SIZE][SIZE];
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int c[SIZE],d[SIZE],x[SIZE],y[SIZE];       //ブロックの色、向き、左上の座標


int main(){

  int i,j;             //カウンタ変数

  while(1){

    /*情報の入力*/
    cin>>w>>h;

    if(w==h && w==0){break;}
    
    cin>>sx>>sy;
    cin>>gx>>gy;  
    cin>>n;
    
    for(i=0;i<n;i++){
      cin>>c[i]>>d[i]>>x[i]>>y[i];
      
    }
    
    make_mass();

    solve();
     
    if(goal==1){
      cout<<"OK"<<endl;
      goal=0;
    } else if(goal==0){
      cout<<"NG"<<endl;
      }
  }
  
  return 0;
}
void make_mass(void){
  
  int i,j;

  memset(mass,0,sizeof(mass));

  /*マスの作成*/
  for(i=0;i<n;i++){
    if(d[i]==0){       //横向きなら
      for(j=0;j<4;j++){
	mass[y[i]][x[i]+j]=c[i];
	mass[y[i]+1][x[i]+j]=c[i];
      }
    }
    if(d[i]==1){              //縦向きなら
      for(j=0;j<4;j++){
	mass[y[i]+j][x[i]]=c[i];
	mass[y[i]+j][x[i]+1]=c[i];
      }
    }
  }
  
  scolor=mass[sy][sx];

  
  return;
}
void solve(void){
  
  int i,j;
  queue<P> que;
  memset(data,-1,sizeof(data));
  que.push(P(sx,sy));     //queにスタート位置の座標を格納
  data[sy][sx]==0;
  
  while(!que.empty()){    //queが空でない間
    P p=que.front();
    que.pop();
    
    if(p.first==gy && p.second==gx){
      goal=1;
      /* cout<<" (^q^)くおえうえーーーるえうおおおwwww"<<endl;*/
      break;
    }
    for(i=0;i<4;i++){
      int nx=p.first+dx[i];
      int ny=p.second+dy[i];
      if(nx>=0 && nx<w && ny>=0 && ny<h && mass[ny][nx]==scolor && data[ny][nx]==-1){
	que.push(P(nx,ny));
	data[ny][nx]=1;
      }
    }
  }
  return;
}
/*
花火は他人に向けちゃダメだよ。

( ・ω・)o─━・*:・:・(※)`Д´)アヂィ!

*/

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

int w,h;
int sx,sy,gx,gy;
int n,c,d,x,y;
int g[200][200];
bool use[200][200];
int dy[] = {-1,0,1,0}, dx[] = {0,1,0,-1};

void rec(int Y,int X, char c){
  if(use[Y][X])return;
  use[Y][X] = true;

  for(int i=0;i<4;i++){
    int ny = Y+dy[i], nx = X+dx[i];
    if(ny<1 || nx<1 || ny>h || nx>w)continue;
    if(g[ny][nx] == c)rec(ny,nx,c);
  }
}

int main(){
  while(cin >> w >> h,w||h){
    for(int i=1;i<=h;i++){
      for(int j=1;j<=w;j++)g[i][j] = 0;
    }

    cin >> sx >> sy >> gx >> gy >> n;
    for(int i=0;i<n;i++){
      cin >> c >> d >> x >> y;
      if(d==0){
	for(int j=0;j<2;j++){
	  for(int k=0;k<4;k++){
	    g[y+j][x+k] = c;
	  }
	}
      }else{
	for(int j=0;j<4;j++){
	  for(int k=0;k<2;k++){
	    g[y+j][x+k] = c;
	  }
	}
      }
    }

    if(!g[sy][sx] || !g[gy][gx] || g[sy][sx] != g[gy][gx]){
      cout << "NG\n";
    }else{
      rec(sy,sx,g[sy][sx]);
      cout << (use[gy][gx]?"OK":"NG") << endl;
    }
  }
}

C++: #include "stdafx.h"
#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 = 1;i <= H;i++) {
			for (int j = 1;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;
			}
		}
		if(F[ys][xs]!=0)
			DFS(ys, xs, F[ys][xs]);

		if (F[yg][xg] == F[ys][yg]) {
			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<stdio.h>
int w,h;
int is(int x,int y){
	return (x>=0 && x < w && y>=0 && y< h);
}
int main(void){
	const int dx[4]={0,1,0,-1};
	const int dy[4]={1,0,-1,0};
	int qx[100000];
	int qy[100000];
	int p,mx;
    int n,m[101][101]={0};
    int xs,ys,xg,yg,a,c,d,x,y,cnt,f;
	for(;;){
		scanf("%d %d",&w,&h);
		//printf("%d %d\n",w,h);
		if(w==0)break;
		for(int i=0;i<w;i++){
			for(int j=0;j<h;j++){
				m[i][j]=0;
			}
		}
		scanf("%d %d %d %d",&xs,&ys,&xg,&yg);
		scanf("%d",&n);
		for(int i=0;i<n;i++){
			scanf("%d %d %d %d",&c,&d,&x,&y);
			for(int j=0;j<(d==0?2:4);j++){
				for(int k=0;k<(d==0?4:2);k++){
					m[x-1+k][y-1+j]=c;
				}
			}
		}
		c = m[xs-1][ys-1];
		p=0;
		mx=1;
		qx[0]=xs-1;
		qy[0]=ys-1;
		f=c!=0;

		for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){
				printf("%d ",m[j][i]);
			}
			puts("");
		}
		printf("%d\n",c);
		while(f && p<mx){
			cnt = 0;
			for(int i=0;i<4;i++){
				x = qx[p] + dy[i];
				y = qy[p] + dx[i];
				if(is(x,y) && m[x][y] == c){
					m[x][y]=-1;
					cnt++;
					qx[p+cnt] = x;
					qy[p+cnt] = y;
					if(x == xg-1 && y == yg-1)f=0;
				}
			}
			mx += cnt;
			p++;
		}
		puts(f?"NG":"OK");
	}
    return 0;
}