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 C[102][102];
int ans;
int xg,yg;

void meiro(int W,int H,int c){
  if(W==xg && H==yg){
    ans = 1;
    return;
  }
  if(C[W][H]!=c){
    return;
  }

  C[W][H] = '.';

  meiro(W-1,H  ,c);
  meiro(W  ,H+1,c);
  meiro(W+1,H  ,c);
  meiro(W  ,H-1,c);
}

int main(){
  while(1){
    int w,h;
    cin >> w >> h;

    if(w==0 && h==0){
      break;
    }

    int xs,ys;
    cin >> xs >> ys;

    cin >> xg >> yg;

    int n;
    cin >> n;
    int c[n],d[n],x[n],y[n];

    int cbase;

    for(int i=0;i<n;i++){
      cin >> c[i] >> d[i] >> x[i] >> y[i];

      if(d[i]==0){
        for(int j=x[i];j<x[i]+4;j++){
          for(int k=y[i];k<y[i]+2;k++){
            C[j][k]=c[i];
          }
        }
      }
      if(d[i]==1){
        for(int j=x[i];j<x[i]+2;j++){
          for(int k=y[i];k<y[i]+4;k++){
            C[j][k]=c[i];
          }
        }
      }

      cout << endl;

      if(x[i]==1 &&y[i]==1){
        cbase = c[i];
      }
    }

    meiro(xs,ys,cbase);

    if(ans==1){
      cout << "OK" << endl;
    }else{
      cout << "NG" << endl;
    }
  }

  return 0;
}

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

#define x first
#define y second

typedef pair<int,int> pii;

const int margin = 2;
int maze[128][128];
bool visited[128][128];
int h, w;

int main() {
	while(cin >> w >> h, w || h) {
		for(int i = 0; i < 128; i++){
			for(int j = 0; j < 128; j++) {
				maze[i][j] = -1;
				visited[i][j] = false;
			}
		}
		pii s, g;
		cin >> s.x >> s.y; s.x--; s.y--;
		cin >> g.x >> g.y; g.x--; g.y--;
		int n;
		cin >> n;
		for(int i = 0; i < n; i++) {
			int c, d, x_, y_;
			int l[][2] = {{2,4},{4,2}};
			cin >> c >> d >> x_ >> y_; x_--; y_--;
			for(int i = 0; i < l[d][0]; i++) {
				for(int j = 0; j < l[d][1]; j++) {
					maze[y_+i + margin][x_+j + margin] = c;
				}
			}
		}

		queue<pii> q;
		q.push(s);
		bool flg = false;
		while(!q.empty()) {
			pii cur;
			cur = q.front(); q.pop();

			if(cur == g) {
				flg = true;
				break;
			}

			int dx[] = {1,-1,0,0};
			int dy[] = {0,0,1,-1};
			for(int i = 0; i < 4; i++) {
				if(maze[cur.y+margin][cur.x+margin] == maze[cur.y+dy[i]+margin][cur.x+dx[i]+margin] && !visited[cur.y+dy[i]+margin][cur.x+dx[i]+margin]) {
					q.push(pii(cur.x+dx[i], cur.y+dy[i]));
					visited[cur.y+dy[i]+margin][cur.x+dx[i]+margin] = true;
				}
			}
		}

		if(flg)
			cout << "OK" << endl;
		else
			cout << "NG" << endl;
	}
}

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

int Array[200][200];

void DFS(int h,int w,int c){

    if(Array[h][w] != c || Array[h][w] == 0 || Array[h][w] == 6){
      return;
    }

    int tmp=Array[h][w];

    Array[h][w] = 6;

    DFS(h-1,w,tmp);
    DFS(h,w+1,tmp);
    DFS(h+1,w,tmp);
    DFS(h,w-1,tmp);


}

int main(){

    while(1){
      int H,W;
      int Start[2],Goal[2];
      int BlockNum;
      int color,dir,xpos,ypos;


      for(int i=0;i<200;i++){
        for(int j=0;j<200;j++){
          Array[i][j] = 0;
        }
      }

      cin >> H >> W;

      if(H == 0 && W == 0){
        break;
      }

      cin >> Start[0] >> Start[1];

      cin >> Goal[0] >> Goal[1];

      cin >> BlockNum;

      for(int i=0;i<BlockNum;i++){
        cin >> color >> dir >> xpos >> ypos;
        for(int i=0;i<4;i++){
          for(int j=0;j<2;j++){
            if(!dir){//?¨?
              Array[xpos+i][ypos+j] = color;
            }
            else{
              Array[xpos+j][ypos+i] = color;
            }
          }
        }
      }

      if(Array[Start[0]][Start[1]] != 0){
        DFS(Start[0],Start[1],Array[Start[0]][Start[1]]);
      }
      if(Array[Goal[0]][Goal[1]] == 6){
        cout << "OK" << endl;
      }
      else{
        cout << "NG" << endl;
      }

  }
    return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define shosu(n) setprecision(n)
using namespace std;
int w, h, xs, ys, xg, yg;
int mp[110][110];

bool dfs(int x, int y, int f) {
  if (x >= w || y >= h || x < 0 || y < 0 || mp[y][x] != f)
    return false;
  if (y == yg && x == xg && mp[y][x] == f)
    return true;
  mp[y][x] = 9;
  return dfs(x + 1, y, f) || dfs(x - 1, y, f) || dfs(x, y + 1, f) ||
         dfs(x, y - 1, f);
}

int main() {
  while (cin >> w >> h) {
    if (w == 0 && h == 0)
      break;
    int n;
    cin >> xs >> ys >> xg >> yg >> n;
    xs--;
    ys--;
    xg--;
    yg--;
    int c, d, x, y;
    rep(i, n) {
      cin >> c >> d >> x >> y;
      if (d == 0) {
        for (int i = y - 1; i < y + 1; i++)
          for (int j = x - 1; j < x + 3; j++) {
            mp[i][j] = c;
          }
      } else {
        for (int i = y - 1; i < y + 3; i++)
          for (int j = x - 1; j < x + 1; j++) {
            mp[i][j] = c;
          }
      }
    }
    cout << (dfs(xs, ys, mp[ys][xs]) ? "OK" : "NG") << endl;
  }
  return 0;
}