Submission #2380646

---

Source Code Expand

row, col = 30, 30
board = [[-1 for i in range(30)] for i in range(30)]

dx = (1, 0, 0, -1)
dy = (0, 1, -1, 0)


def _input():
    for i in range(30):
        l = map(int, input().split())
        for j, v in enumerate(l):
            board[i][j] = v


def solve_fool():
    global board
    for i in range(row):
        for j in range(col):
            while(board[i][j] > 0):
                board[i][j] -= 1
                print(i+1, j+1)

def out_map(x, y):
    return not (x > -1 and y > -1 and x < row and y < col)

def is_top(x, y):
    for d in range(len(dx)):
        nx = x + dx[d]
        ny = y + dy[d]
        if (out_map(nx, ny)):
            continue
        if board[x][y] <= 0 or board[nx][ny] > board[x][y]:
            return False
    return True



def choose_top():
    for i in range(row):
        for j in range(col):
            if(is_top(i, j)):
                return i, j
    return None

def solve_wisdom():
    global board
    p = choose_top()
    while p != None:
        while True:
            x, y = p[0], p[1]
            print(x+1, y+1)
            board[x][y] -= 1
            next_point = None
            for d in range(len(dx)):
                nx = x + dx[d]
                ny = y + dy[d]
                if out_map(nx, ny):
                    continue
                if (board[x][y] == board[nx][ny] and board[nx][ny] > 0):
                    next_point = nx, ny
                    break
            if next_point != None:
                p = next_point
                continue
            break
        p = choose_top()




def solve():
    _input()
    # solve_fool()
    solve_wisdom()

if __name__ == "__main__":
    solve()

Submission Info

Judge Result