提出 #65447073

---

ソースコード 拡げる

import sys

def check_str(t,u):
    if len(t) < len(u):
        return False
    for i,c in enumerate(u):
        if t[i] not in {'?', u[i]}:
            return False
    return True

def rotate(N, a:[[]]) -> [[]]:
    b = [[0]*N for i in range(N)]
    for i in range(N):
        for j in range(N):
            b[j][N-1-i] = a[i][j]
    return b

def calc_diffs(N:int, S:[[]], T:[[]]) -> int:
    diffs = 0
    for i in range(N):
        for j in range(N):
            if S[i][j] != T[i][j]:
                diffs += 1
    return diffs

def main():
    input = sys.stdin.readline
    N = int(input())
    S = []
    T = []
    for _ in range(N):
        S.append(list(input()[:-1]))
    for _ in range(N):
        T.append(list(input()[:-1]))

    min_d = calc_diffs(N, S, T)
    S = rotate(N, S)
    min_d = min(min_d, calc_diffs(N, S, T)+1)
    S = rotate(N, S)
    min_d = min(min_d, calc_diffs(N, S, T)+2)
    S = rotate(N, S)
    min_d = min(min_d, calc_diffs(N, S, T)+3)

    print(min_d)

main()

提出情報

ジャッジ結果