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>
using namespace std;

int F[102][102];


int DFS(int Y,int X,int c){
  int cnt = 0;
  if(F[Y][X] != c){
    return 0;
  }

  F[Y][X] = -1;
  cnt += DFS(Y-1,X  ,c);
  cnt += DFS(Y  ,X+1,c);
  cnt += DFS(Y+1,X  ,c);
  cnt += DFS(Y  ,X-1,c);
  return cnt;
}


int main(){
  int w,h,xs,ys,xg,yg,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]=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(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;
        }
      }
    }

  if(DFS(xs,ys,F[xs][ys])){
    cout << "OK" << endl;
  } else {
    cout << "NG" <<endl;
  }
  }
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<list>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<numeric>
#include<vector>
#include<cstdio>
#include<climits>
#include<cfloat>
#include<cstring>
#define foreach(t,p,it) for(t::iterator it=p.begin(),it!=p.end(),++it)
#define all(p) p.begin(),p.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(n) rep(i,n)
using namespace std;

const int W=210,H = 210;
int block[W][H];
int ans;

int w,h,xs,ys,xg,yg,n,c,d,x,y;
void solve(int xi,int yi)
{
    if(block[xi][yi] == 0) return ;
    if(xi==xg && yi==yg){ ans = 1; return;}
    if(block[xi][yi] == c)
    {
        block[xi][yi] = 0;
        solve(xi-1, yi);
        solve(xi, yi-1);
        solve(xi+1, yi);
        solve(xi, yi+1);
    }
    block[xi][yi] = 0;
    return;
}

int main()
{
    while(cin >> w >> h )
    {
        if(w==0 && h==0) break;
        memset(block,0,sizeof(int)*w*h);
        ans = 0;
        cin >> xs >> ys;
        cin >> xg >> yg;
        cin >> n;
        REP(n)
        {
            cin >> c >> d >> x >> y;
            //cout << x << ","<< y << endl;
            if(d==1) //tate
            {
                block[x][y] = c;
                block[x][y+1] =c;
                block[x][y+2] = c;
                block[x][y+3] = c;
                block[x+1][y] = c;
                block[x+1][y+1] = c;
                block[x+1][y+2] = c;
                block[x+1][y+3] = c;
            }
            else
            {
                block[x][y] = c;
                block[x+1][y] = c;
                block[x+2][y] = c;
                block[x+3][y] = c;
                block[x][y+1] = c;
                block[x+1][y+1] = c;
                block[x+2][y+1] = c;
                block[x+3][y+1] = c;
            }
        }
        c = block[xs][ys];
        solve(xs,ys);

        if(ans) cout << "OK" << endl;
        else cout << "NG" << endl;

    }

    return 0;
}

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

int F[105][105];
int xg,yg;


void DFS(int Y,int X,int c){
  if(F[Y][X] != c){
    return;
  }

  F[Y][X] = -1;
  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,n;
  while(1){
    cin >> w >> h;
    if(w == 0 && h == 0)
      break;

      for(int i=0;i<105;i++){
        for(int j=0;j<105;j++){
                F[i][j]=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(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;
  }
  }
}

C++: #include<iostream>
#include<queue>
#include<vector>
#include<list>

typedef struct block
{
	int x;
	int y;
	int h;
	int w;
	int color;
}block;

block blocks[1280];

std::queue<int> que;
std::list<int> adjacive[1280];

void makelist(int n);
bool BFS(int start,int goal);

int main()
{
	int n,w,h,xs,ys,xg,yg,start,goal;
	while(1)
	{
		while(!que.empty()){que.pop();}
		start=-1;
		goal=-1;
		std::cin>>w>>h;
		if(w==0&&h==0)break;
		std::cin>>xs>>ys>>xg>>yg>>n;
		for(int i=0;i<n;i++)
		{
			int c,d,x,y;
			std::cin>>c>>d>>x>>y;
			blocks[i].color=c;
			blocks[i].x=x;
			blocks[i].y=y;
			if(d==0)
			{
				blocks[i].h=2;
				blocks[i].w=4;
			}
			else
			{
				blocks[i].h=4;
				blocks[i].w=2;
			}
			if(blocks[i].x<=xs&&blocks[i].x+blocks[i].w>=xs&&blocks[i].y<=ys&&blocks[i].y+blocks[i].h>=ys)
			{
				start=i;
			}
			else if(blocks[i].x<=xg&&blocks[i].x+blocks[i].w>=xg&&blocks[i].y<=yg&&blocks[i].y+blocks[i].h>=yg)
			{
				goal=i;
			}
		}
		makelist(n);
		if(BFS(start,goal))
		{
			std::cout<<"OK"<<std::endl;
		}
		else
		{
			std::cout<<"NG"<<std::endl;
		}
	}
	return 0;
}

void makelist(int n)
{
#define x1 blocks[i].x
#define y1 blocks[i].y
#define h1 blocks[i].h
#define w1 blocks[i].w
#define x2 blocks[j].x
#define y2 blocks[j].y
#define h2 blocks[j].h
#define w2 blocks[j].w

	for(int i=0;i<n;i++)
	{
		adjacive[i].clear();
		for(int j=0;j<n;j++)
		{
			if(blocks[i].color==blocks[j].color)
			{
				if((x1==x2+w2&&y1<=y2+h2-1&&y1+h1-1>=y2)||(x2==x1+w1&&y1<=y2+h2-1&&y1+h1-1>=y2)||(y1==y2+h2&&x1<=x2+w2-1&&x1+w1-1>=x2)||(y2==y1+h1&&x1<=x2+w2-1&&x1+w1-1>=x2))
				{
					adjacive[i].push_back(j);
				}
			}
		}
	}
}

bool BFS(int start,int goal)
{
	int survey;
	que.push(start);
	
	while(!que.empty())
	{
		survey=que.front();
		que.pop();
		for(std::list<int>::iterator it=adjacive[survey].begin();it!=adjacive[survey].end();it++)
		{
				que.push(*it);
		}
		adjacive[survey].clear();
		if(survey==goal)
		{
			return true;
		}
	}
	return false;
}