Submission #2114005

---

Source Code Expand

from bisect import bisect
N = int(input())
C = []
M = {}
for i in range(N):
    *c, = map(int, input().split())
    c = tuple(min(c[j:] + c[:j] for j in range(1, 5)))
    C.append(c)
    M.setdefault(c, []).append(i)
def count(p, q, r, s):
    if p == q == r == s:
        return 4
    if p == r and q == s:
        return 2
    return 1
def solve(i, j, k):
    ci = C[i]; cj = C[j]
    R = {}
    for l in range(4):
        #  [l]   [l-1]
        # [l+k] [l+k+1]
        c = ci[l], ci[l-1], cj[(k-l+1)%4], cj[(k-l)%4]
        c = tuple(min(c[j:] + c[:j] for j in range(1, 5)))
        if c not in M:
            return 0
        R[c] = R.get(c, 0) + 1
    res = 1
    for c in R:
        m = M[c]
        cnt = len(m) - bisect(m, i)
        if c == cj:
            cnt -= 1
        if cnt < R[c]:
            return 0
        k = count(*c)
        r = 1
        for p in range(cnt-R[c]+1, cnt+1):
            r *= p
        r *= k**cnt
        res *= r
    return res

ans = 0
for i in range(N):
    for j in range(i+1, N):
        for k in range(4):
            ans += solve(i, j, k)
print(ans)

Submission Info

Judge Result