Ruudukko

"""
n = int(input())
matrix = []

for i in range(n):
    l = []
    l.append(input())
    l = [int(i) for i in l[0].split()]
    matrix.append(l)
"""

n = 3
matrix = [[2, 1, 3], [1, 1, 1], [9, 2, 7]]


def start_point(matrix=matrix, n=n):

    m = 0
    coords = ""
    for i in range(n):
        for j in range(n):
            if matrix[i][j] > m:
                m = matrix[i][j]
                coords = f"{j}:{i}"

    return coords

"""
def possible_moves(matrix=matrix, n=n):
    coords = {}

    for pY in range(n):
        for pX in range(n):
            coords[f"{pX}:{pY}"] = []

            mY = [i[pX] for i in matrix]
            mX = [i for i in matrix[pY]]

            for i in range(n):
                if mY[i] < matrix[pY][pX] and i != pY:
                    mY[i] = [mY[i], True]
                else:
                    mY[i] = [mY[i], False]

                if mX[i] < matrix[pY][pX] and i != pX:
                    mX[i] = [mX[i], True]
                else:
                    mX[i] = [mX[i], False]

                if mY[i][1] == True:
                    coords[f"{pX}:{pY}"].append(f"{pX}:{i}")

                if mX[i][1] == True:
                    coords[f"{pX}:{pY}"].append(f"{i}:{pY}")

    return coords
"""


def possible_moves(matrix=matrix, n=n):
    coords = {}

    for pY in range(n):
        for pX in range(n):
            coords[f"{pX}:{pY}"] = []

            mY = [i[pX] for i in matrix]
            mX = [i for i in matrix[pY]]

            for i in range(n):
                if mY[i] < matrix[pY][pX] and i != pY:
                    mY[i] = [mY[i], True]
                else:
                    mY[i] = [mY[i], False]

                if mX[i] < matrix[pY][pX] and i != pX:
                    mX[i] = [mX[i], True]
                else:
                    mX[i] = [mX[i], False]

                if mY[i][1] == True:
                    coords[f"{pX}:{pY}"].append(f"{pX}:{i}")

                if mX[i][1] == True:
                    coords[f"{pX}:{pY}"].append(f"{i}:{pY}")

    return coords


print(possible_moves())

def bfs(coords=possible_moves(), n=n):
    queue = []

    lens = 0
    a = 0
    for i in coords.keys():
        lens += len(coords[i])
        queue.append(i)

    while len(queue) > 0:
        m = queue.pop(0)

        for j in coords[m]:
            a += 1
            queue.append(j)

    print(a + n ** 2)


if __name__ == "__main__":
    bfs()

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 4

Group: 2, 3

Verdict: WRONG ANSWER

Test 5

Group: 2, 3

Verdict: WRONG ANSWER

Test 6

Group: 2, 3

Verdict: WRONG ANSWER

Test 7

Group: 3

Verdict: WRONG ANSWER

Test 8

Group: 3

Verdict: WRONG ANSWER

Test 9

Group: 3

Verdict: WRONG ANSWER