提出 #895862

---

ソースコード 拡げる

package main

import "fmt"

func main() {
	var r, c, n int
	fmt.Scan(&r)
	fmt.Scan(&c)
	fmt.Scan(&n)
	grid := make(map[int]map[int]int)
	var curr int
	for i := 0; i < n; i++ {
		fmt.Scan(&r)
		fmt.Scan(&c)
		fmt.Scan(&curr)
		if grid[r] == nil {
			grid[r] = (make(map[int]int))
		}
		grid[r][c] = curr
	}
	isSurpriseGrid(r, c, n, grid)
}

func isSurpriseGrid(r int, c int, n int, grid map[int]map[int]int) {
	notSurprise := false
	for i := 0; i < (n - 1); i++ {
		if notSurprise {
			fmt.Println("No")
			return
		}
		topLeft := grid[i][i]
		bottomLeft := grid[i][i+1]
		topRight := grid[i+1][i]
		bottomRight := grid[i+1][i+1]

		if topLeft >= 0 && bottomLeft >= 0 && topRight >= 0 && bottomRight >= 0 { // can skip the current row

		} else if topLeft < 0 && (bottomLeft >= 0 && topRight >= 0 && bottomRight >= 0) {
			// find a value for top left
			if (bottomLeft+topRight)-bottomRight > 0 {
				grid[i][i] = (bottomLeft + topRight) - bottomRight
			} else {
				notSurprise = true
			}
		} else if bottomRight < 0 && (topRight >= 0 && topLeft >= 0 && bottomRight >= 0) {
			if (bottomLeft+topRight)-topLeft > 0 {
				grid[i+1][i+1] = (bottomLeft + topRight) - topLeft
			} else {
				notSurprise = true
			}
		} else if bottomLeft < 0 && (topLeft >= 0 && topRight >= 0 && bottomRight >= 0) {
			if (topLeft+bottomRight)-topRight > 0 {
				grid[i][i+1] = (topLeft + bottomRight) - topRight
			} else {
				notSurprise = true
			}
		} else if topRight < 0 && (topLeft >= 0 && bottomLeft >= 0 && bottomRight >= 0) {
			if (topLeft+bottomRight)-bottomLeft > 0 {
				grid[i+1][i] = (topLeft + bottomRight) - bottomLeft
			} else {
				notSurprise = true
			}
		} else {
			notSurprise = true
		} // always need to check current 4 are a valid config
		if (topLeft + bottomRight) != (bottomLeft + topRight) {
			notSurprise = true
		}
	}
	fmt.Println("Yes")
}

提出情報

ジャッジ結果