Submission #1513023

---

Source Code Expand

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
gosa = 1.0 / 10**9
mod = 10**9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()


def main():
    a = [LI() for _ in range(5)]
    ii = [2**i for i in range(25)]

    d = collections.defaultdict(int)
    cs = set(range(25))
    for i in range(5):
        for j in range(5):
            ij = i*5 + j
            if a[i][j] > 0:
                d[a[i][j]] = ij + 1
                cs.remove(ij)

    def f(t, i):
        u = ii[i-5] if i > 4 else None
        d = ii[i+5] if i < 20 else None
        l = ii[i-1] if i % 5 != 0 else None
        r = ii[i+1] if i % 5 != 4 else None
        if u and d and ((t & u > 0 and t & d == 0) or (t & u == 0 and t & d > 0)):
            return False
        if l and r and ((t & l > 0 and t & r == 0) or (t & l == 0 and t & r > 0)):
            return False
        return True

    rd = collections.defaultdict(int)
    rd[0] = 1
    for k in range(1,26):
        ks = cs
        if d[k] > 0:
            ks = set([d[k] - 1])
        nd = collections.defaultdict(int)
        for nk in ks:
            ni = ii[nk]
            for pr, v in rd.items():
                if pr & ni > 0:
                    continue
                if f(pr, nk):
                    nd[pr | ni] += v
        rd = nd

    return sum(rd.values()) % mod



print(main())

Submission Info

Judge Result