Submission #48406875

---

Source Code Expand

import itertools
import os
import sys
from typing import List

sys.setrecursionlimit(210000)


if os.getenv('TEST'):
    def eprint(*args, **kwargs):
        print('[\033[31mEPRINT\033[0m]', *args, file=sys.stderr, **kwargs)
else:
    def eprint(*args, **kwargs):
        pass


def main() -> None:
    H, W = map(int, input().split())
    A = [list(map(int, input().split())) for _ in range(H)]
    B = [list(map(int, input().split())) for _ in range(H)]
    candidates = []

    for r in itertools.permutations(range(H)):
        for c in itertools.permutations(range(W)):
            if all(A[r[i]][c[j]] == B[i][j] for i in range(H) for j in range(W)):
                candidates.append((r, c))

    for r, c in candidates:
        eprint(r, c)

    if len(candidates) == 0:
        print(-1)
        return

    min_move = 1_000_000_000
    for r, c in candidates:
        move = sum(int(r[i] > r[j]) for i in range(H) for j in range(i + 1, H))
        move += sum(int(c[i] > c[j]) for i in range(W) for j in range(i + 1, W))
        min_move = min(min_move, move)

    print(min_move)


if __name__ == '__main__':
    main()

Submission Info

Judge Result