Submission #2066056

---

Source Code Expand

import Data.Map.Strict (Map, (!))
import qualified Data.Map.Strict as M

data Check = O | X deriving (Eq, Show)

main :: IO ()
main = do
  [b11,b12,b13] <- map read . words <$> getLine 
  [b21,b22,b23] <- map read . words <$> getLine
  [c11,c12] <- map read . words <$> getLine
  [c21,c22] <- map read . words <$> getLine
  [c31,c32] <- map read . words <$> getLine
  let
    ps = M.fromList [(((1,1),(2,1)),b11),(((1,2),(2,2)),b12),(((1,3),(2,3)),b13),
                     (((2,1),(3,1)),b21),(((2,2),(3,2)),b22),(((2,3),(3,3)),b23),
                     (((1,1),(1,2)),c11),(((1,2),(1,3)),c12),
                     (((2,1),(2,2)),c21),(((2,2),(2,3)),c22),
                     (((3,1),(3,2)),c31),(((3,2),(3,3)),c32)]
    psum = sum (M.elems ps)
    board = M.empty
    chokudai = gsearch board 0 ps
  print chokudai
  print (psum - chokudai)

gsearch :: Map (Int,Int) Check -> Int -> Map ((Int,Int),(Int,Int)) Int -> Int
gsearch board 9 ps = score board ps
gsearch board t ps
  | even t    = maximum [gsearch (M.insert (i,j) O board) (t+1) ps | i<-[1..3], j<-[1..3], M.notMember (i,j) board]
  | otherwise = minimum [gsearch (M.insert (i,j) X board) (t+1) ps | i<-[1..3], j<-[1..3], M.notMember (i,j) board]

score :: Map (Int,Int) Check -> Map ((Int,Int),(Int,Int)) Int -> Int
score board ps = sum [south i j + east i j | i<-[1..3], j<-[1..3]]
  where
    south i j = if i<3 && board!(i,j) == board!(i+1,j) then ps!((i,j),(i+1,j)) else 0
    east i j = if j<3 && board!(i,j) == board!(i,j+1) then ps!((i,j),(i,j+1)) else 0

Submission Info

Judge Result