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
}

Python: BLOCK_WIDTH = 4
BLOCK_HEIGHT = 2
field = []
dx = [-1, 0, 1, 0]
dy = [0, 1, 0, -1]
w = 0
h = 0
xg = 0
yg = 0

def main():
    global field, w, h, xg, yg
    while True:
        w, h = map(int, input().split())
        if w == 0 and h == 0:
            break
        xs, ys = map(int, input().split())
        xg, yg = map(int, input().split())
        n = int(input())
        field = [[0] * w for _ in range(h)]
        for i in range(n):
            c, d, x, y = map(int, input().split())
            arrangement(c, d, x, y)

        if dfs(field[xs][ys], xs, ys):
            print("OK")
        else:
            print("NG")


def arrangement(c, d, x, y):
    global field
    if d == 0:
        for i in range(BLOCK_HEIGHT):
            for j in range(BLOCK_WIDTH):
                field[y + i][x + j] = c
    else:
        for i in range(BLOCK_WIDTH):
            for j in range(BLOCK_HEIGHT):
                field[y + i][x + j] = c


def dfs(c, x, y):
    global field

    if x < 0 or x >= w or y < 0 or y >= h:
        return False
    if field[y][x] != c:
        return False
    if x == xg and y == yg:
        return True
    field[y][x] = -1
    for i in range(4):
        next_x = x + dx[i]
        next_y = y + dy[i]
        if dfs(c, next_x, next_y):
            return True

    return False


if __name__ == '__main__':
    main()

Python: def dfs(x, y, m, v, W, H, xg, yg):
    '''
    '''
    v[y][x] = True
    for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:
        nx = x + dx
        ny = y + dy
        if nx in range(W) and ny in range(H) and m[ny][nx] == m[y][x] and v[ny][nx] == False:
            dfs(nx, ny, m, v, W, H, xg, yg)

if __name__ == '__main__':
    while True:
        H, W = list(map(int, input().split()))
        if H == 0 and W == 0:
            break
        xs, ys = list(map(lambda x: int(x)-1, input().split()))
        xg, yg = list(map(lambda x: int(x)-1, input().split()))
        n = int(input())
        m = [[0 for _ in range(W)] for __ in range(H)]
        v = [[False for _ in range(W)] for __ in range(H)]

        for _ in range(n):
            c, d, x, y = list(map(int, input().split()))
            x -= 1
            y -= 1
            if d == 0:
                for y in range(2):
                    for x in range(4):
                        m[y][x] = c
            else:
                for y in range(4):
                    for x in range(2):
                        m[y][x] = c

        dfs(xs, ys, m, v, W, H, xg, yg)
        if v[yg][xg]:
            print('OK')
        else:
            print('NG')

Python: # Aizu Problem 0207: Block

import sys, math, os

# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
    sys.stdin = open("sample-input.txt", "rt")


def build_grid(W, H, N, blocks):
    grid = [[0 for _ in range(W)] for __ in range(H)]
    for c, d, x, y in blocks:
        x, y = x - 1, y - 1
        if d == 0:
            # horizontal long:
            dx, dy = 4, 2
        else:
            # vertical long:
            dx, dy = 2, 4
        for xi in range(x, x + dx):
            for yi in range(y, y + dy):
                grid[yi][xi] = c
    return grid


def bfs(W, H, grid, xs, ys, xg, yg):
    delta = [[0, 1], [0, -1], [1, 0], [-1, 0]]
    color = grid[ys][xs]
    if color == 0:
        return "NG"
    visited = set()
    queue = [(xs, ys)]
    while len(queue) > 0:
        current = queue.pop(0)
        visited.add(current)
        col, row = current
        for drow, dcol in delta:
            row2, col2 = row + drow, col + dcol
            if 0 <= row2 < H and 0 <= col2 < W and grid[row2][col2] == color:
                # neighboring piece has same color:
                neighbor = (col2, row2)
                if neighbor == (xg, yg):
                    return "OK"
                if neighbor not in queue and neighbor not in visited:
                    queue.append(neighbor)
    return "NG"

    
while True:
    W, H = [int(_) for _ in input().split()]
    if W == H == 0:
        break
    xs, ys = [int(_) - 1 for _ in input().split()]
    xg, yg = [int(_) - 1 for _ in input().split()]
    N = int(input())
    blocks = [[int(_) for _ in input().split()] for __ in range(N)]
    grid = build_grid(W, H, N, blocks)
    print(bfs(W, H, grid, xs, ys, xg, yg))
    
    #for row in grid:
    #    print(''.join([str(r) for r in row]))
    #print(color)