Ruudukko

import sys

c = 1
n = int(input())
ruudukko = []
m = []

for i in range(n):
    row = list(tuple(([(int(x), i) for i, x in enumerate(sys.stdin.readline().split())])))
    copy = row[:]
    copy.sort(reverse=True)
    m.append(copy)
    ruudukko.append(row)

def getPoints(startPoint):
    nextPoints = []
    i = startPoint[0]
    j = startPoint[1]
    i2 = 0
    j2 = 0
    while i2 < n:
        if ruudukko[i2][j] < ruudukko[i][j] and i2 != i:
            nextPoints.append((i2, j))
        i2 += 1
    while j2 < n:
        if ruudukko[i][j2] < ruudukko[i][j] and j2 != j:
            nextPoints.append((i, j2))
        j2 += 1
    return nextPoints

def findStartPoint():
    startPoint = None
    largestNum = 0
    for i in range(n):
        if m[i][0][0] > largestNum and (i, m[i][0][1]) not in used:
            largestNum = ruudukko[i][0][1]
            startPoint = (i, m[i][0][1])
    used.append(startPoint)
    return startPoint

def getPaths(startPoint):
    nextPoints = getPoints(startPoint)
    for nextPoint in nextPoints:
        getPaths(nextPoint)
        global ans
        ans += 1
        ans %= 1000000007

ans = 0
used = []
while True:
    start = findStartPoint()
    if not start:
        break
    getPaths(start)

print(ans + n*n)

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: ACCEPTED

Test 4

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED