[Silver IV] 2578 빙고

대각선 2개 & 가로or세로 한줄 이면 12개일 때가 최소 호출 수다..

cnt_num >= 13으로 해서 계속 오류 났었다..

근데 생각보다 코드 최적화는 할게 없었음

 

import sys

board = [list(map(int, sys.stdin.readline().split())) for _ in range(5)]
numbers = [list(map(int, sys.stdin.readline().split())) for _ in range(5)]

def find_index(number):
    for i in range(5):
        for j in range(5):
            if board[i][j] == number:
                return i, j

def find_bingo_x():
    bingo_x = 0
    for i in range(5):
        cnt = 0
        for j in range(5):
            if board[i][j] < 0:
                cnt += 1
        if cnt == 5:
            bingo_x += 1
    return bingo_x

def find_bingo_y():
    bingo_y = 0
    for j in range(5):
        cnt = 0
        for i in range(5):
            if board[i][j] < 0:
                cnt += 1
        if cnt == 5:
            bingo_y += 1
    return bingo_y

def find_bingo_xy():
    bingo_xy = 0

    cnt = 0
    for i in range(5):
        if board[i][i] < 0:
            cnt += 1
    if cnt == 5:
        bingo_xy += 1

    cnt = 0
    for i in range(5):
        if board[i][4 - i] < 0:
            cnt += 1
    if cnt == 5:
        bingo_xy += 1

    return bingo_xy

def find_bingo():
    return find_bingo_x() + find_bingo_y() + find_bingo_xy()

cnt_num = 0
for i in range(5):
    for j in range(5):
        x, y = find_index(numbers[i][j])
        board[x][y] *= -1
        cnt_num += 1

        if cnt_num >= 12 and find_bingo() >= 3:
            print(cnt_num)
            sys.exit()