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>

int field[102][102];//y,x
bool flag;
int sx,sy,gx,gy,col;

void erase(){
	for(int i=0; i<102; i++)
		for(int j=0; j<102; j++)
			field[i][j] = 0;
}
void DFSr(int x, int y){
	if(field[y][x] != col)
		return;
	if(x == gx && y == gy){
		flag = true;
		return;
	}
	DFSr(x+1, y);
	if(flag)
		return;
	DFSr(x, y+1);
	if(flag)
		return;
	DFSr(x, y-1);
	if(flag)
		return;
	DFSr(x-1, y);
}

void DFSl(int x, int y){
	if(field[y][x] != col)
		return;
	if(x == gx && y == gy){
		flag = true;
		return;
	}
	DFSl(x-1, y);
	if(flag)
		return;
	DFSl(x, y+1);
	if(flag)
		return;
	DFSl(x, y-1);
	if(flag)
		return;
	DFSl(x+1, y);
}

void DFS(int x, int y){
	if(sx < gy)
		DFSr(x,y);
	else
		DFSl(x,y);
}

int main(){
	int n,c,d,bx,by;
	while(true){
		flag = false;
		erase();

		std::cin >> c >> d;
		if(!c && !d)
			return 0;

		std::cin >> sx >> sy;
		std::cin >> gx >> gy;

		std::cin >> n;
		for(int i=0; i<n; i++){
			std::cin >> c >> d >> bx >> by;
			if(d==0)
				for(int h=by; h<by+2; h++)
					for(int w=bx; w<bx+4; w++)
						field[h][w] = c;
			else
				for(int h=by; h<by+4; h++)
					for(int w=bx; w<bx+2; w++)
						field[h][w] = c;
		}

		col = field[gy][gx];
		DFS(sx, sy);
		if(flag)
			std::cout << "OK\n";
		else
			std::cout << "NG\n";
	}
}

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

class Solve{
private:
    int board[101][101] = {{0},{0},};
    int board_weight;
    int board_hight;
    int start_x;
    int start_y;
    int goal_x;
    int goal_y;
    int start_color;
    const int vector_x[4] = {0, 0, -1, 1};
    const int vector_y[4] = {1, -1, 0, 0};
    bool flag = false;
    void dfs(int x, int y);
public:
    Solve(int Board_Weight, int Board_Hight, int Start_X, int Start_Y, int Goal_X, int Goal_Y);
    void set_Block(int Color, int Direction, int X, int Y);
    bool check();
};

Solve::Solve(int Board_Weight, int Board_Hight, int Start_X, int Start_Y, int Goal_X, int Goal_Y){
    board_weight = Board_Weight;
    board_hight  = Board_Hight;
    start_x      = Start_X - 1;
    start_y      = Start_Y - 1;
    goal_x       = Goal_X - 1;
    goal_y       = Goal_Y - 1;
}
void Solve::set_Block(int Color, int Direction, int X, int Y){
    X -= 1; Y -= 1;
    if(X == start_x && Y == start_y){
        start_color = Color;
    }
    if(Direction == 0){
        for(int h = 0;h < 2;h++){
            for(int w = 0;w < 4;w++){
                board[Y+h][X+w] = Color;
            }
        }
    }else{
        for(int h = 0;h < 4;h++){
            for(int w = 0;w < 2;w++){
                board[Y+h][X+w] = Color;
            }
        }
    }
}
bool Solve::check(){
    Solve::dfs(start_x, start_y);
    return flag;
}

void Solve::dfs(int X, int Y){
    if(X == goal_x && Y == goal_y){
        flag = true;
        return;
    }
    
    for(int y = 0;y < 4;y++){
        for(int x = 0;x < 4;x++){
            int new_x = X + vector_x[x];
            int new_y = Y + vector_y[y];
            
            if(new_x >= 0 && new_x < board_weight){
                if(new_y >= 0 && new_y < board_hight){
                    if(start_color == board[new_y][new_x]){
                        board[Y][X] = 9;
                        dfs(new_x, new_y);
                    }
                }
            }
        }
    }
    return;
}

int main()
{
    while(true){
        int w, h, sx, sy, gx, gy, n, c, d, x, y;
        
        cin >> w >> h;
        if(w != 0 && h != 0){
            cin >> sx >> sy >> gx >> gy >> n;
            Solve s(w, h, sx, sy, gx, gy);
            
            for(int i = 0;i < n;i++){
                cin >> c >> d >> x >> y;
                s.set_Block(c, d, x, y);
            }
            
            if(s.check() == true){
                cout << "OK\n";
            }else{
                cout << "NG\n";
            }
        }else{
            break;
        }
    }
    
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define ANSWER(x) cout<<x<<endl
#define debug(x) cout<<#x<<": "<<x
const int BA = 1000;
const int INFTY = (1<<21);
int xg,yg,w,h,gc;
int maps[101][101];
int solve(int ys,int xs);
int main(){
  int tate[2] = {2,4};
  int yoko[2] = {4,2};
  int xs,ys,n;
  int c[101],d[101],x[101],y[101];
  while(1){
    fill(maps[0],maps[101],0);
    cin >> w >> h;
    if(w==0 && h==0)break;
    cin >> xs >> ys >> xg >> yg >> n;
    for(int i=0;i<n;i++){
      cin >> c[i] >> d[i] >> x[i] >> y[i];
    }
    for(int i=0;i<n;i++){
      for(int j=y[i];j<y[i]+tate[d[i]];j++){
	for(int k=x[i];k<x[i]+yoko[d[i]];k++){
	  if(j == ys && k == xs)gc = c[i];
	  maps[j-1][k-1] = c[i];
	}
      }
    }
    /* for(int i=0;i<h;i++){
       for(int j=0;j<w;j++){
       cout << maps[i][j];
       }
       cout << endl;
       }*///マップ確認用
    if(solve(ys-1,xs-1))cout << "OK\n";
    else cout << "NG\n";
  }
}
int solve(int ys,int xs){
  if(xs < 0 || ys < 0 || xs > w-1 || ys > h-1 || maps[ys][xs] == 0 || map[ys][xs] != gc){
    return 0;
  }
  else if(maps[ys][xs] == maps[yg-1][xg-1]){
    return 1;
  }
  maps[ys][xs] = 0;
  return solve(ys+1,xs) + solve(ys,xs+1)+ solve(ys-1,xs) + solve(ys,xs-1);
}