Submission #3518748

---

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())

a = [[-1 for _ in range(3)] for _ in range(3)]
b = [list(li()) for _ in range(2)]
c = [list(li()) for _ in range(3)]

def minimax(cnt: int):
    if cnt == 9:
        result = 0
        
        # 縦方向の一致
        for i in range(2):
            for j in range(3):
                if a[i][j] == a[i+1][j]:
                    result += b[i][j]
                    
        # 横方向の一致
        for i in range(3):
            for j in range(2):
                if a[i][j] == a[i][j+1]:
                    result += c[i][j]
                    
        return result
    
    else:
        # 0: 直大, 1:　直子
        turn = cnt%2
        ret = (-1)**(cnt+1) * (10**18)
        
        for i in range(3):
            for j in range(3):
                if a[i][j] == -1:
                    a[i][j] = turn
                    
                    if turn:
                        ret = min(ret, minimax(cnt+1))
                        
                    else:
                        ret = max(ret, minimax(cnt+1))
            
                    a[i][j] = -1
                
        return ret
    
ans = minimax(0)
print(ans)
print(sum([sum(b[i]) for i in range(2)]) + sum([sum(c[i]) for i in range(3)]) - ans)

Submission Info

Judge Result