Submission #3974675

---

Source Code Expand

import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

from itertools import permutations

def check(x: list):
    for i in range(3):
        for j in range(5):
            if x[i][j] < x[i+1][j] < x[i+2][j] or x[i][j] > x[i+1][j] > x[i+2][j]:
                return False
            
    for i in range(5):
        for j in range(3):
            if x[i][j] < x[i][j+1] < x[i][j+2] or x[i][j] > x[i][j+1] > x[i][j+2]:
                return False
            
    return True

hole = []
x = [list(li()) for _ in range(5)]
st = ([i for i in range(1,26)])
for i, xi in enumerate(x):
    for j, xij in enumerate(xi):
        if xij in st:
            st.remove(xij)
        else:
            hole.append((i,j))
        
lacked = list(st)
cands = list(permutations(lacked))
ans = 0
for ci in cands:
    for cij, (holei, holej) in zip(ci, hole):
        x[holei][holej] = cij
    
    ans += check(x)
    
print(ans)

Submission Info

Judge Result